Solving μ-Calculus Parity Games by Symbolic Planning
From MaRDI portal
Publication:3614877
Recommendations
- scientific article; zbMATH DE number 7455738
- Solving parity games: explicit vs symbolic
- A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
- Symbolic computational techniques for solving games
- Logics in Artificial Intelligence
- Symbolic strategy synthesis for games on pushdown graphs
- Parity games and automata for game logic
- Symbolic verification and strategy synthesis for turn-based stochastic games
Cites work
- A deterministic subexponential algorithm for solving parity games
- A discrete strategy improvement algorithm for solving parity games. (Extended abstract)
- A discrete subexponential algorithm for parity games
- A linear-time model-checking algorithm for the alternation-free modal mu- calculus
- A Multi-Core Solver for Parity Games
- An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Fast and simple nested fixpoints
- scientific article; zbMATH DE number 3688686 (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
- On the synthesis of strategies in infinite games
- Small progress measures for solving parity games
- Solving Parity Games in Big Steps
- STACS 2004
- Symbolic computational techniques for solving games
- Symbolic synthesis of finite-state controllers for request-response specifications
- Tools and Algorithms for the Construction and Analysis of Systems
- Verifying safety properties of a PowerPC\(^{TM}\) microprocessor using symbolic model checking without BDDs
Cited in
(4)
This page was built for publication: Solving μ-Calculus Parity Games by Symbolic Planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614877)