PGSolver
From MaRDI portal
Cited in
(60)- mCRL2
- Haydi: rapid prototyping and combinatorial objects
- Parity game reductions
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Solving parity games via priority promotion
- A delayed promotion policy for parity games
- CoLoSS
- TATL
- Improving parity games in practice
- Runtime enforcement of hyperproperties
- VMC
- BEEM
- Robust worst cases for parity games algorithms
- GIST
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- CAESAR_SOLVE
- Using the compatibility analysis of logical specifications of automata to solve game problems
- Cool
- PRALINE
- MOCHA
- DeltaCCS
- Index appearance record with preorders
- Solving parity games using an automata-based algorithm
- Satisfiability games for branching-time logics
- Two local strategy iteration schemes for parity game solving
- 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
- scientific article; zbMATH DE number 5954369 (Why is no real title available?)
- An exponential lower bound for the latest deterministic strategy iteration algorithms
- Rabinizer
- Semantic labelling and learning for parity game solving in LTL synthesis
- Index appearance record for transforming Rabin automata into parity automata
- Symmetric strategy improvement
- HyTN
- The Stevens-Stirling-algorithm for solving parity games locally requires exponential time
- Haydi
- CTL-RP
- EAGLE
- EVE
- Strix
- 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
- VLDL satisfiability and model checking via tree automata
- Solving Parity Games on the GPU
- CLProver
- Owl
- Delag
- Oink
- ADG
- 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 software: PGSolver
