On complexity of verification of interacting agents’ behavior

Abstract

This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to the transition system induced by the definition of the multi-agent system. We establish various tight complexity bounds of the behavior properties under natural structural and semantic restrictions on agent programs and actions.

Polynomial Algorithm of Verication for Subset of PLTL Logic

“…В частности, в работе [2] был предложен алгоритм для нахождения вероятности выполнения темпоральной формулы языка PLTL на траекториях конечной цепи Маркова. В работах [3,4] было показано, как проблема верификации вероятностных многоагентных систем может быть сведена к верификации конечных цепей Маркова. Обзоры некоторых других подходов к верификации цепей Маркова для различных темпоральных логик приводятся в работах [5,6,7].…”

Temporal Verification of Probabilistic Multi-Agent Systems

“…If p AB (1) = 1 for all agents of MAS we have synchronous variant of multi-agent systems. Such systems were considered in [8,9]. If p AB (1) = 0.5, p AB (2) = 0.4 and p AB (t) = 0 when t > 2, then the half of messages sent to B by A will be received in the next time, 4/10 of them will be on the path 2 steps, and average 1/10 of them will be lost in the channel.…”

“…States of MAS have a structure of finite models. Hence it is natural to extend logics for specifying their dynamic properties by introducing first-order features (as in [8,9]. Namely, the extension is that ordinary closed first-order formulas in signature of internal databases of agents (called basic state formulas) can be used in formulas instead of propositional variables.…”

“…Another popular approach to describing agents is based on "Believe-Desire-Intention" model initiated in [14] (see also [4,5,20]. In our previous papers [8,9] we considered verification complexity for MAS constructed on the base of IMPACT-architecture introduced in [16].…”