Solving Partial-Information Stochastic Parity Games

We study one-sided partial-information 2-player concurrent stochastic games with parity objectives. In such a game, one of the players has only partial visibility of the state of the game, while the other player has complete knowledge. In general, such games are known to be undecidable, even for the case of a single player (POMDP). These undecidability results depend crucially on player strategies that exploit an infinite amount of memory. However, in many applications of games, one is usually more interested in finding a finite-memory strategy. We consider the problem of whether the player with partial information has a finite-memory winning strategy when the player with complete information is allowed to use an arbitrary amount of memory. We show that this problem is decidable.

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

[2]  Krishnendu Chatterjee,et al.  The Complexity of Partial-Observation Parity Games , 2010, LPAR.

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

[4]  Krishnendu Chatterjee,et al.  Semiperfect-Information Games , 2005, FSTTCS.

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

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

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

[8]  Azaria Paz,et al.  Introduction to probabilistic automata (Computer science and applied mathematics) , 1971 .

[9]  Giora Slutzki,et al.  Alternating Tree Automata , 1983, Theoretical Computer Science.

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

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

[12]  Moshe Y. Vardi.  Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach , 1999, ARTS.

[13]  Yoad Lustig,et al.  Synthesis from Probabilistic Components , 2014, CSL.

[14]  Thomas Wilke,et al.  Alternating tree automata, parity games, and modal {$\mu$}-calculus , 2001 .

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

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

[17]  Andreas Blass,et al.  Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem , 2007, Log. Methods Comput. Sci..

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

[19]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[20]  Orna Kupfermant,et al.  Synthesis with Incomplete Informatio , 2000 .

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

[22]  Mariëlle Stoelinga,et al.  An Introduction to Probabilistic Automata , 2002, Bull. EATCS.

[23]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[24]  Giora Slutzki,et al.  Alternating Tree Automata , 1983, Theor. Comput. Sci..