Simple fixpoint iteration to solve parity games
From MaRDI portal
Recommendations
Cites work
- A comparison of BDD-based parity game solvers
- Attracting tangles to solve parity games
- Certification for -calculus with winning strategies
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- scientific article; zbMATH DE number 1775458 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Monadic second order logic on tree-like structures
- On model checking for the -calculus and its fragments
- Results on the propositional \(\mu\)-calculus
- Solving parity games in practice
- Solving parity games using an automata-based algorithm
- Solving parity games via priority promotion
- Strix
- Succinct progress measures for solving parity games
- The fixpoint-iteration algorithm for parity games
- The mu-calculus and Model Checking
Cited in
(3)
This page was built for publication: Simple fixpoint iteration to solve parity games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020529)