Dependences in Strategy Logic

Strategy Logic (SL) is a very expressive logic for specifying and verifying properties of multi-agent systems: in SL, one can quantify over strategies, assign them to agents, and express properties of the resulting plays. Such a powerful framework has two drawbacks: first, model checking SL has non-elementary complexity; second, the exact semantics of SL is rather intricate, and may not correspond to what is expected. In this paper, we focus on strategy dependences in SL, by tracking how existentially-quantified strategies in a formula may (or may not) depend on other strategies selected in the formula. We study different kinds of dependences, refining the approach of [Mogavero et al., Reasoning about strategies: On the model-checking problem, 2014], and prove that they give rise to different satisfaction relations. In the setting where strategies may only depend on what they have observed, we identify a large fragment of SL for which we prove model checking can be performed in 2EXPTIME.

[1]  Jean-François Raskin,et al.  The Complexity of Rational Synthesis , 2016, ICALP.

[2]  Giuseppe Perelli,et al.  Synthesis with rational environments , 2016, Annals of Mathematics and Artificial Intelligence.

[3]  Aniello Murano,et al.  Graded modalities in Strategy Logic , 2018, Inf. Comput..

[4]  Aniello Murano,et al.  Strategy logic with imperfect information , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[5]  Catalin Dima,et al.  Epistemic ATL with Perfect Recall, Past and Strategy Contexts , 2012, CLIMA.

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

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

[8]  E. Emerson,et al.  Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) , 1991, FOCS 1991.

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

[10]  Louwe B. Kuijer,et al.  Theoretical Aspects of Rationality and Knowledge (TARK 2017) , 2017 .

[11]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[13]  Patricia Bouyer,et al.  On the semantics of Strategy Logic , 2016, Inf. Process. Lett..

[14]  Aniello Murano,et al.  Quantifying Bounds in Strategy Logic , 2018, CSL.

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

[16]  Ferucio Laurentiu Tiplea,et al.  Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable , 2011, ArXiv.

[17]  Xiaowei Huang,et al.  An Epistemic Strategy Logic , 2014, ACM Trans. Comput. Log..

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

[19]  Stephan Merz,et al.  Model Checking , 2000 .

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

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

[22]  Michael Wooldridge,et al.  Nash Equilibrium and Bisimulation Invariance , 2018, CONCUR.

[23]  J. Hintikka,et al.  Informational Independence as a Semantical Phenomenon , 1989 .

[24]  Patricia Bouyer,et al.  Dependences in Strategy Logic , 2020, Theory of Computing Systems.

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

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

[27]  Jouko A. Väänänen,et al.  Dependence Logic - A New Approach to Independence Friendly Logic , 2007, London Mathematical Society student texts.

[28]  Aniello Murano,et al.  Reasoning about Strategies: on the Satisfiability Problem , 2016, Log. Methods Comput. Sci..

[29]  Dana Fisman,et al.  Rational Synthesis , 2009, TACAS.

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

[31]  Alessio Lomuscio,et al.  Verifying and Synthesising Multi-Agent Systems against One-Goal Strategy Logic Specifications , 2015, AAAI.

[32]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

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

[34]  Patricia Bouyer,et al.  Weighted Strategy Logic with Boolean Goals Over One-Counter Games , 2015, FSTTCS.

[35]  Nicolas Markey,et al.  Augmenting ATL with strategy contexts , 2015, Inf. Comput..

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

[37]  Jean-François Raskin,et al.  Assume-admissible synthesis , 2015, Acta Informatica.

[38]  Aniello Murano,et al.  A Behavioral Hierarchy of Strategy Logic , 2014, CLIMA.

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