Recommendations
Cites work
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- A deterministic subexponential algorithm for solving parity games
- A subexponential randomized algorithm for the simple stochastic game problem
- Alternating tree automata, parity games, and modal -calculus
- Alternating-time temporal logic
- An improved algorithm for the evaluation of fixpoint expressions
- DAG-Width and Parity Games
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Fast mu-calculus model checking when tree-width is bounded.
- scientific article; zbMATH DE number 1670778 (Why is no real title available?)
- scientific article; zbMATH DE number 1223729 (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
- Infinite games played on finite graphs
- Results on the propositional \(\mu\)-calculus
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- Synthesis of Asynchronous Systems
- The complexity of mean payoff games on graphs
Cited in
(45)- Parity game reductions
- Model-checking iterated games
- Latticed-LTL synthesis in the presence of noisy inputs
- 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
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- A superpolynomial lower bound for strategy iteration based on snare memorization
- Solving parity games using an automata-based algorithm
- Parameterized Algorithms for Parity Games
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- CADP 2010: a toolbox for the construction and analysis of distributed processes
- The modal -calculus caught off guard
- Recursive algorithm for parity games requires exponential time
- The mu-calculus and Model Checking
- Graph Games and Reactive Synthesis
- Cooking Your Own Parity Game Preorders Through Matching Plays
- From Parity and Payoff Games to Linear Programming
- Semantic labelling and learning for parity game solving in LTL synthesis
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- Solving parity games in big steps
- Symmetric strategy improvement
- Solving μ-Calculus Parity Games by Symbolic Planning
- Solving parity games in practice
- Alternating traps in Muller and parity games
- Solving parity games by a reduction to SAT
- Deciding the unguarded modal \(\mu\)-calculus
- The complexity of rational synthesis for concurrent games
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Improvement in small progress measures
- A delayed promotion policy for parity games
- Window parity games: an alternative approach toward parity games with time bounds
- Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time
- A recursive approach to solving parity games in quasipolynomial time
- Deciding Parity Games in Quasi-polynomial Time
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- 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
- How much lookahead is needed to win infinite games?
- How Much Lookahead is Needed to Win Infinite Games?
- Deterministic sub-exponential algorithm for discounted-sum games with unary weights
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
This page was built for publication: Solving Parity Games in Big Steps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458856)
