On feasible cases of checking multi-agent systems behavior

On feasible cases of checking multi-agent systems behavior

The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using classical temporal logic languages and are checked relative to the transition system induced by the multi-agent system definition. We show that there are deterministic or nondeterminist...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science 2003-06, Vol.303 (1), p.63-81
Hauptverfasser: Dekhtyar, Michael, Dikovsky, Alexander, Valiev, Mars
Format: Artikel
Sprache:eng
Schlagworte:
Complexity
Computation and Language
Computer Science
Document and Text Processing
Model checking
Multi-agent system
Temporal logics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The complexity of multi-agent systems behavior properties is studied. The behavior properties are formulated using classical temporal logic languages and are checked relative to the transition system induced by the multi-agent system definition. We show that there are deterministic or nondeterministic polynomial time check algorithms under some realistic structural and semantic restrictions on agent programs and actions.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(02)00445-0