PGSolver

swMATH14051MaRDI QIDQ25960FDOQ25960

Author name not available (Why is that?)

Official website: https://github.com/tcsprojects/pgsolver

Source code repository: https://github.com/tcsprojects/pgsolver

Described by source

• Solving parity games in practice

Cited In (59)

• 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
• Title not available (Why is that?)
• Solving Parity Games on the GPU
• An exponential lower bound for the latest deterministic strategy iteration algorithms
• Delag
• Solving parity games via priority promotion
• Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
• Verification of reactive systems via instantiation of parameterised Boolean equation systems
• Graph operations on parity games and polynomial-time algorithms
• Satisfiability games for branching-time logics
• Parity game reductions
• Runtime enforcement of hyperproperties
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• Solving parity games using an automata-based algorithm
• Semantic labelling and learning for parity game solving in LTL synthesis
• Index appearance record for transforming Rabin automata into parity automata
• Title not available (Why is that?)
• A delayed promotion policy for parity games
• A delayed promotion policy for parity games
• CoLoSS
• TATL
• BEEM
• GIST
• CAESAR_SOLVE
• VMC
• Cool
• MOCHA
• PRALINE
• DeltaCCS
• The Rabin index of parity games: its complexity and approximation
• EVE
• Rabinizer
• HyTN
• Haydi
• CTL-RP
• EAGLE
• Strix
• Using the compatibility analysis of logical specifications of automata to solve game problems
• VLDL satisfiability and model checking via tree automata
• CLProver
• Index appearance record with preorders
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficiently deciding \(\mu\)-calculus with converse over finite trees
• ADG
• Owl
• Improving parity game solvers with justifications
• Oink
• 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
• Partial solvers for parity games: effective polynomial-time composition
• Haydi: rapid prototyping and combinatorial objects
• Symmetric strategy improvement
• Two local strategy iteration schemes for parity game solving
• Recursive algorithm for parity games requires exponential time

This page was built for software: PGSolver