Seminar: Real-time Systems & Synthesis
|Instructors:||Bernd Finkbeiner, Peter Faymonville and Michael Gerke|
Seminar (7 CP)
Real-time systems are an interesting class of infinite state systems. We will study timed automata, a popular formalism for the succinct representation of timed systems, featuring a decidable reachability problem. Efficient algorithms and clever data structures support the analysis of systems of larger size. Synthesizing timed controllers for plant models guarantees their correctness. We will investigate classic synthesis problems for (non-terminating) reactive systems, which have the goal to synthesize finite-state automata from temporal logic specifications. In contrast, we will also study program synthesis, which deals with terminating systems.
- The deadline for the summaries of the related Papers and Background Papers is on December 20th at 23:59. Please send your summaries to your advisor by that time.
- Kickoff meeting on October 24th, 2pm in room 528, E1.3
- Download our organization slides
- Preparatory meetings during lecture period
- Kolloquium (1-2 days) after exams in February
- Wolfgang Thomas. Solution of Church’s Problem: A Tutorial
- Rajeev Alur and David L. Dill. A Theory of Timed Automata
Registration for the seminar will start after the general welcome meeting of the department (“Einführungsveranstaltung”) on October 15th. We will have around 10-12 spots in the seminar.
Please send an e-mail to apply explaining your motivation (approx. 5 lines plus your fields of study) to firstname.lastname@example.org until (and including) Wednesday, October 17th. You will be notified about your acceptance on Friday, October 19th.
The seminar kick-off meeting will take place on Wednesday, October 24th, 2pm in room 528.