Optimizing Winning Strategies in Regular Infinite Games
From MaRDI portal
Publication:5448640
DOI10.1007/978-3-540-77566-9_10zbMath1132.91318OpenAlexW1594279492MaRDI QIDQ5448640
Publication date: 7 March 2008
Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_10
Cites Work
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- The complexity of mean payoff games on graphs
- Efficient minimization of deterministic weak \(\omega\)-automata
- Optimal strategy synthesis for request-response games
- Memory Reduction for Strategies in Infinite Games
- Parametric temporal logic for “model measuring”
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Simulation Relations for Alternating Parity Automata and Parity Games
- On the synthesis of strategies in infinite games
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Solving Sequential Conditions by Finite-State Strategies
This page was built for publication: Optimizing Winning Strategies in Regular Infinite Games
