- There is no lab on December 2!
- There is no lab on November 18!
- The first homework assignement is available at HW1.pdf. The deadline for submission of the model is February 28, 2020.
- The first lab is on October 7.
- There is no lecture on October 2. The first lecture takes place on October 9.
|07. 10. 2019||Spin model checker||lecture02.pdf|
|09. 10. 2019||LTS, Process Algebras||lecture01.pdf|
|16. 10. 2019||Kripke Structures, model checking, LTL||lecture03.pdf|
|23. 10. 2019||LTL Explicit Model Checking||lecture04.pdf|
|30. 10. 2019||CTL, Explicit CTL Model Checking||lecture05.pdf|
|06. 11. 2019||Ordered Binary Decision Diagrams||lecture06.pdf|
|13. 11. 2019||Symbolic CTL Model Checking||lecture07.pdf|
|20. 11. 2019||Partial Order Reduction||lecture08.pdf|
|27. 11. 2019||Timed Automata||lecture09.pdf|
|04. 12. 2019||Infinte-State Model Checking, Bounded Model Checking|
|11. 12. 2019||Abstractions, Symmetries|
|18. 12. 2019||Stochastic Model Checking|
|08. 01. 2020||Assume-guarantee|
|14. 10. 2019||Spin II.||Lab01.zip|
|21. 10. 2019||Spin III + LTS, CCS.||Lab01.pdf, Lab02.pdf|
|04. 11. 2019||Spin IV||Distributed consensus I., Distributed consensus II.|
|11. 11. 2019||CTL + LTL Model Checking||Lab04.pdf|
|25. 11. 2019||OBDD Exercises||Lab06.pdf|
Basic concepts of behavior description of parallel and distributed systems. Equivalence checking and model checking — techniques and tools.
- 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
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: firstname.lastname@example.org
Note: 10% of your score will be deduced for every calendar day your assignment is late. This implies that no assignment will be accepted after 10 calendar days past its due date.
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
- 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