ATL Satisfiability is Indeed EXPTIME-complete

The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems and game-like multi-agent systems. In this paper, we investigate the computational complexity of the satisfiability problem for ATL. For the case where the set of agents is fixed in advance, this problem was settled at ExpTime-complete in a result of van Drimmelen. If the set of agents is not fixed in advance, then van Drimmelen’s construction yields a 2ExpTime upper bound. In this paper, we focus on the latter case and define three natural variations of the satisfiability problem. Although none of these variations fixes the set of agents in advance, we are able to prove containment in ExpTime for all of them by means of a type elimination construction—thus improving the existing 2ExpTime upper bound to a tight ExpTime one.

[1]  Michael Wooldridge,et al.  Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications , 2002, COORDINATION.

[2]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[3]  Govert van Drimmelen,et al.  Satisfiability in Alternating-time Temporal Logic , 2003, LICS.

[4]  Michael Wooldridge,et al.  Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications , 2003, Stud Logica.

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

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

[7]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  Valentin Goranko,et al.  Complete axiomatization and decidability of Alternating-time temporal logic , 2006, Theor. Comput. Sci..

[9]  Michael Wooldridge,et al.  Logic for Mechanism Design A Manifesto , 2003 .

[10]  Marc Pauly,et al.  Logic for social software , 2000 .

[11]  Michael Wooldridge,et al.  Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications , 2002, KI.

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

[13]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..