Lecture in Summer Term 2015
The games considered in this course are two player games of infinite duration played on graphs. A play in such a game is an infinite path through the graph that is built up by the two players moving a token along the edges of the graph. Which player wins such an infinite play is specified by a winning condition, usually in terms of the vertices of the graph that have been visited or visited infinitely often during the play. Games of this type are used in the theory of verification and synthesis of non-terminating systems.
We need some results from the course "Infinite Computations". At least basic knowledge from this course is expected.
Lecture will be held in english.