ATL* Satisfiability Is 2EXPTIME-Complete

The two central decision problems that arise during the design of safety critical systems are the satisfiability and the model checking problem. While model checking can only be applied after implementing the system, satisfiability checking answers the question whether a system that satisfies the specification exists. Model checking is traditionally considered to be the simpler problem --- for branching-time and fixed point logics such as CTL, CTL*, ATL, and the classical and alternating time μ-calculus, the complexity of satisfiability checking is considerably higher than the model checking complexity. We show that ATL* is a notable exception of this rule: Both ATL* model checking and ATL* satisfiability checking are 2EXPTIME-complete.

[1]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[2]  Pierre Wolper,et al.  Synthesis of Communicating Processes from Temporal Logic Specifications , 1981, Logic of Programs.

[3]  Orna Kupferman,et al.  Safraless decision procedures , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[4]  Orna Kupferman,et al.  Safraless Compositional Synthesis , 2006, CAV.

[5]  Bernd Finkbeiner,et al.  Bounded synthesis , 2007, International Journal on Software Tools for Technology Transfer.

[6]  Thomas Wilke,et al.  Alternating tree automata, parity games, and modal {$\mu$}-calculus , 2001 .

[7]  Bernd Finkbeiner,et al.  Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus , 2006, CSL.

[8]  Thomas A. Henzinger,et al.  From verification to control: dynamic programs for omega-regular objectives , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[9]  Orna Kupferman,et al.  Church's Problem Revisited , 1999, Bulletin of Symbolic Logic.

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

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

[12]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[13]  Thomas Wilke.  CTL+ is Exponentially more Succinct than CTL , 1999, FSTTCS.

[14]  G. van Drimmelen.  Satisfiability in alternating-time temporal logic , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[15]  Michael Wooldridge,et al.  ATL Satisfiability is Indeed EXPTIME-complete , 2006, J. Log. Comput..

[16]  Jean-François Raskin,et al.  A game-based verification of non-repudiation and fair exchange protocols , 2003 .