The Theory of Universal Graphs for Infinite Duration Games

We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals: showing an equivalence and normalisation result between differ...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Logical methods in computer science Jg. 18, Issue 3; H. 3
Hauptverfasser:	Colcombet, Thomas, Fijalkow, Nathanaël, Gawrychowski, Paweł, Ohlmann, Pierre
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Logical Methods in Computer Science Association 07.09.2022 Logical Methods in Computer Science e.V
Schlagworte:	Computer Science computer science - computer science and game theory computer science - formal languages and automata theory
ISSN:	1860-5974, 1860-5974
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!