Improving parity game solvers with justifications
From MaRDI portal
Publication:784159
DOI10.1007/978-3-030-39322-9_21OpenAlexW2998857771MaRDI QIDQ784159FDOQ784159
Authors: Ruben Lapauw, Maurice Bruynooghe, Marc Denecker
Publication date: 5 August 2020
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/646997
Recommendations
- Justifications and a reconstruction of parity game solving algorithms
- Solving parity games in practice
- Improving parity games in practice
- Succinct progress measures for solving parity games
- Solving parity games by a reduction to SAT
- A comparison of BDD-based parity game solvers
- scientific article; zbMATH DE number 1773090
- Solving parity games: explicit vs symbolic
- scientific article; zbMATH DE number 1670778
- Partial solvers for generalized parity games
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)
Cited In (6)
- Improving parity games in practice
- Embedding justification theory in approximation fixpoint theory
- Priority promotion with Parysian flair
- Tree-like justification systems are consistent
- Justifications and a reconstruction of parity game solving algorithms
- Exploiting Game Theory for Analysing Justifications
Uses Software
This page was built for publication: Improving parity game solvers with justifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q784159)