When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1837
URN: urn:nbn:de:0030-drops-18375
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1837/
 Go to the corresponding LIPIcs Volume Portal

Qualitative Reachability in Stochastic BPA Games

 pdf-format:

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 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 \$\textbf{NP} \cap \textbf{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.

BibTeX - Entry

```@InProceedings{brazdil_et_al:LIPIcs:2009:1837,
author =	{Tomas Brazdil and Vaclav Brozek and Antonin Kucera and Jan Obdrzalek},
title =	{{Qualitative Reachability in Stochastic BPA Games}},
booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
pages =	{207--218},
series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN =	{978-3-939897-09-5},
ISSN =	{1868-8969},
year =	{2009},
volume =	{3},
editor =	{Susanne Albers and Jean-Yves Marion},
publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},