On complexity of verification of interacting agents' behavior

DOI10.1016/J.APAL.2005.12.003MaRDI QIDQ2498917zbMATH OpenOpenAlexFDO

Authors Michael I. Dekhtyar, Alexandre Dikovsky, M. K. Valiev

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

complexitymodel checkingmulti-agent systemstemporal logics\(\mu\)-calculus

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1931654
• On feasible cases of checking multi-agent systems behavior.
• Systems of agents controlled by logical programs: complexity of verification
• Specification and Verification of Multi-Agent Systems
• On the (un-)decidability of model checking resource-bounded agents

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 1202873 (Why is no real title available?)
• scientific article; zbMATH DE number 1059247 (Why is no real title available?)
• scientific article; zbMATH DE number 1142320 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 1759734 (Why is no real title available?)
• scientific article; zbMATH DE number 1931654 (Why is no real title available?)
• scientific article; zbMATH DE number 2088153 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• Alternation
• Local model checking in the modal mu-calculus
• MetateM: An introduction
• On feasible cases of checking multi-agent systems behavior.
• Propositional dynamic logic of regular programs
• Results on the propositional \(\mu\)-calculus

Cited in

(14)

• The computational complexity of scenario-based agent verification and design
• Artificial Intelligence: Methodology, Systems, and Applications
• Compositional verification of a multi-agent system for one-to-many negotiation
• On the (un-)decidability of model checking resource-bounded agents
• Stability and strategic time-dependent behaviour in multiagent systems
• Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration
• scientific article; zbMATH DE number 1931654 (Why is no real title available?)
• Methods for agent synchronization behaviour in system verification in terms of multi-agent environments
• Systems of agents controlled by logical programs: complexity of verification
• Expressing and verifying temporal and structural properties of mobile agents
• Biography of Alexandre Dikovsky
• On feasible cases of checking multi-agent systems behavior.
• Verifying systems of resource-bounded agents
• scientific article; zbMATH DE number 2088153 (Why is no real title available?)

Describes a project that uses

Uses Software

• METATEM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498917)