Qualitative reachability in stochastic BPA games

We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is specified by a regular set of target configurations and a qualitative probability constraint '>0' or '=1'. The goal of one player is to maximize the probability of reaching the target set so that the constraint is satisfied, while the other player aims at the opposite. We show that the winner in such games can be determined in P for the '>0' constraint, and in [email protected]?co-NP for the '=1' constraint. Further, we prove that the winning regions for both players are regular, and we design algorithms which compute the associated finite-state automata. Finally, we show that winning strategies can be synthesized effectively.

[1]  Václav Brožek.  Basic Model Checking Problems for Stochastic Games , 2009 .

[2]  Anna R. Karlin,et al.  Random walks with “back buttons” (extended abstract) , 2000, STOC '00.

[3]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[4]  Donald A. Martin,et al.  The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.

[5]  Hinrich Schütze,et al.  Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.

[6]  Parosh Aziz Abdulla,et al.  Stochastic Games with Lossy Channels , 2008, FoSSaCS.

[7]  William D. Sudderth,et al.  Finitely additive stochastic games with Borel measurable payoffs , 1998, Int. J. Game Theory.

[8]  I. Walukiewicz.  A landscape with games in the background , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[9]  Christel Baier,et al.  Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties , 2005, TOCL.

[10]  Anna R. Karlin,et al.  Random walks with `back buttons' , 2001, STOC 2000.

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

[12]  S. Hart,et al.  HANDBOOK OF GAME THEORY , 2011 .

[13]  Krishnendu Chatterjee,et al.  Quantitative stochastic parity games , 2004, SODA '04.

[14]  Mikko Alava,et al.  Branching Processes , 2009, Encyclopedia of Complexity and Systems Science.

[15]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[16]  Wolfgang Thomas,et al.  Infinite Games and Verification (Extended Abstract of a Tutorial) , 2002, CAV.

[17]  Tomás Brázdil,et al.  Qualitative Reachability in Stochastic BPA Games , 2009, STACS.

[18]  Javier Esparza,et al.  Model-Checking LTL with Regular Valuations for Pushdown Systems , 2001, TACS.

[19]  Tomás Brázdil,et al.  Reachability in recursive Markov decision processes , 2008, Inf. Comput..

[20]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

[21]  Kousha Etessami,et al.  Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games , 2006, STACS.

[22]  Igor Walukiewicz.  A Landscape with Games in the Backgroun , 2004, LICS.

[23]  N. Vieille.  Stochastic Games: recent results , 2001 .

[24]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[25]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[26]  Kousha Etessami,et al.  Recursive Concurrent Stochastic Games , 2008, Log. Methods Comput. Sci..

[27]  Krishnendu Chatterjee,et al.  The Complexity of Stochastic Rabin and Streett Games' , 2005, ICALP.

[28]  Rupak Majumdar,et al.  Quantitative solution of omega-regular games , 2004, J. Comput. Syst. Sci..

[29]  Kousha Etessami,et al.  Recursive Stochastic Games with Positive Rewards , 2008, ICALP.