On complexity of verification of interacting agents' behavior

DOI10.1016/j.apal.2005.12.003zbMath1096.68143OpenAlexW2030117515MaRDI QIDQ2498917

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

Publication date: 16 August 2006

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.12.003

zbMATH Keywords

complexity\(\mu\)-calculusmodel checkingmulti-agent systemstemporal logics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (3)

Biography of Alexandre Dikovsky ⋮ On feasible cases of checking multi-agent systems behavior. ⋮ Systems of agents controlled by logical programs: complexity of verification

Uses Software

• METATEM

Cites Work

• Results on the propositional \(\mu\)-calculus
• Local model checking in the modal mu-calculus
• Propositional dynamic logic of regular programs
• On feasible cases of checking multi-agent systems behavior.
• MetateM: An introduction
• Alternation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On complexity of verification of interacting agents' behavior