Other formats:
BibTeX
LaTeX
RIS
@inproceedings{798476,
author = {Brázdil, Tomáš and Brožek, Václav and Kučera, Antonín and Obdržálek, Jan},
address = {Freiburg, Germany},
booktitle = {Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science},
keywords = {stochastic games; reachability; BPA},
language = {eng},
location = {Freiburg, Germany},
isbn = {978-3-939897-09-5},
pages = {207-218},
publisher = {IBFI Schloss Dagstuhl},
title = {Qualitative Reachability in Stochastic BPA Games},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1837},
year = {2009}
}
TY - JOUR
ID - 798476
AU - Brázdil, Tomáš - Brožek, Václav - Kučera, Antonín - Obdržálek, Jan
PY - 2009
TI - Qualitative Reachability in Stochastic BPA Games
PB - IBFI Schloss Dagstuhl
CY - Freiburg, Germany
SN - 9783939897095
KW - stochastic games
KW - reachability
KW - BPA
UR - http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1837
N2 - 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 both NP and coNP. 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.
ER -
BRÁZDIL, Tomáš, Václav BROŽEK, Antonín KUČERA and Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. In \textit{Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science}. Freiburg, Germany: IBFI Schloss Dagstuhl, 2009, p.~207-218. ISBN~978-3-939897-09-5.
|
