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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 303; číslo 1; s. 63 - 81
Hlavní autoři: Dekhtyar, Michael, Dikovsky, Alexander, Valiev, Mars
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 28.06.2003
Elsevier
Témata:
Complexity
Computation and Language
Computer Science
Document and Text Processing
Model checking
Multi-agent system
Temporal logics
Temporal logics
Model checking
Multi-agent system
Complexity
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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