Abstract
The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using first order temporal logic languages and are checked relative to the state transition diagram induced by the multi-agent system. Various tight complexity bounds of the behavior properties are established under natural structural and semantic restrictions on agent programs and actions. There are some interesting cases, where the check problem is decidable in deterministic or nondeterministic polynomial time. © 2002 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Dekhtyar, M., Dikovsky, A., & Valiev, M. (2002). Complexity of multi-agent systems behavior. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2424 LNAI, pp. 125–136). Springer Verlag. https://doi.org/10.1007/3-540-45757-7_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
