Augmenting ATL with strategy contexts

We study the extension of the alternating-time temporal logic (ATL) with strategy contexts: contrary to the original semantics, in this semantics the strategy quantifiers do not reset the previously selected strategies.We show that our extension ATL s c is very expressive, but that its decision problems are quite hard: model checking is k-EXPTIME-complete when the formula has k nested strategy quantifiers; satisfiability is undecidable, but we prove that it is decidable when restricting to turn-based games. Our algorithms are obtained through a very convenient translation to QCTL (the computation-tree logic CTL extended with atomic quantification), which we show also applies to Strategy Logic, as well as when strategy quantification ranges over memoryless strategies.

[1]  Farn Wang,et al.  A Temporal Logic for the Interaction of Strategies , 2011, CONCUR.

[2]  D. Harel.  Recurring dominoes: making the highly undecidable highly understandable , 1985 .

[3]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[4]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[5]  Nicolas Markey,et al.  ATL with Strategy Contexts: Expressiveness and Model Checking , 2010, FSTTCS.

[6]  Dirk Walther,et al.  On Satisfiability in ATL with Strategy Contexts , 2012, JELIA.

[7]  Moshe Y. Vardi.  Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.

[8]  Sylvain Schmitz,et al.  Complexity Hierarchies beyond Elementary , 2013, TOCT.

[9]  David Chemouil,et al.  Towards an Updatable Strategy Logic , 2013, SR.

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

[11]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[12]  C. Baier,et al.  Stochastic Game Logic , 2007 .

[13]  Tim French.  Decidability of Quantifed Propositional Branching Time Logics , 2001, Australian Joint Conference on Artificial Intelligence.

[14]  Yde Venema.  Rectangular Games , 1998, J. Symb. Log..

[15]  Wojciech Jamroga,et al.  Alternating-time temporal logics with irrevocable strategies , 2007, TARK '07.

[16]  Wojciech Jamroga,et al.  A logic for strategic reasoning , 2005, AAMAS '05.

[17]  Krishnendu Chatterjee,et al.  Strategy logic , 2007, Inf. Comput..

[18]  Alessio R. Lomuscio,et al.  A Model Checker for Strategy Logic , 2014 .

[19]  Christel Baier,et al.  Stochastic game logic , 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

[20]  Aniello Murano,et al.  On the Boundary of Behavioral Strategies , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[21]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

[22]  Aniello Murano,et al.  What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic , 2012, CONCUR.

[23]  Arnaud Da Costa Lopes,et al.  Quantified CTL: Expressiveness and Model Checking - (Extended Abstract) , 2012, CONCUR.

[24]  Alessio Lomuscio,et al.  MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications , 2014, CAV.

[25]  Farn Wang,et al.  Model-checking iterated games , 2013, Acta Informatica.

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

[27]  Thomas A. Henzinger,et al.  Concurrent reachability games , 2007, Theor. Comput. Sci..

[28]  Nicolas Markey,et al.  ATL with Strategy Contexts and Bounded Memory , 2009, LFCS.

[29]  Nicolas Markey,et al.  Quantified CTL: Expressiveness and Complexity , 2014, Log. Methods Comput. Sci..

[30]  Wojciech Jamroga,et al.  Strategic commitment and release in logics for multi-agent systems , 2008 .

[31]  Orna Kupferman,et al.  Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions , 1995, J. Log. Comput..

[32]  Emiliano Lorini,et al.  Reasoning about Actions Meets Strategic Logics , 2013, LORI.

[33]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[34]  Krishnendu Chatterjee,et al.  Games with secure equilibria , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[35]  A Kurucz,et al.  S5 × S5 × S5 Lacks the Finite Model Property , 2000, Advances in Modal Logic.

[36]  Ágnes Kurucz.  S5 x S5 x S5 Lacks the Finite Model Property. , 2000 .

[37]  R. Maddux.  The equational theory of CA 3 is undecidable , 1980 .

[38]  Sophie Pinchinat.  A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies , 2007, ATVA.

[39]  Aniello Murano,et al.  Reasoning About Strategies: On the Model-Checking Problem , 2011, ArXiv.

[40]  Faron Moller,et al.  On the expressive power of CTL , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[41]  Michael Wooldridge,et al.  Alternating-time temporal logic with explicit strategies , 2007, TARK '07.

[42]  Aravinda Prasad Sistla,et al.  Theoretical issues in the design and verification of distributed systems , 1983 .

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

[44]  Johan van Benthem,et al.  Reasoning about Strategies , 2013, Computation, Logic, Games, and Quantum Foundations.