Systems Theory
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
MIE-TES.16 | Z,ZK | 5 | 2P+1C | English |
- Garant předmětu:
- Lecturer:
- Tutor:
- Supervisor:
- Department of Digital Design
- Synopsis:
-
Today, humankind has the ability to develop systems of incredible complexity (e.g., trains, microprocessors, airplanes, nuclear power plants). However, the costs of managing this complexity and of ensuring the correct behavior of a given system have become critical. A key technique for mastering this complexity is the usage of models that describe only those aspects of the systems that are important for the task at hand, and automated tools for analyzing those models. This subject will present theory and algorithms that form the basis for the modeling and analysis of complex systems.
- Requirements:
- Syllabus of lectures:
-
1. Automata-based models
2. Temporal logic
3. Testing and bounded model checking
4. Bounded model checking and Boolean satisfiability
5. Unbounded model checking
6. Data structures for unbounded model checking
7. Petri nets
8. Timed automata
9. Modeling the physical environment
10. Simulation
11. Probabilistic models
- Syllabus of tutorials:
-
Practical training of the lecture material.
- Study Objective:
-
The student will have the ability to use and apply some of the most important formalisms for modeling complex systems. He/she will also be familiar with techniques for the automatic analysis of such models.
- Study materials:
-
Edward A. Lee and Sanjit A. Seshia, Introduction to Embedded Systems, A Cyber-Physical Systems Approach, http://LeeSeshia.org, ISBN 978-0-557-70857-4, 2011.
Edmund M. Clarke, Orna Grumberg, and Doron A. Peled. Model Checking. MIT Press, 1999.
- Note:
- Further information:
- https://moodle-vyuka.cvut.cz/course/view.php?id=2213
- No time-table has been prepared for this course
- The course is a part of the following study plans: