Justifications and a reconstruction of parity game solving algorithms

DOI10.1007/978-3-031-31476-6_9zbMath1529.68160arXiv2102.01440OpenAlexW3134943325MaRDI QIDQ6175109

Ruben Lapauw, Maurice Bruynooghe, Marc Denecker

Publication date: 17 August 2023

Published in: Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.01440

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus
• Improving parity game solvers with justifications
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• A delayed promotion policy for parity games
• Automata, logics, and infinite games. A guide to current research
• Practical synthesis of reactive systems from LTL specifications via parity games
• An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
• FO(FD): Extending classical logic with rule-based fixpoint definitions
• Monadic second order logic on tree-like structures
• Solving Parity Games via Priority Promotion
• Deciding parity games in quasipolynomial time
• An Overview of the mCRL2 Toolset and Its Recent Advances
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Attracting tangles to solve parity games

This page was built for publication: Justifications and a reconstruction of parity game solving algorithms