On feasible cases of checking multi-agent systems behavior.

DOI10.1016/S0304-3975(02)00445-0zbMath1044.68144OpenAlexW2023051844MaRDI QIDQ1401355

Alexander Dikovsky, Michael I. Dekhtyar, M. K. Valiev

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00445-0

zbMATH Keywords

ComplexityModel checkingTemporal logicsMulti-agent system

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Biography of Alexandre Dikovsky ⋮ On complexity of verification of interacting agents' behavior ⋮ Systems of agents controlled by logical programs: complexity of verification

Cites Work

• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• MetateM: An introduction
• On complexity of verification of interacting agents' behavior
• The complexity of propositional linear temporal logics
• An automata-theoretic approach to branching-time model checking
• Clausal temporal resolution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item