An Ordered Approach to Solving Parity Games in Quasi-Polynomial Time and Quasi-Linear Space
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12159
- Type
- D - Journal article
- DOI
-
10.1007/s10009-019-00509-3
- Title of journal
- International Journal on Software Tools for Technology Transfer
- Article number
- 3
- First page
- 325
- Volume
- 21
- Issue
- 3
- ISSN
- 1433-2779
- Open access status
- Compliant
- Month of publication
- February
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
5
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper was presented at SPIN'17. It presents the first implemented parity solver that runs in quasi-polynomial time, and one of two independently developed quasi-polynomial time parity solvers that also runs in quasi-linear space. It is the only approach that has sufficiently strong order properties for inclusion in, for example, Chatterjee et al.'s fully symbolic quasi-polynomial time algorithms (LPAR'18). It is implemented and evaluated in “Oink: an Implementation and Evaluation of Modern Parity Game Solvers” (TACAS'18), where it is found that the algorithm "outperforms the other solvers for random games."
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -