Starting from 22 April, the lectures on tuesdays will take place at 9.45AM in the seminar room of i2 (2nd floor of E1).
- Instead of having a written exam at the end of the course, we will organize oral examinations.
|Lecture||Mon||12:15 – 13:45||AH 1||14 April||Katoen|
|Tue||9:45 – 11:15||Seminar Room I2||15April||Katoen|
|Exercise||Wed||13:30 – 15:00||Seminar Room I2||23 April||Dehnert / Sher|
Motivation and background
This course is concerned with model checking, an automated technique to verify properties of hardware and software systems. Whereas the focus of the course Model Checking is on the elementary techniques of model checking, this course is focused on two main topics: advancing current model-checking technology, and, on the other hand, model-checking techniques for quantitative system aspects.
In the second part of the course, models and algorithms are treated for the verification of timed properties, such as “is it possible that the system will crash within 30 seconds”, and properties that involve random phenomena (e.g., “the probability to reach a bad state within 44 minutes is below 0.0001”). Models such as timed automata, their infinite-state semantics, and finite abstractions thereof will be treated. This is complemented by a treatment of algorithms for checking timed CTL. This results in an effective framework that is used for checking real-time properties of embedded systems, communication protocols, and so on.
Probabilistic models are the key to model random phenomena as they occur in distributed algorithms that use randomisation to break the symmetry between processes, or to reason about quality of service parameters such as dependability, performance, and survivability. This course will deal with the basic algorithms and logics for verifying properties of fully probabilistic models such as Markov chains, and (if time permits) models that also exhibit nondeterminism (Markov decision processes).
- Summary of LTL and CTL model checking
- Equivalences and abstraction
- Partial-order reduction techniques
- Binary decision diagrams
- Timed automata
- Model checking timed CTL
- Exercises can be worked on in groups of at most two students.
- To achieve a certificate to this course or to be admitted to the final exam, at least half of the exercises has to be reasonably dealt.
- The exercise sheets will be issued weekly.
|2||15.4.14||CTL* and Bisimulation||l2||e1||s1|
|6||12.5.14||Stutter Bisimulation Quotienting||l6|
|8||19.5.14||Simulation and Universal CTL*||l8|
|10||27.5.14||Ample Set Conditions||l10||e7||s7|
Partial-Order Reduction (1)
|12||3.6.14||Partial-Order Reduction (2)||l12||e8||s8|
Reduced Ordered Binary Decision Diagrams
Symbolic Model Checking with ROBDDs
Verifying Timed Reachability Properties
Zone-based Reachability Analysis
Difference Bound Matrices
- Exam: Monday August 25 and Friday September 26
- The lecture will be given in English. All course material (i.e., lecture notes and slides) will be in English.
- The students will be awarded 6 ECTS credits for the lecture after passing the final exam.
The course is based on the book: Principles of Model Checking by Christel Baier and Joost-Pieter Katoen. The errata document will change during the semester. It is possible to buy a book (about 40 euros), but there is no need to do so as there are various copies of the book available at the CS library.
Additional literature can be found in:
- J. Rutten, M. Kwiatkowska, G. Norman and D. Parker: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, Volume 23 of CRM Monograph Series. American Mathematical Society, P. Panangaden and F. van Breugel (eds.), March 2004.
- M. Huth and M.D. Ryan: Logic in Computer Science — Modelling and Reasoning about Systems, Cambridge University Press, 2nd edition, 2004
- K. Schneider: Verification of Reactive Systems, Springer-Verlag, Texts in Theoretical Computer Science. An EATCS Series, 2004
- E.M. Clarke, O. Grumberg, D.A. Peled: Model Checking, MIT Press, 1999
- K.L. McMillan: Symbolic Model Checking, Kluwer Academic, 1993