Regularity in PDA Games Revisited

DOI10.1016/j.entcs.2009.08.024zbMath1291.68227OpenAlexW2099031058MaRDI QIDQ5170272

Václav Brožek

Publication date: 23 July 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.08.024

zbMATH Keywords

regularityreachabilitymodel-checkingstochastic gamespushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Stochastic games, stochastic differential games (91A15) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Reachability in recursive Markov decision processes
• The determinacy of Blackwell games
• Qualitative Reachability in Stochastic BPA Games
• Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regularity in PDA Games Revisited