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...

Celý popis

Podrobná bibliografie

Vydáno v:	Annals of mathematics and artificial intelligence Ročník 89; číslo 5-6; s. 551 - 574
Hlavní autoři:	Di Stasio, Antonio, Murano, Aniello, Prignano, Vincenzo, Sorrentino, Loredana
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Cham Springer International Publishing 01.06.2021 Springer Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!