Quantitative Verification and Timed AutomataModulbeschreibung #40664 / Version 1
- 3 LP
- Portfolioprüfung
- Benotet
- Winter- und Sommersemester
- Englisch
Diese Modulbeschreibung gilt nicht im aktuellen Semester (WiSe 2026/27).
| Modul / Version | #40664 / #1 |
|---|---|
| Gültigkeit | SS 2014 – SS 2015 |
| Verfügbare Sprache(n) | Englisch |
| Leistungspunkte | 3 |
| Modulverantwortliche*r | Kreutzer, Stephan |
| Benotung | Benotet |
| Prüfungsform | Portfolioprüfung |
| Lehrsprache(n) | Englisch |
Zugehörigkeit
| Fakultät | Fakultät IV |
|---|---|
| Institut | Institut für Softwaretechnik und Theoretische Informatik |
| Fachgebiet | 34352200 FG Logik und Semantik (LaS) |
Kontakt
| Sekretariat | EN 25 |
|---|---|
| Ansprechpartner*in | Kreutzer, Stephan |
| E-Mail-Adresse | stephan.kreutzer@tu-berlin.de |
| Webseite | https://www.tu.berlin/las/studium-lehre/veranstaltungsangebot |
Lernergebnisse
Successful participants are familiar with the principles of verification under time-constraints, in particular the automata theoretical and logical foundations. They are able to read research papers, present the content in written form and in an oral presentation.
The course is principally designed to impart:
Technical skills 40x method skills 40x system skills 0x social skills 20x
The course is principally designed to impart:
Technical skills 40x method skills 40x system skills 0x social skills 20x
Lehrinhalte
Model-checking has become a widely used and successful method for verifying reactive systems - such as hardware systems, controllers or communication protocols - and is increasingly used in the verification of software systems as well. Many current model-checkers focus on deciding whether a process meets a certain requirement such as responsiveness, fairness and similar properties which can either be true or false.
However, for many applications it is not only enough to verify that certain error states cannot be reached, but timing constraints become equally important. A typical example is the verification of electronic brake systems: it is not enough to certify that every time the driver uses the break pedal of his car, the car will eventually engage the breaks. Instead we usually want to verify that the break is engaged within a certain time span after the pedal has been pressed.
In this reading course we will study the fundamental methods developed for such verification tasks. More specifically, we will study automata models incorporating time constraints and associated timed logics. We will study the various models of time that can be used and the effects this has on complexity and applicability of quantitative model-checking.
However, for many applications it is not only enough to verify that certain error states cannot be reached, but timing constraints become equally important. A typical example is the verification of electronic brake systems: it is not enough to certify that every time the driver uses the break pedal of his car, the car will eventually engage the breaks. Instead we usually want to verify that the break is engaged within a certain time span after the pedal has been pressed.
In this reading course we will study the fundamental methods developed for such verification tasks. More specifically, we will study automata models incorporating time constraints and associated timed logics. We will study the various models of time that can be used and the effects this has on complexity and applicability of quantitative model-checking.
Modulbestandteile
Pflichtbereich
Die folgenden Veranstaltungen sind für das Modul obligatorisch:
| Lehrveranstaltungen | Art | Nummer | Turnus | Sprache | SWS | VVZ |
|---|---|---|---|---|---|---|
| Quantitative Verification and Timed Automata | Seminar | 0432 L675 | Winter- und Sommersemester | – | 2 | ISIS |
Arbeitsaufwand und Leistungspunkte
Quantitative Verification and Timed Automata (Seminar)
| Aufwandbeschreibung | Multiplikator | Stunden | Gesamt |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
Der Aufwand des Moduls summiert sich zu 90 Stunden. Damit umfasst das Modul 3 Leistungspunkte.
Beschreibung der Lehr- und Lernformen
Students participating in the reading course are assigned a research paper each. They study the paper and its context. They present the contents of the paper in a talk given to all participants of the course and in addition prepare their own paper.
Depending on students’ preferences the module can be given in English or German. The research papers given to students will be in English.
Depending on students’ preferences the module can be given in English or German. The research papers given to students will be in English.
Voraussetzungen für die Teilnahme / Prüfung
Wünschenswerte Voraussetzungen für die Teilnahme an den Lehrveranstaltungen:
Interest in theoretical computer science. Knowledge of foundations of logic and automata as covered by the modules TheGI2 and TheGI3, for instance, are expected.
Verpflichtende Voraussetzungen für die Modulprüfungsanmeldung:
Dieses Modul hat keine Prüfungsvoraussetzungen.
Abschluss des Moduls
| Benotung | Benotet |
|---|---|
| Prüfungsform | Portfolioprüfung |
| Sprache | Englisch |
Prüfungselemente
| Name | Punkte/Gewicht | Kategorie | Dauer/Umfang |
|---|---|---|---|
| Paper | 50 | ||
| Talk | 50 |
Dauer des Moduls
Für Belegung und Abschluss des Moduls ist folgende Semesteranzahl veranschlagt: 1 Semester.
Dieses Modul kann in folgenden Semestern begonnen werden: Winter- und Sommersemester.
Maximale teilnehmende Personen
Die maximale Teilnehmerzahl beträgt 14.
Anmeldeformalitäten
To enlist for this course, see http://www.las.tu-berlin.de.
Literaturhinweise, Skripte
Skript in Papierform
nicht verfügbar
Skript in elektronischer Form
verfügbar
Empfohlene Literatur
- The papers studied in the course will be announced at the beginning of the module.
Zugeordnete Studiengänge
Dieses Modul findet in keinem Studiengang Verwendung.
Sonstiges
Keine Angabe