Skip to Main content Skip to Navigation
Conference papers

Qualitative Reachability in Stochastic BPA Games

Abstract : 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 pr obability 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 NP ∩ co-NP. 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.
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Friday, February 6, 2009 - 11:19:27 AM
Last modification on : Thursday, January 6, 2022 - 11:38:04 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 6:45:16 PM


Files produced by the author(s)


  • HAL Id : inria-00359186, version 1



Tomas Brazdil, Vaclav Brozek, Antonin Kucera, Jan Obdrzalek. Qualitative Reachability in Stochastic BPA Games. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.207-218. ⟨inria-00359186⟩



Record views


Files downloads