The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies

We consider two-player partial-observation stochastic games on finitestate graphs where player 1 has partial observation and player 2 has perfect observation. The winning condition we study are e-regular conditions specified as parity objectives. The qualitative-analysis problem given a partial-observation stochastic game and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). These qualitative-analysis problems are known to be undecidable. However in many applications the relevant question is the existence of finite-memory strategies, and the qualitative-analysis problems under finite-memory strategies was recently shown to be decidable in 2EXPTIME.We improve the complexity and show that the qualitative-analysis problems for partial-observation stochastic parity games under finite-memory strategies are EXPTIME-complete; and also establish optimal (exponential) memory bounds for finite-memory strategies required for qualitative analysis.

[1]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[2]  Azaria Paz,et al.  Introduction to Probabilistic Automata , 1971 .

[3]  Yang Cai,et al.  Determinization Complexities of ! Automata I , 2013 .

[4]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[5]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[6]  T. Henzinger,et al.  Stochastic o-regular games , 2007 .

[7]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 2002, JACM.

[8]  David E. Muller,et al.  Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity , 1986, ICALP.

[9]  Moshe Y. Vardi,et al.  Solving Partial-Information Stochastic Parity Games , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[10]  Krishnendu Chatterjee,et al.  Partial-Observation Stochastic Games: How to Win When Belief Fails , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[11]  Krishnendu Chatterjee,et al.  Partial-Observation Stochastic Games: How to Win When Belief Fails , 2011, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[12]  Krishnendu Chatterjee,et al.  Simple Stochastic Parity Games , 2003, CSL.

[13]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[14]  Krishnendu Chatterjee,et al.  Qualitative Analysis of Partially-Observable Markov Decision Processes , 2009, MFCS.

[15]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[16]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[17]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

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

[19]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[20]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Incomplete Information ∗ , 2006 .

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

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

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

[24]  Krishnendu Chatterjee,et al.  Algorithms for Omega-Regular Games with Imperfect Information , 2006, Log. Methods Comput. Sci..

[25]  Krishnendu Chatterjee,et al.  What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives , 2013, CSL.

[26]  Dietmar Berwanger,et al.  On the Power of Imperfect Information , 2008, FSTTCS.

[27]  Krishnendu Chatterjee,et al.  Randomness for Free , 2010, MFCS.

[28]  E. Muller David,et al.  Alternating automata on infinite trees , 1987 .

[29]  Christel Baier,et al.  On Decision Problems for Probabilistic Büchi Automata , 2008, FoSSaCS.

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

[31]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[32]  Nathalie Bertrand,et al.  Qualitative Determinacy and Decidability of Stochastic Games with Signals , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[33]  John H. Reif,et al.  The Complexity of Two-Player Games of Incomplete Information , 1984, J. Comput. Syst. Sci..

[34]  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..