Improving parity games in practice

Parity games are infinite-round two-player games played on directed graphs whose nodes are labeled with priorities. The winner of a play is determined by the smallest priority (even or odd) that is encountered infinitely often along the play. In the last two decades, several algorithms for solving p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of mathematics and artificial intelligence Jg. 89; H. 5-6; S. 551 - 574
Hauptverfasser: Di Stasio, Antonio, Murano, Aniello, Prignano, Vincenzo, Sorrentino, Loredana
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.06.2021
Springer
Springer Nature B.V
Schlagworte:
Algorithms
Artificial Intelligence
Complex Systems
Computer Science
Data structures
Games
Graph theory
Graphs
Mathematics
Parity
Programming languages
68Q60
PGSolver
Zielonka Recursive algorithm
Formal verification
ISSN:1012-2443, 1573-7470
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Parity games are infinite-round two-player games played on directed graphs whose nodes are labeled with priorities. The winner of a play is determined by the smallest priority (even or odd) that is encountered infinitely often along the play. In the last two decades, several algorithms for solving parity games have been proposed and implemented in PGSolver, a platform written in OCaml. PGSolver includes the Zielonka’s recursive algorithm (RE, for short) which is known to be the best performing one over random games. Notably, several attempts have been carried out with the aim of improving the performance of RE in PGSolver, but with small advances in practice. In this work, we deeply revisit the implementation of RE by dealing with the use of specific data structures and programming languages such as Scala , Java , C++ , and Go . Our empirical evaluation shows that these choices are successful, gaining up to three orders of magnitude in running time over the classic version of the algorithm implemented in PGSolver.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1012-2443
1573-7470
DOI:10.1007/s10472-020-09721-3