| HAL-Inria | Les publications, logiciels... des scientifiques Inria |
Communication dans un congrès
Qualitative Reachability in Stochastic BPA Games
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 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.
https://hal.inria.fr/inria-00359186
Contributeur : Publications Loria <>
Soumis le : vendredi 6 février 2009 - 11:19:27
Dernière modification le : vendredi 13 février 2009 - 10:27:34
Document(s) archivé(s) le : mardi 8 juin 2010 - 18:45:16
Contributeur : Publications Loria <>
Soumis le : vendredi 6 février 2009 - 11:19:27
Dernière modification le : vendredi 13 février 2009 - 10:27:34
Document(s) archivé(s) le : mardi 8 juin 2010 - 18:45:16
Fichier
17-brazdil.pdf
Fichiers produits par l'(les) auteur(s)