Modular Interpreted Systems : A Preliminary Report

We propose a new class of representations that can be used for modeling (and model checking) of temporal, strategic and epistemic properties of agents and their teams. Our representations borrow the main ideas from interpreted systems of Fagin et al.; however, they are also modular and compact in the way concurrent programs are. Furthermore, we show that model checking alternating-time temporal logic for this natural class of models is cheaper for agents with incomplete information, than for perfect information agents. The result, while technically not very difficult, is still somewhat surprising in the light of other complexity results that have been established so far.

[1]  A. P. Sistla,et al.  Automatic verification of finite-state concurrent systems using temporal logic specifications , 1986, TOPL.

[2]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[3]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[4]  Kenneth L. McMillan,et al.  The SMV System , 1993 .

[5]  Joseph Y. Halpern,et al.  Reasoning about knowledge: a survey , 1995 .

[6]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[7]  Thomas A. Henzinger,et al.  Reactive Modules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[8]  Mark Ryan,et al.  On the Relation between Interpreted Systems and Kripke Models , 1997, Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications.

[9]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[11]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[12]  Wang Yi,et al.  New Generation of UPPAAL , 1998 .

[13]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[14]  M. de Rijke,et al.  Model Checking for combined logics , 2000 .

[15]  Dirk Beyer.  Rabbit: Verification of Real-Time Systems , 2001 .

[16]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

[17]  Wojciech Penczek,et al.  Verics: A Tool for Verifying Timed Automata and Estelle Specifications , 2003, TACAS.

[18]  Wojciech Penczek,et al.  Verifying epistemic properties of multi-agent systems via bounded model checking , 2002, AAMAS '03.

[19]  Luca Bernardinello,et al.  Modelling Mobility with Petri Hypernets , 2004, WADT.

[20]  Wojciech Jamroga,et al.  Comparing Semantics of Logics for Multi-Agent Systems , 2004, Synthese.

[21]  Alessio Lomuscio,et al.  Automatic Verification of Deontic Interpreted Systems by Model Checking via OBDD's , 2004, ECAI.

[22]  Pierre-Yves Schobbens,et al.  Alternating-time logic with imperfect recall , 2004, LCMAS.

[23]  Alessio Lomuscio,et al.  The complexity of symbolic model checking temporal-epistemic logics , 2005 .

[24]  Vladimiro Sassone,et al.  Bulletin of the European Association for Theoretical Computer Science , 2005 .

[25]  Jürgen Dix,et al.  Do Agents Make Model Checking Explode (Computationally)? , 2005, CEEMAS.

[26]  Michael Wooldridge,et al.  On the complexity of practical ATL model checking , 2006, AAMAS '06.

[27]  Jürgen Dix,et al.  Model Checking Abilities of Agents: A Closer Look , 2008, Theory of Computing Systems.

[28]  Nicolas Markey,et al.  On the Expressiveness and Complexity of ATL , 2007, FoSSaCS.