Modular interpreted systems

We propose a new class of representations that can be used for modeling (and model checking) temporal, strategic and epistemic properties of agents and their teams. Our representations borrow the main ideas from interpreted systems of Halpern, Fagin et al.; however, they are also modular and compact in the way concurrent programs are. We also mention preliminary results on model checking alternating-time temporal logic for this natural class of models.

[1]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

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

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

[4]  Ronald Fagin,et al.  Modelling Knowledge and Action in Distributed Systems , 1988, Concurrency.

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

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

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

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

[9]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

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

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

[12]  Thomas A. Henzinger,et al.  MOCHA: Modularity in Model Checking , 1998, CAV.

[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]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

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

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

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

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

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

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

[22]  W. Jamroga,et al.  Modular Interpreted Systems : A Preliminary Report , 2006 .

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

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

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