Qualitative reachability in stochastic BPA games

DOI10.1016/j.ic.2011.02.002zbMath1237.91035MaRDI QIDQ719240

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

Publication date: 10 October 2011

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/1837/

Mathematics Subject Classification ID

91A15: Stochastic games, stochastic differential games

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

Related Items

Determinacy and optimal strategies in infinite-state stochastic reachability games, Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes, Qualitative analysis of concurrent mean-payoff games, Hyperplane separation technique for multidimensional mean-payoff games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reachability in recursive Markov decision processes
• The complexity of stochastic games
• Model checking LTL with regular valuations for pushdown systems
• Quantitative solution of omega-regular games
• Finitely additive stochastic games with Borel measurable payoffs
• A lattice-theoretical fixpoint theorem and its applications
• Random walks with “back buttons” (extended abstract)
• Recursive Stochastic Games with Positive Rewards
• Process Algebra
• The determinacy of Blackwell games
• Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
• Computer Science Logic
• Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
• Stochastic Games with Lossy Channels
• Automata, Languages and Programming
• Automata, Languages and Programming
• Recursive Concurrent Stochastic Games