Quantitative Verification and Timed AutomataModule description #40664 / Version 1
- 3 CP
- Portfolio examination
- Graded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40664 / #1 |
|---|---|
| Validity | SS 2014 – SS 2015 |
| Available language(s) | English |
| Credit points | 3 |
| Person responsible for the module | Kreutzer, Stephan |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34352200 FG Logik und Semantik (LaS) |
Contact
| Office | EN 25 |
|---|---|
| Contact person | Kreutzer, Stephan |
| E-mail address | stephan.kreutzer@tu-berlin.de |
| Website | https://www.tu.berlin/las/studium-lehre/veranstaltungsangebot |
Learning outcomes
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
Content
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.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Quantitative Verification and Timed Automata | Seminar | 0432 L675 | Winter and summer semester | – | 2 | ISIS |
Workload and credit points
Quantitative Verification and Timed Automata (Seminar)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 h |
| 90 h | |||
The workload of the module adds up to 90 hours. The module therefore comprises 3 credit points.
Description of teaching and learning methods
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.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Interest in theoretical computer science. Knowledge of foundations of logic and automata as covered by the modules TheGI2 and TheGI3, for instance, are expected.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| Paper | 50 | ||
| Talk | 50 |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter and summer semester.
Maximum number of participants
The maximum capacity of participants is 14.
Registration procedures
To enlist for this course, see http://www.las.tu-berlin.de.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available
Recommended literature
- The papers studied in the course will be announced at the beginning of the module.
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified