Course details

Model-Based Analysis

MBA Acad. year 2023/2024 Summer semester 5 credits

Introduction of model-base design, testing, analysis and model checking. Petri nets as a model of parallel systems. Techniques for analysis of Petri nets. Markov chains as a model of probabilistic systems. Techniques for analysis of Markov chains. Timed automata as a model of systems working with real-time. Techniques for analysis of timed automata. UML and SysML diagrams within model-based design and techniques for their analysis. Introduction to the tools for analysis of the presented models.


Course coordinator

Language of instruction



Examination (written+oral)

Time span

  • 26 hrs lectures
  • 10 hrs pc labs
  • 16 hrs projects

Assessment points

  • 60 pts final exam (written part)
  • 40 pts projects




Course Web Pages

Learning objectives

Introduce students to the possibility of software (resp. hardware) quality assurance by creating its model, check correctness on the level of the model, and subsequently translate (sometimes automatelly) the model into the target programming language. These principles are introduced on four models, in particular: Petri nets, Markov chains, timed automata and UML/SysML diagrams.

Why is the course taught

The classical approach to software development is to implement it in a chosen programming language and then test it (eventually verify it). In the quality assurance of embedded and safety-critical systems is often used a different approach. First, one creates a model of the system (or its part) in a suitable modelling language and then verify its quality on the level of the model. After that one translate (often automatically) the model into the target programming language. Verification on the level of a model is often much easier then verification of equal properties directly on the level of a source code.

Recommended prerequisites

Prerequisite knowledge and skills

Basic knowledge of graph theory, formal languages concepts and automata theory. Basic knowledge of statistics and probability. Basic knowledge of software engineering.

Study literature

  • Češka, M.: Petriho sítě, Akad.nakl. CERM, Brno, 1994. ISBN: 8-085-86735-4
  • Jensen, K.: Coloured Petri Nets, Basic Concepts, Analysis Methods and Practical Use, Springer Verlag, 1993. ISBN: 3-540-60943-1
  • Kaynar, D.,  Lynch, N., Segala, R., Vaandrager, F. :The Theory of Timed I/O Automata, Morgan & Claypool, 2010.  ISBN-13: 978-1608450022 Dostupné online.

Fundamental literature

  • Christel Baier and Joost-Pieter Katoen: Principles of Model Checking, MIT Press, 2008. ISBN: 978-0-262-02649-9
  • Reisig, W.: Petri Nets, An Introduction, Springer Verlag, 1985. ISBN: 0-387-13723-8
  • Boucherie, R. J.(editor), van Dijk, N. M. (editor): Markov Decision Processes in Practice, Springer, 2017. ISBN-13: 978-3319477640 Dostupné online ze sítě VUT.

Syllabus of lectures

  1. Introduction to the topic of model-based design, testing and analysis. The term model-checking.
  2. P/T Petri nets, definition, evolution rules, state space, bacis problems of analysis, P- and T- invariants.
  3. Analysis of P/T Petri nets, coveribility tree, backward analysis.
  4. Languages and Extensions of P/T Petri nets, Coloured Petri nets. Decidability and relation to Turing machines.
  5. Markov chains as a model of probabilistic systems, Markov chains in discrete and continuous time. Temporal logic for specification of behaviour of Markov chains.
  6. Analysis of Markov chains (model checking).
  7. Extension of Markov chains by nondeterminism - Markov decision processes. Use of Markov chains in theory of operation. Synthesis of operation for Markov decision processes.
  8. Timed automata and their use in modelling of systems with real-time, region abstraction.
  9. Timed temporal logic TCTL and its relation to timed automata.
  10. Decidable problems for Timed automata, simulation and bi-simulation.
  11. UML/SysML diagrams and their use in model-based design and analysis.
  12. Model checking of systems described by UML (state) diagrams.
  13. Mathlab-Simulink, principles of modelling.

Syllabus of computer exercises

  1. P/T Petri net analysis, Netlab tool (K)
  2. Computation with Marcov chains (N)
  3. Modeling in  PRISM tool (P)
  4. Analysis of timed automata, UPPAAL tool (K)
  5. Modelování v Mathlab-simulink (P)

(P – computer lecture, N – numeric computation, K - combined lecture)

Syllabus - others, projects and individual work of students

  1. Application of Petri nets.
  2. Application of Markov chains.
  3. Application of timed automata.
  4. Model in Mathlab-Simulink

Progress assessment

4 projects (10 points each), final exam (60 points).

Students have to achieve at least 25 points, otherwise the exam is assessed by 0 points.


Mon comp.lab 5., 8. of lectures N203 16:0017:5020 1MIT 2MIT xx Rogalewicz
Mon comp.lab 2024-04-08 N203 16:0017:5020 1MIT 2MIT xx Andriushchenko
Mon comp.lab 2024-04-15 N203 16:0017:5020 1MIT 2MIT xx Macák
Mon comp.lab 2024-04-29 N203 16:0017:5020 1MIT 2MIT xx Fiedor
Tue exam 2024-05-14 E104 09:0011:50 1. termín
Tue lecture 1., 2., 4., 5., 6., 7. of lectures D0206 10:0011:50154 1MIT 2MIT NIDE NMAT NSEN NVER xx Rogalewicz
Tue lecture 8., 9., 10. of lectures D0206 10:0011:50154 1MIT 2MIT NIDE NMAT NSEN NVER xx Češka
Tue lecture 11., 12., 13. of lectures D0206 10:0011:50154 1MIT 2MIT NIDE NMAT NSEN NVER xx Fiedor
Tue lecture 2024-02-20 D0206 10:0011:50154 1MIT 2MIT NIDE NMAT NSEN NVER xx Holík
Tue exam 2024-06-04 E105 11:0013:50 3. termín
Fri exam 2024-05-24 E105 09:0011:50 2. termín

Course inclusion in study plans

Back to top