Optimal strategy synthesis for request-response games
From MaRDI portal
Publication:3465629
DOI10.1051/ita/2015005zbMath1347.68206arXiv1406.4648MaRDI QIDQ3465629
Martín G. Zimmermann, Wolfgang Thomas, Nico Wallmeier, Florian Horn
Publication date: 22 January 2016
Published in: RAIRO - Theoretical Informatics and Applications, Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.4648
91A05: 2-person games
91A43: Games involving graphs
91A80: Applications of game theory
68Q45: Formal languages and automata
91A44: Games involving topology, set theory, or logic
Related Items
Cites Work
- Unnamed Item
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- Automata, logics, and infinite games. A guide to current research
- Parametric temporal logic for “model measuring”
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games
- On the synthesis of strategies in infinite games
- Hybrid Systems: Computation and Control
- From Liveness to Promptness
- Mathematical Foundations of Computer Science 2005
- Solving Sequential Conditions by Finite-State Strategies
- Faster Algorithms for Finitary Games
- CONCUR 2005 – Concurrency Theory
- Tools and Algorithms for the Construction and Analysis of Systems