Small progress measures for solving parity games
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Model checking for hybrid logic
- Looking at mean payoff through foggy windows
- Parity game reductions
- Solving parity games via priority promotion
- A delayed promotion policy for parity games
- Multi-buffer simulations: decidability and complexity
- Memoryless determinacy of parity and mean payoff games: a simple proof
- Entanglement and the complexity of directed graphs
- Model checking games for the quantitative \(\mu \)-calculus
- Improving parity games in practice
- Quasipolynomial computation of nested fixpoints
- Bounded game-theoretic semantics for modal mu-calculus
- Robust worst cases for parity games algorithms
- Qualitative analysis of concurrent mean-payoff games
- On the universal and existential fragments of the \(\mu\)-calculus
- Dicing on the Streett
- Matching in security-by-contract for mobile code
- Fixpoint logics over hierarchical structures
- A superpolynomial lower bound for strategy iteration based on snare memorization
- Concurrent reachability games
- Bridging the gap between fair simulation and trace inclusion
- On modal -calculus with explicit interpolants
- The alternation hierarchy in fixpoint logic with chop is strict too
- A constructive algorithm for max-min paths problems on energy networks
- When not losing is better than winning: abstraction and refinement for the full \(\mu\)-calculus
- Games for verification: Algorithmic issues
- Lattice-theoretic progress measures and coalgebraic model checking
- Solving parity games using an automata-based algorithm
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Parameterized Algorithms for Parity Games
- Synthesising strategy improvement and recursive algorithms for solving 2.5 player parity games
- Two variable vs. linear temporal logic in model checking and games
- Recursive algorithm for parity games requires exponential time
- scientific article; zbMATH DE number 1810492 (Why is no real title available?)
- Automata theory and model checking
- 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
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- scientific article; zbMATH DE number 7445162 (Why is no real title available?)
- A comparison of BDD-based parity game solvers
- Solving parity games in big steps
- Symmetric strategy improvement
- A CSP-Based Approach for Solving Parity Game
- Computing Game Values for Crash Games
- Value Iteration
- The Descriptive Complexity of Parity Games
- Inf-datalog, Modal Logic and Complexities
- Games on Multi-stack Pushdown Systems
- Solving μ-Calculus Parity Games by Symbolic Planning
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Games on Higher Order Multi-stack Pushdown Systems
- Solving parity games in practice
- Alternating traps in Muller and parity games
- Optimal bounds in parametric LTL games
- A survey of stochastic -regular games
- Solving parity games by a reduction to SAT
- Synthesis of Reactive(1) designs
- Down the Borel hierarchy: solving Muller games via safety games
- The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
- Permissive strategies: from parity games to safety games
- Parametrized automata simulation and application to service composition
- Model Checking Games
- Polynomial-time under-approximation of winning regions in parity games
- Switching graphs
- The fixpoint-iteration algorithm for parity games
- Improvement in small progress measures
- Disjunctive form and the modal alternation hierarchy
- Partial solvers for parity games: effective polynomial-time composition
- A delayed promotion policy for parity games
- Window parity games: an alternative approach toward parity games with time bounds
- Resource-aware automata and games for optimal synthesis
- 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?)
- The Theory of Universal Graphs for Infinite Duration Games
- Deciding Parity Games in Quasi-polynomial Time
- scientific article; zbMATH DE number 7533361 (Why is no real title available?)
- scientific article; zbMATH DE number 7559481 (Why is no real title available?)
- Büchi Good-for-Games Automata Are Efficiently Recognizable
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- Controlling a population
- Register games
- Succinct progress measures for solving parity games
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- Solving mean-payoff games via quasi dominions
- Quasipolynomial set-based symbolic algorithms for parity games
- scientific article; zbMATH DE number 7089067 (Why is no real title available?)
- Parity games with weights
- Quantitative fair simulation games
- Faster algorithms for mean-payoff games
- A Multi-Core Solver for Parity Games
- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
- Three notes on the complexity of model checking fixpoint logic with chop
- Solving Parity Games in Big Steps
- Undirected Graphs of Entanglement 2
- An \(O(n^2)\) time algorithm for alternating Büchi games
- Combinations of Qualitative Winning for Stochastic Parity Games
This page was built for publication: Small progress measures for solving parity games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501540)
