Infinite Computations
» This course is given in English.
Lecture in Winter Term 2009/2010
| Type | Time/Place | Start | Lecturer |
|---|---|---|---|
| V3 | Tue 10:00–11:30, AH VI Wed 09:00–09:45, AH I |
12 October 2010 | Löding |
| Ü2 | Fri 14:00–15:30, AH II | 22 October 2010 | Löding, Neider |
The first lecture will take place on Tuesday, 12 October 2010, 10:00–11:30, AH VI.
Contents
This course corresponds to the first half (and a little more) of the standard course "Automata and Reactive Systems" offered in previous years for diploma students. The second part of "Automata and Reactive Systems" (on tree automata and infinite games) will follow in the summer semester 2010.
The course is addressed to MSc students and diploma students. In a slightly reduced format, titled "Introduction to Infinite Computations", BSc students can take part in the course; in this case, the problems class will involve simpler exercises.
The aim of this course is to introduce automata over infinite words and to treat several of their applications in computer science. This theory is both beautiful and a powerful basis of program verification (for non-terminating programs such as control systems).
Structure of the course- Part I: Automata on infinite words
-
1. Büchi automata and regular omega-languages
2. Deterministic automata on infinite words
3. Classification of sequence properties (safety, recurrence, etc.)
- Part II: Applications
-
4. Decidability results on logical systems
5. Automata theoretic approach to model-checking
6. Algorithmic results on linear constraints for real numbers
- Part III: Outlook
Previous Knowledge
Knowledge of automata theory as presented in basic courses is required for participation.