Course References Lecture Notes Problem Sets

Automata, Games, and Verification

Lecturer: Bernd Finkbeiner
Teaching Assistant: Rüdiger Ehlers, Andrey Kupriyanov
Lecture Room: Seminarraum 0.01, building E 2 1 (bioinformatics)
Lecture Time: Tuesday 10am-12pm
Tutorial A Room: Seminarraum 0.01, building E 2 1 (bioinformatics)
Tutorial B Room: Seminarraum U12, building E 1 1
Tutorial Time: Thursday 10am-12pm



The theory of automata over infinite objects provides a succinct, expressive and formal framework for reasoning about reactive systems, such as communication protocols and control systems. Reactive systems are characterized by their nonterminating behaviour and persistent interaction with their environment.

In this course we will study the main ingredients of this elegant theory, and its application to automatic verification (model checking) and program synthesis.



The course will be based on the following two textbooks, supplemented as necessary by various research papers.

Erich Grädel, Wolfgang Thomas, Thomas Wilke (Eds.)
Automata, Logics, and Infinite Games: A Guide to Current Research
Springer, Berlin;
Lecture Notes in Computer Science 2500
2nd Print (1. November 2005)
Online Version (Online access is free of charge if you connect from a department IP. If you encounter problems, let us know.)
ISBN-10: 0387292373
Bakhadyr Khoussainov, Anil Nerode
Automata Theory and its Applications
Birkhauser Boston;
1st edition (February 15, 2001),
ISBN: 0817642072

Vertiefungsvorlesung (6 CP)
Sommersemester 2011