Efficient Algorithms for Omega-Regular Energy Games
From MaRDI portal
Publication:6488464
DOI10.1007/978-3-030-90870-6_9zbMath1522.91065MaRDI QIDQ6488464
Jan Oliver Ringert, Gal Amram, Shahar Maoz, Or Pistiner
Publication date: 21 April 2023
2-person games (91A05) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis of Reactive(1) designs
- Faster algorithms for mean-payoff games
- An improved algorithm for the evaluation of fixpoint expressions
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Energy parity games
- Automata, logics, and infinite games. A guide to current research
- Quantitative solution of omega-regular games
- Model checking games for the quantitative \(\mu \)-calculus
- Strategy synthesis for multi-dimensional quantitative objectives
- An automaton learning approach to solving safety games over infinite graphs
- Performance heuristics for GR(1) synthesis and related algorithms
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Graph-Based Algorithms for Boolean Function Manipulation
- Symbolic model checking for probabilistic processes
- STACS 2004
- Algorithms for Omega-Regular Games with Imperfect Information
- Automata, Languages and Programming
- Automata, Languages and Programming
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Efficient Algorithms for Omega-Regular Energy Games
