FI:IA040 Logics for Processes - Course Information
IA040 Modal and Temporal Logics for Processes
Faculty of InformaticsAutumn 2017
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- prof. RNDr. Luboš Brim, CSc. (lecturer)
- Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Luboš Brim, CSc.
Supplier department: Department of Computer Science – Faculty of Informatics - Timetable
- Tue 12:00–13:50 B411
- Prerequisites
- Recommended: IV010 Communication and Parallelism
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- there are 28 fields of study the course is directly associated with, display
- Course objectives
- The aim is to acquire basic knowledge and develop skills in the use of modal and temporal logics for specification, analysis and verification of computer systems.
By the end of the semester, students should be able:
to understand definitions of the logics and logical systems presented in the course, the ideas of the proofs;
to understand the differences in the logics, and their capabilities and limitations;
to understand the utility, potential and limitations of formal verification, in particular model checking, for linear-time and branching-time logics. - Learning outcomes
- By the end of the semester, students should be able: • to understand and apply definitions of the logics and logical systems presented in the course, the ideas of the proofs; • to understand the differences in the logics, and their capabilities and limitations; • to understand the utility, potential and limitations of formal verification, in particular model checking, for linear-time and branching-time logics.
- Syllabus
- Modal logics: propositional modal logic, modal mu-calculus.
- Temporal logics: propositional temporal logic, linear and branching time, temporal operators.
- Classification of properties, liveness, safety, local and global properties.
- Model checking, applications.
- Literature
- GRUMBERG, Orna, Doron A. PELED and E. M. CLARKE. Model checking. Cambridge: MIT Press, 1999, xiv, 314. ISBN 0262032708. info
- MANNA, Zohar and A. PNUELI. Temporal verification of reactive systems : safety. New York: Springer, 1995, xviii, 512. ISBN 0387944591. info
- Handbook of logic in computer science. Edited by Samson Abramsky - Dov M. Gabbay - Thomas S. E. Maibaum. Oxford: The Clarendon Press, 1992, 571 s. ISBN 0198537611. info
- Teaching methods
- seminar, homeworks, reading
- Assessment methods
- Final exam is both written and oral. In the case homeworks are assigned, these are counted by maximum of 30% to the final mark. No study materials are allowed during the final examination.
- Language of instruction
- Czech
- Further Comments
- Study Materials
The course is taught annually. - Teacher's information
- http://www.fi.muni.cz/usr/brim/ia040.html
- Enrolment Statistics (Autumn 2017, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2017/IA040