Complete axiomatization and decidability of Alternating-time temporal logic

Alternating-time Temporal Logic (ATL), introduced by Alur, Henzinger and Kupferman, is a logical formalism for the specification and verification of open systems involving multiple autonomous players (agents, components). In particular, this logic allows for the explicit expression of coalition abilities in such systems, modelled as infinite transition games between the coalition and its complement.Formally, ATL is a non-normal multi-modal extension of CTL (regarded as a one-player fragment of ATL) with temporal operators indexed by coalitions of players, and thus expressing selective quantification over those paths which can be effected as outcomes of infinite transition games between the coalition and its complement.We present a sound and complete axiomatization of the logic ATL, based on Pauly's axiomatization of his Coalition Logic, augmented with axioms and rules for fixed point formulae characterizing the temporal operators. The completeness proof is by construction of a bounded branching tree model for each ATL-consistent formula. These models can be folded into finite models, thus rendering the finite model property for ATL.We also describe an automata-based decision procedure for ATL by translating the satisfiability problem to the nonemptiness problem for alternating automata on infinite trees. When considering formulae over a fixed finite set of players the decidability problem is shown to be EXPTIME-complete.

[1]  Pierre-Yves Schobbens,et al.  Agents and Roles: Refinement in Alternating-Time Temporal Logic , 2001, ATAL.

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

[3]  A. Arnold,et al.  Rudiments of μ-calculus , 2001 .

[4]  R. Goldblatt Logics of Time and Computation , 1987 .

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

[6]  Moshe Y. Vardi Alternating Automata and Program Verification , 1995, Computer Science Today.

[7]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[8]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

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

[10]  David E. Muller,et al.  Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra , 1995, Theor. Comput. Sci..

[11]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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

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

[14]  M. Pauly A Logical Framework for Coalitional Effectivity in Dynamic Procedures , 2001 .

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

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