Probabilistic Strategy Logic

We introduce Probabilistic Strategy Logic, an extension of Strategy Logic for stochastic systems. The logic has probabilistic terms that allow it to express many standard solution concepts, such as Nash equilibria in randomised strategies, as well as constraints on probabilities, such as independence. We study the model-checking problem for agents with perfectand imperfect-recall. The former is undecidable, while the latter is decidable in space exponential in the system and triple-exponential in the formula. We identify a natural fragment of the logic, in which every temporal operator is immediately preceded by a probabilistic operator, and show that it is decidable in space exponential in the system and the formula, and double-exponential in the nesting depth of the probabilistic terms. Taking a fixed nesting depth, this gives a fragment that still captures many standard solution concepts, and is decidable in exponential space.

[1]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[2]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[3]  Taolue Chen,et al.  PRISM-games: A Model Checker for Stochastic Multi-Player Games , 2013, TACAS.

[4]  Marta Z. Kwiatkowska,et al.  The PRISM Benchmark Suite , 2012, 2012 Ninth International Conference on Quantitative Evaluation of Systems.

[5]  Gabriel Santos,et al.  Automated Verification of Concurrent Stochastic Games , 2018, QEST.

[6]  Joseph Y. Halpern.  Beyond nash equilibrium: solution concepts for the 21st century , 2008, PODC '08.

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

[8]  Alessio Lomuscio,et al.  Practical verification of multi-agent systems against Slk specifications , 2017, Inf. Comput..

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

[10]  Marta Z. Kwiatkowska,et al.  Quantitative verification and strategy synthesis for stochastic games , 2016, European Journal of Control.

[11]  Aniello Murano,et al.  Reasoning about graded strategy quantifiers , 2018, Inf. Comput..

[12]  Jian Lu,et al.  Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).

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

[14]  Alessio Lomuscio,et al.  Verification of Broadcasting Multi-Agent Systems against an Epistemic Strategy Logic , 2017, IJCAI.

[15]  B. Nordstrom.  FINITE MARKOV CHAINS , 2005 .

[16]  Henning Schnoor,et al.  Epistemic and Probabilistic ATL with Quantification and Explicit Strategies , 2013, ICAART.

[17]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

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

[19]  Gabriel Santos,et al.  Equilibria-based Probabilistic Model Checking for Concurrent Stochastic Games , 2018, FM.

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

[21]  Krishnendu Chatterjee,et al.  A survey of stochastic ω-regular games , 2012, J. Comput. Syst. Sci..

[22]  Taolue Chen,et al.  Automatic verification of competitive stochastic systems , 2012, Formal Methods in System Design.

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

[24]  Tomás Brázdil,et al.  Stochastic games with branching-time winning objectives , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[25]  Cheng Luo,et al.  A logic of probabilistic knowledge and strategy , 2013, AAMAS.

[26]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Stochastic Multiplayer Games , 2011, Log. Methods Comput. Sci..

[27]  Wojciech Jamroga,et al.  What Agents Can Probably Enforce , 2009, Fundam. Informaticae.

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

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

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

[31]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[32]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[33]  Y VardiMoshe,et al.  An automata-theoretic approach to branching-time model checking , 2000 .

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

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