Cited in
(60)- Recursive algorithm for parity games requires exponential time
- Improving parity games in practice
- Deciding Parity Games in Quasi-polynomial Time
- Family-based SPL model checking using parity games with variability
- The Stevens-Stirling-algorithm for solving parity games locally requires exponential time
- scientific article; zbMATH DE number 7455738 (Why is no real title available?)
- Solving Parity Games on the GPU
- An exponential lower bound for the latest deterministic strategy iteration algorithms
- Solving parity games via priority promotion
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Graph operations on parity games and polynomial-time algorithms
- Parity game reductions
- Satisfiability games for branching-time logics
- Runtime enforcement of hyperproperties
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Solving parity games using an automata-based algorithm
- mCRL2
- CoLoSS
- TATL
- BEEM
- GIST
- CAESAR_SOLVE
- VMC
- Cool
- MOCHA
- PRALINE
- DeltaCCS
- Semantic labelling and learning for parity game solving in LTL synthesis
- Index appearance record for transforming Rabin automata into parity automata
- EVE
- Rabinizer
- HyTN
- Haydi
- CTL-RP
- EAGLE
- Strix
- CLProver
- A delayed promotion policy for parity games
- scientific article; zbMATH DE number 7453081 (Why is no real title available?)
- A delayed promotion policy for parity games
- The Rabin index of parity games: its complexity and approximation
- Using the compatibility analysis of logical specifications of automata to solve game problems
- VLDL satisfiability and model checking via tree automata
- Oink
- Index appearance record with preorders
- scientific article; zbMATH DE number 5954369 (Why is no real title available?)
- Efficiently deciding \(\mu\)-calculus with converse over finite trees
- scientific article; zbMATH DE number 7453080 (Why is no real title available?)
- Improving parity game solvers with justifications
- Robust worst cases for parity games algorithms
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Improvement in small progress measures
- Haydi: rapid prototyping and combinatorial objects
- Partial solvers for parity games: effective polynomial-time composition
- ADG
- Owl
- Delag
- Symmetric strategy improvement
- Two local strategy iteration schemes for parity game solving
This page was built for software: PGSolver
