Infinite Computations

Name

Phone

Email

Content

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

Büchi automata and regular omega-languages

Deterministic automata on infinite words

Classification of sequence properties like safety, recurrence, etc.

Part II: Applications

Decidability results on logical systems

An automata based theoretic approach to model-checking

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.