» Diese Veranstaltung wird auf englisch gehalten.
|V3||Tue 11:45-13:15, AH VI
Thu 11:45-12:30, AH III
|Ü2||Thu 10:00-11:30, AH I||14.4.2011||Löding, Spelten|
The games considered in this course are two player games of infinite duration played on graphs. A play in such a game is an infinte 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 visted or visited infinitely often during the play. Games of this type are used in the theory of verification and synthesis of non-terminating systems.
Expected KnowledgeKnowledge from the standard theory courses and from the course Infinite Computations is expected.