A comparison of BDD-based parity game solvers
From MaRDI portal
Recommendations
Cites work
- A delayed promotion policy for parity games
- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
- An overview of the mCRL2 toolset and its recent advances
- Branching Programs and Binary Decision Diagrams
- Deciding parity games in quasipolynomial time
- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
- Fast and simple nested fixpoints
- Games for synthesis of controllers with partial observation.
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- Improved set-based symbolic algorithms for parity games
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Parameterised Boolean equation systems
- Solving parity games in practice
- Solving parity games using an automata-based algorithm
- Solving parity games via priority promotion
- Solving μ-Calculus Parity Games by Symbolic Planning
- STACS 2004
- Succinct progress measures for solving parity games
- The fixpoint-iteration algorithm for parity games
- Zielonka's recursive algorithm: dull, weak and solitaire games and tighter bounds
Cited in
(6)- Partial solvers for generalized parity games
- Simple fixpoint iteration to solve parity games
- scientific article; zbMATH DE number 7455738 (Why is no real title available?)
- On-the-fly solving for symbolic parity games
- Priority promotion with Parysian flair
- Improving parity game solvers with justifications
This page was built for publication: A comparison of BDD-based parity game solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384882)