Qualitative Reachability in Stochastic BPA Games - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Qualitative Reachability in Stochastic BPA Games

Tomas Brazdil
  • Function : Author
  • PersonId : 857846
Vaclav Brozek
  • Function : Author
  • PersonId : 857847
Antonin Kucera
  • Function : Author
  • PersonId : 857848
Jan Obdrzalek
  • Function : Author
  • PersonId : 857849


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.
Fichier principal
Vignette du fichier
17-brazdil.pdf (159 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00359186 , version 1 (06-02-2009)


  • 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⟩


73 View
239 Download


Gmail Facebook X LinkedIn More