Partial order reductions for model checking temporal-epistemic logics over interleaved multi-agent systems

DOI10.3233/FI-2010-276zbMATH Open1213.68382OpenAlexW1799163117MaRDI QIDQ3081902FDOQ3081902

Authors: Alessio Lomuscio, Wojciech Penczek, Hongyang Qu 

Publication date: 9 March 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-276

Recommendations

• Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
• Parallel model checking for temporal epistemic logic
• Model checking temporal-epistemic logic using alternating tree automata
• scientific article; zbMATH DE number 2064229
• Abstractions of Multi-agent Systems

zbMATH Keywords

verificationmulti-agent systemspartial order reductioninterleaved interpreted systemsstuttering-equivalence

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Cited In (8)

• Parameterised verification for multi-agent systems
• A survey on temporal logics for specifying and verifying real-time systems
• A counter abstraction technique for verifying properties of probabilistic swarm systems
• Towards verification of dialogue protocols: a mathematical model
• Towards partial order reductions for strategic ability
• An abstraction-refinement framework for verifying strategic properties in multi-agent systems with imperfect information
• Exponential improvement of time complexity of model checking for multiagent systems with perfect recall
• Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic

Uses Software

• VerICS

This page was built for publication: Partial order reductions for model checking temporal-epistemic logics over interleaved multi-agent systems

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