Semester: winter 2024/25
Lectures: Thursday, 14:00, S3 (Jan Kofroň)
Labs: Monday, 10:40, S7 (Jan Kofroň)
Page in SIS: NSWI101
Grading: Credit and exam
Lectures: Thursday, 14:00, S3 (Jan Kofroň)
Labs: Monday, 10:40, S7 (Jan Kofroň)
Page in SIS: NSWI101
Grading: Credit and exam
Previous year: 2023/24
News
- The first homework assignment is available in slides from lab4. The submission deadline is February 24, 2025.
- There is NO lab on September 30, 2024! The first lab takes place on October 7.
Lectures
| Date | Title | Downloads |
|---|---|---|
| 03. 10. 2024 | Introduction, LTS, Process Algebras | Slides |
| 10. 10. 2024 | Model Checking | Slides |
| 17. 10. 2024 | Spin | Slides |
| 24. 10. 2024 | CTL | Slides |
| 31. 10. 2024 | OBDD, Lattices, Fixpoints | Slides |
| 07. 11. 2024 | Symbolic CTL Model Checking | Slides |
| 14. 11. 2024 | Timed Automata | Slides |
Labs
| Date | Title | Downloads |
|---|---|---|
| 07. 10. 2024 | LTS, Process algebra | Slides |
| 14. 10. 2024 | LTL | Slides |
| 21. 10. 2024 | Spin | Slides, Examples |
| 04. 11. 2024 | More Spin | Slides, Examples |
| 11. 11. 2024 | CTL and OBDD Exercises | Slides |
Annotation
Basic concepts of behavior description of parallel and distributed systems. Equivalence checking and model checking – techniques and tools.
Syllabus
- Practical examples of behavior modeling and verification
- The SPIN model checker (developed at Bell Labs) which is being successfully used from 1989 for analysis of communication and cryptographic protocols, distributed algorithms and parts of OS kernels (e.g., process schedulers)
- The NuXMV (SMV) – Symbolic model checker based on Ordered Binary Decision Diagrams
- UPPAAL model checker
- Mathematical structures for behavior modeling: labeled transition systems, Kripke structures
- Timed automata
- Specification of system properties using temporal logic
- Basic verification tasks: equivalence checking and model checking
- Decidability and complexity (of equivalence checking and model checking) in dependence of the type of the model
- Software tools for equivalence checking and model checking
- Bounded model checking, probabilistic model checking
- Open issues in formal verification: infinite-state systems, state explosion problem
Lab
The purpose of the lab is to provide students with a hand-on experience with verification tools (SPIN, SMV, UPPAAL), higher-level behavior specification languages (process algebra, behavior protocols), and temporal logics (LTL, CTL).
There will be two assignments (one taking approximately 8 hours of homework, the other an hour). The homeworks are to be submitted via e-mail: nswi101@d3s.mff.cuni.cz
Grading
Final grades will be determined by the quality of homework and the result of the final exam in the following ratio:
- 55% Assignments (homework)
- 45% Final exam
References
- P. Regan, S. Hamilton: NASA’s Mission Reliable, IEEE Computer, vol. 37, no. 1, Jan 2004
- G. J. Holzmann: The Spin Model Checker, Addison Wesley, 2003
- E. M. Clarke, Jr., O. Grumberg, D. A. Peled: Model Checking, MIT Press, 2002
- J. A. Bergstra, A. Ponse, S. A. Smolka: Handbook of Process Algebra, Elsevier 2001
- R. Milner: Communication and Concurrency, Prentice Hall 1989
- C. Stirling: Modal and Temporal Properties of Processes, Springer 2001