Infinite Games: Fundamental Results and Some Perspectives

Wolfgang Thomas
RWTH Aachen
Friday, 17 January, 2003 (All day)

The purpose of this lecture is to survey the essentials of the algorithmic theory of infinite games, its role in program synthesis and verification, and some challenges of current research. More specifically, the following topics will be addressed: Finite-state games, the topological classification of winning conditions, game reductions, positional versus finite-state strategies, games over finitely presented infinite transition graphs.

Photograph of the seminar:

Picture of W. Thomas
Click to enlarge !