Qualitative Reachability in Stochastic BPA Games

DOI10.4230/LIPIcs.STACS.2009.1837zbMath1236.68078OpenAlexW2243301700MaRDI QIDQ5389978

Tomáš Brázdil, Václav Brožek, Jan Obdržálek, Antonín Kučera

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_c2ff.html

zbMATH Keywords

reachabilitystochastic gamespushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Determinacy and optimal strategies in infinite-state stochastic reachability games ⋮ Branching-time model-checking of probabilistic pushdown automata ⋮ Approximating the Termination Value of One-Counter MDPs and Stochastic Games ⋮ Regularity in PDA Games Revisited

This page was built for publication: Qualitative Reachability in Stochastic BPA Games