Exponential improvement of time complexity of model checking for multiagent systems with perfect recall

DOI10.1134/S0361768812060047zbMath1257.68151OpenAlexW2087531550MaRDI QIDQ1938921

Yanyan Li

Publication date: 26 February 2013

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768812060047

zbMATH Keywords

model checkingmultiagent systemscomputation tree logicpropositional logic of knowledge

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Logic in artificial intelligence (68T27) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Symbolic model checking: \(10^{20}\) states and beyond
• Algorithmic analysis of programs with well quasi-ordered domains.
• Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems
• Well-Structured Model Checking of Multiagent Systems
• Complete Axiomatizations for Reasoning about Knowledge and Time
• Well-structured transition systems everywhere!

This page was built for publication: Exponential improvement of time complexity of model checking for multiagent systems with perfect recall