PGSolver
From MaRDI portal
Software:25960
swMATH14051MaRDI QIDQ25960FDOQ25960
Author name not available (Why is that?)
Source code repository: https://github.com/tcsprojects/pgsolver
Cited In (37)
- Improving parity games in practice
- Deciding Parity Games in Quasi-polynomial Time
- Title not available (Why is that?)
- Solving Parity Games on the GPU
- Title not available (Why is that?)
- Solving parity games via priority promotion
- Title not available (Why is that?)
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Graph operations on parity games and polynomial-time algorithms
- Symmetric Strategy Improvement
- Satisfiability games for branching-time logics
- Parity game reductions
- Runtime enforcement of hyperproperties
- Title not available (Why is that?)
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
- THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Efficiently Deciding μ-Calculus with Converse over Finite Trees
- Family-Based SPL Model Checking Using Parity Games with Variability
- Index appearance record with preorders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Parity Games Using an Automata-Based Algorithm
- Improving parity game solvers with justifications
- Robust worst cases for parity games algorithms
- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis
- Index Appearance Record for Transforming Rabin Automata into Parity Automata
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Haydi: rapid prototyping and combinatorial objects
- Two local strategy iteration schemes for parity game solving
- Recursive algorithm for parity games requires exponential time
This page was built for software: PGSolver