Qualitative Reachability in Stochastic BPA Games

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš BROŽEK Václav KUČERA Antonín OBDRŽÁLEK Jan

Year of publication 2009
Type Article in Proceedings
Conference Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Web DOI
Field Informatics
Keywords stochastic games; reachability; BPA
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info