Solving μ-Calculus Parity Games by Symbolic Planning
From MaRDI portal
Publication:3614877
DOI10.1007/978-3-642-00431-5_2zbMath1226.68041MaRDI QIDQ3614877
Stefan Edelkamp, Clemens D. Renner, Peter Kissmann, Marco Bakera
Publication date: 17 March 2009
Published in: Model Checking and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00431-5_2
91A80: Applications of game theory
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Fast and simple nested fixpoints
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- A deterministic subexponential algorithm for solving parity games
- On the synthesis of strategies in infinite games
- Tools and Algorithms for the Construction and Analysis of Systems
- STACS 2004
- A Multi-Core Solver for Parity Games
- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
- Solving Parity Games in Big Steps
