Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Regularity in PDA Games Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
Qualitative reachability in stochastic BPA games
Information and Computation
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Minimizing expected termination time in one-counter markov decision processes
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Playing games with counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
Determinacy and optimal strategies in infinite-state stochastic reachability games
Theoretical Computer Science
Branching-time model-checking of probabilistic pushdown automata
Journal of Computer and System Sciences
Analyzing probabilistic pushdown automata
Formal Methods in System Design
Hi-index | 0.01 |
We consider a class of infinite-state Markov decision processes generated by stateless pushdown automata. This class corresponds to 112-player games over graphs generated by BPA systems or (equivalently) 1-exit recursive state machines. An extended reachability objective is specified by two sets S and T of safe and terminal stack configurations, where the membership to S and T depends just on the top-of-the-stack symbol. The question is whether there is a suitable strategy such that the probability of hitting a terminal configuration by a path leading only through safe configurations is equal to (or different from) a given x@?{0,1}. We show that the qualitative extended reachability problem is decidable in polynomial time, and that the set of all configurations for which there is a winning strategy is effectively regular. More precisely, this set can be represented by a deterministic finite-state automaton with a fixed number of control states. This result is a generalization of a recent theorem by Etessami and Yannakakis which says that the qualitative termination for 1-exit RMDPs (which exactly correspond to our 112-player BPA games) is decidable in polynomial time. Interestingly, the properties of winning strategies for the extended reachability objectives are quite different from the ones for termination, and new observations are needed to obtain the result. As an application, we derive the EXPTIME-completeness of the model-checking problem for 112-player BPA games and qualitative PCTL formulae.