Timed games with bounded window parity objectives
From MaRDI portal
Publication:2112117
DOI10.1007/978-3-031-15839-1_10OpenAlexW4293399538MaRDI QIDQ2112117
Mickael Randour, James C. A. Main, Jeremy Sproston
Publication date: 18 January 2023
Full work available at URL: https://arxiv.org/abs/2205.04197
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trading performance for stability in Markov decision processes
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- Model-checking in dense real-time
- From liveness to promptness
- A theory of timed automata
- Looking at mean payoff through foggy windows
- Reasoning about cost-utility constraints in probabilistic models
- Model checking for probabilistic timed automata
- Looking at mean-payoff and total-payoff through windows
- Finitary winning in ω-regular games
- The Complexity of Request-Response Games
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- On the synthesis of discrete controllers for timed systems
- Stability in Graphs and Games
- On the complexity of heterogeneous multidimensional quantitative games
- Weight monitoring with linear temporal logic
- Deciding parity games in quasipolynomial time
- Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
- Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
- Generalized Parity Games
- Timed Parity Games: Complexity and Robustness
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Timed games with bounded window parity objectives
