|Course||References||Lecture Notes||Problem Sets||Exams|
Automata, Games, and Verification
|Teaching Assistant:||Markus N. Rabe, Hazem Torfah, Felix Klein|
|Lecture Room:||HS 001, building E1.3|
|Lecture Time:||Tuesday 2pm-4pm|
|Tutorial Time:||Thursday 2pm-4pm, Room 010 building E1.7|
End of semester exam results are online. The exam inspection is on Thursday, Apr 11th from 2pm to 3pm in room 508.
- Please send an email till April 1st to torfah at cs.uni-saarland.de if you want to participate in the end of semester exam on April 4th.
- End term results are online. The exam inspection is on Thursday, Feb 21st from 2pm to 3pm in room 528.
- The exam next week starts at 13:15. The duration of the exam is approximately 2 hours. Please be there on time!
- !!! Check out the new group chart!!!
- Group 1, 6, 11 and 15 don’t forget the discussion session tomorrow. We are located in the 5th floor building E1.3
- Due to the Holiday on Nov. 1st the Tutorial next week will be held on Wednesday at 12pm in U12 E1.1
- The next lecture will be held on Thursday 25th of October at 2pm in HS001 E1.3.
The first lecture will be held on Tuesday 23rd of October.
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.
- Automata over infinite words and trees (omega-automata)
- Infinite two-player games
- Logical systems for the specification of nonterminating behavior
- Transformation of automata according to logical operations
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
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.)
|Bakhadyr Khoussainov, Anil Nerode
Automata Theory and its Applications
1st edition (February 15, 2001),
Vertiefungsvorlesung (6 CP)