Optimal Strategy Synthesis in Stochastic Müller Games

DOI10.1007/978-3-540-71389-0_11zbMATH Open1195.68065OpenAlexW2151831839MaRDI QIDQ5758043FDOQ5758043

Krishnendu Chatterjee

Publication date: 7 September 2007

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71389-0_11

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Games on graphs (graph-theoretic aspects) (05C57) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (7)

• A survey of stochastic \(\omega \)-regular games
• Automata, Languages and Programming
• Stochastic Müller Games are PSPACE-Complete
• Compositional strategy synthesis for stochastic games with multiple objectives
• The complexity of stochastic Müller games
• Simplifying Optimal Strategies in Stochastic Games
• Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives

   Recommendations

• The complexity of stochastic Müller games 👍 👎
• Stochastic Müller Games are PSPACE-Complete 👍 👎
• Automata, Languages and Programming 👍 👎
• Perfect-Information Stochastic Mean-Payoff Parity Games 👍 👎
• Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives 👍 👎

This page was built for publication: Optimal Strategy Synthesis in Stochastic Müller Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758043)