Další formáty:
BibTeX
LaTeX
RIS
@article{908976, author = {Brázdil, Tomáš and Brožek, Václav and Kučera, Antonín and Obdržálek, Jan}, article_number = {8}, keywords = {pushdown automata; turn-based games}, language = {eng}, issn = {0890-5401}, journal = {Information and Computation}, title = {Qualitative Reachability in Stochastic BPA Games}, volume = {209}, year = {2011} }
TY - JOUR ID - 908976 AU - Brázdil, Tomáš - Brožek, Václav - Kučera, Antonín - Obdržálek, Jan PY - 2011 TI - Qualitative Reachability in Stochastic BPA Games JF - Information and Computation VL - 209 IS - 8 SP - 1160-1183 EP - 1160-1183 PB - Elsevier SN - 08905401 KW - pushdown automata KW - turn-based games 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 PTIME for the `>0' constraint, and in NP intersect. coNP for the `=1' constraint. 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 a Jan OBDRŽÁLEK. Qualitative Reachability in Stochastic BPA Games. \textit{Information and Computation}. Elsevier, 2011, roč.~209, č.~8, s.~1160-1183. ISSN~0890-5401.
|