Reachability games and parity games
From MaRDI portal
Publication:6109467
DOI10.1007/978-3-031-17715-6_3arXiv2208.10121OpenAlexW4312459633MaRDI QIDQ6109467
Manfred Kufleitner, Volker Diekert
Publication date: 28 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.10121
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Borel determinacy
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- Automata, logics, and infinite games. A guide to current research
- Recursive algorithm for parity games requires exponential time
- Solving Parity Games in Practice
- Deciding parity games in quasipolynomial time
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- A modal μ perspective on solving parity games in quasi-polynomial time
- Decidability of Second-Order Theories and Automata on Infinite Trees
This page was built for publication: Reachability games and parity games
