Down the Borel hierarchy: solving Muller games via safety games
From MaRDI portal
Publication:477197
DOI10.1016/j.tcs.2014.01.017zbMath1314.91053arXiv1210.2457OpenAlexW1994610451MaRDI QIDQ477197
Roman Rabinovich, Daniel Neider, Martín G. Zimmermann
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.2457
2-person games (91A05) Games involving graphs (91A43) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Assume-admissible synthesis, Quantitative reductions and vertex-ranked infinite games, Compositional construction of most general controllers
Uses Software
Cites Work
- Antichains and compositional algorithms for LTL synthesis
- Faster algorithms for mean-payoff games
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Automata, logics, and infinite games. A guide to current research
- PLAYING MULLER GAMES IN A HURRY
- Finitary winning in ω-regular games
- Explicit Muller Games are PTIME
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
- Small Strategies for Safety Games
- Optimal strategy synthesis for request-response games
- Bounded Synthesis
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Better Quality in Synthesis through Quantitative Objectives
- Time-Optimal Winning Strategies for Poset Games
- Permissive strategies: from parity games to safety games
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
