Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems

DOI10.3233/FI-2010-276zbMath1213.68382OpenAlexW1799163117MaRDI QIDQ3081902

Hongyang Qu, Alessio Lomuscio, Wojciech Penczek

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

zbMATH Keywords

verificationmulti-agent systemspartial order reductioninterleaved interpreted systemsstuttering-equivalence

Mathematics Subject Classification ID

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

Related Items (6)

A counter abstraction technique for verifying properties of probabilistic swarm systems ⋮ A survey on temporal logics for specifying and verifying real-time systems ⋮ 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 Verification of Dialogue Protocols: A Mathematical Model ⋮ Parameterised verification for multi-agent systems

Uses Software

• VerICS

This page was built for publication: Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems