Title:

Model-Based Analysis

Code:MBA
Ac.Year:2019/2020
Sem:Summer
Curriculums:
ProgrammeField/
Specialization
YearDuty
IT-MSC-2MBI-Elective
IT-MSC-2MBS-Elective
IT-MSC-2MGM2ndElective
IT-MSC-2MIN2ndCompulsory
IT-MSC-2MIS2ndCompulsory-Elective - group F
IT-MSC-2MMM-Compulsory
IT-MSC-2MPV-Elective
IT-MSC-2MSK-Elective
MITAINADE-Elective
MITAINBIO-Elective
MITAINCPS-Elective
MITAINEMB-Elective
MITAINGRI-Elective
MITAINHPC-Elective
MITAINIDE-Elective
MITAINISD-Elective
MITAINISY-Elective
MITAINMAL-Elective
MITAINMAT-Elective
MITAINNET-Elective
MITAINSEC-Elective
MITAINSEN-Compulsory
MITAINSPE-Elective
MITAINVER-Compulsory
MITAINVIZ-Elective
Language of Instruction:Czech
Credits:5
Completion:examination (written&oral)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:390067
 ExamsTestsExercisesLaboratoriesOther
Points:7000030
Guarantor:Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)
Deputy guarantor:Češka Milan, prof. RNDr., CSc. (DITS)
Lecturer:Češka Milan, RNDr., Ph.D. (DITS)
Rogalewicz Adam, doc. Mgr., Ph.D. (DITS)
Faculty:Faculty of Information Technology BUT
Department:Department of Intelligent Systems FIT BUT
Prerequisites: 
Theoretical Computer Science (TIN), DITS
Schedule:
DayLessonWeekRoomStartEndLect.Gr.Groups
TuelecturelecturesA113 17:0019:501MIT 2MIT MIN MMM xx
 
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.
Description:
  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.
Knowledge and skills required for the course:
  Basic knowledge of graph theory, formal languages concepts and automata theory. Basic knowledge of statistics and probability. Basic knowledge of software engineering.
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.
Syllabus of lectures:
 
  1. Introduction to the topic of model-based design, testing and analysis. The term model-checking.
  2. Petri nets. Basic terms, history and applications.
  3. P/T Petri nets, definition, evolution rules, state space, bacis problems of analysis.
  4. Analysis of P/T Petri nets, coveribility tree, P- and T- invariants.
  5. Extensions of P/T Petri nets and Coloured Petri nets. Decidability and relation to Turing machines. Tools NetLab a PIPE.
  6. Markov chains as a model of probabilistic systems, Markov chains in discrete and continuous time. Temporal logic for specification of behaviour of Markov chains.
  7. Analysis of Markov chains (model checking), the tool PRISM.
  8. Extension of Markov chains by nondeterminism - Markov decision processes. Use of Markov chains in theory of operation. Synthesis of operation for Markov decision processes.
  9. Timed automata and their use in modelling of systems with real-time.
  10. Timed automata analysis, region abstraction, decidable problems. Tool UPPAAL.
  11. Timed temporal logic TCTL and its relation to timed automata.
  12. UML/SysML diagrams and their use in model-based design and analysis.
  13. Model checking of systems described by UML (state) diagrams.
Syllabus of computer exercises:
 If applicable:
  1. Analysis of P/T Petri nets, tools NetLab a PIPE.
  2. Analysis of Markov chains, tool PRISM
  3. Analysis of timed automata, tool UPPAAL.
Syllabus - others, projects and individual work of students:
 
  1. Application of Petri nets.
  2. Application of Markov chains.
  3. Application of timed automata.
Fundamental literature:
 
  • Reisig, W.: Petri Nets, An Introduction, Springer Verlag, 1985. ISBN: 0-387-13723-8
  • Češka, M.: Petriho sítě, Akad.nakl. CERM, Brno, 1994. ISBN: 8-085-86735-4
  • Kaynar, D.,  Lynch, N., Segala, R., Vaandrager, F. :The Theory of Timed I/O Automata, Morgan & Claypool, 2010.  ISBN-13: 978-1608450022
  • Boucherie, R. J.(editor), van Dijk, N. M. (editor): Markov Decision Processes in Practice, Springer,  2017.  ISBN-13: 978-3319477640
Study literature:
 
  • Reisig, W.: Petri Nets, An Introduction, Springer Verlag, 1985. ISBN: 0-387-13723-8
  • Č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 Available online.
  • Boucherie, R. J.(editor), van Dijk, N. M. (editor): Markov Decision Processes in Practice, Springer,  2017.  ISBN-13: 978-3319477640 Available online from VUT network.
Controlled instruction:
  3 projects, 10 points each.
 

Your IPv4 address: 54.198.246.164