On complexity of verification of interacting agents' behavior

Annals of Pure and Applied Logic 141 (3):336-362 (2006)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Formal Modelling and Verification of Probabilistic Resource Bounded Agents.Hoang Nga Nguyen & Abdur Rakib - 2023 - Journal of Logic, Language and Information 32 (5):829-859.
A Reasoning Method based on Spatio-Temporal.Seyed Ahmad Mirsanei - 2016 - International Journal of Computer and Information Technologies (Ijocit) 4 (1): 27-32..

Analytics

Added to PP
2013-12-31

Downloads
31 (#730,306)

6 months
9 (#492,507)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Biography of Alexandre Dikovsky.Denis Béchet & Michael Dekhtyar - 2017 - Journal of Logic, Language and Information 26 (4):333-340.

Add more citations

References found in this work

Agent-oriented programming.Yoav Shoham - 1993 - Artificial Intelligence 60 (1):51-92.

Add more references