Recommendations
Cites work
- A deterministic subexponential algorithm for solving parity games
- A Multi-Core Solver for Parity Games
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- Complementation, Disambiguation, and Determinization of Büchi Automata Unified
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Depth-First Search and Linear Graph Algorithms
- Games for synthesis of controllers with partial observation.
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Polynomial-time under-approximation of winning regions in parity games
- Solving Parity Games in Big Steps
Cited in
(62)- Solving parity games: explicit vs symbolic
- Parity game reductions
- Solving parity games via priority promotion
- A delayed promotion policy for parity games
- Improving parity games in practice
- Robust worst cases for parity games algorithms
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Using the compatibility analysis of logical specifications of automata to solve game problems
- Partial solvers for generalized parity games
- PGSolver
- Index appearance record with preorders
- On parity game preorders and the logic of matching plays
- Static analysis of parity games: alternating reachability under parity
- Solving parity games using an automata-based algorithm
- Two local strategy iteration schemes for parity game solving
- A cure for stuttering parity games
- Efficiently deciding -calculus with converse over finite trees
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Recursive algorithm for parity games requires exponential time
- Algorithms for solving parity games
- Cooking Your Own Parity Game Preorders Through Matching Plays
- Winning Regions of Pushdown Parity Games: A Saturation Method
- Semantic labelling and learning for parity game solving in LTL synthesis
- Index appearance record for transforming Rabin automata into parity automata
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- A comparison of BDD-based parity game solvers
- A CSP-Based Approach for Solving Parity Game
- Solving parity games by a reduction to SAT
- Algorithms for Parity Games
- Solving parity games via priority promotion
- Zielonka's recursive algorithm: dull, weak and solitaire games and tighter bounds
- Improvement in small progress measures
- Partial solvers for parity games: effective polynomial-time composition
- A delayed promotion policy for parity games
- A parity game tale of two counters
- Simple fixpoint iteration to solve parity games
- scientific article; zbMATH DE number 7455738 (Why is no real title available?)
- Family-based SPL model checking using parity games with variability
- Deciding Parity Games in Quasi-polynomial Time
- Local strategy improvement for parity game solving
- Solving mean-payoff games via quasi dominions
- Solving Parity Games on the GPU
- A Multi-Core Solver for Parity Games
- Mathematical Foundations of Computer Science 2003
- A decision procedure for \(\mathrm{CTL}^{*}\) based on tableaux and automata
- Generalized Parity Games
- Attracting tangles to solve parity games
- Reachability games and parity games
- HyperATL*: A Logic for Hyperproperties in Multi-Agent Systems
- Justifications and a reconstruction of parity game solving algorithms
- Solving mean-payoff games via quasi dominions
- A matrix-based approach to parity games
- On-the-fly solving for symbolic parity games
- Guessing winning policies in LTL synthesis by semantic learning
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism
- Operations on fixpoint equation systems
- Priority promotion with Parysian flair
- Systems of fixpoint equations: abstraction, games, up-to techniques and local algorithms
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Improving parity game solvers with justifications
- The Rabin index of parity games: its complexity and approximation
- Graph operations on parity games and polynomial-time algorithms
This page was built for publication: Solving parity games in practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648698)
