scientific article
From MaRDI portal
Publication:3384874
Publication date: 17 December 2021
Full work available at URL: https://arxiv.org/abs/1809.03887
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric linear dynamic logic
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Faster algorithms for mean-payoff games
- From liveness to promptness
- Positional strategies for mean payoff games
- Borel determinacy
- The complexity of mean payoff games on graphs
- Energy parity games
- McNaughton games and extracting strategies for concurrent programs
- Quantitative reductions and vertex-ranked infinite games
- Synthesizing robust systems
- The complexity of multi-mean-payoff and multi-energy games
- Average-energy games
- Generalized Mean-payoff and Energy Games
- Finitary winning in ω-regular games
- The Complexity of Request-Response Games
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Better Quality in Synthesis through Quantitative Objectives
- Synthesizing Optimally Resilient Controllers
- Parity and Streett Games with Costs
This page was built for publication:
