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

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 18, Issue 3; no. 3
Main Authors:	Colcombet, Thomas, Fijalkow, Nathanaël, Gawrychowski, Paweł, Ohlmann, Pierre
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 07.09.2022 Logical Methods in Computer Science e.V
Subjects:	Computer Science computer science - computer science and game theory computer science - formal languages and automata theory
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!