460-4006/02 – Petri Nets I (PES I)

Gurantor departmentDepartment of Computer ScienceCredits4
Subject guarantordoc. Ing. Zdeněk Sawa, Ph.D.Subject version guarantorMgr. Pavla Dráždilová, Ph.D.
Study levelundergraduate or graduateRequirementChoice-compulsory
Year1Semesterwinter
Study languageEnglish
Year of introduction2015/2016Year of cancellation
Intended for the facultiesFEIIntended for study typesFollow-up Master
Instruction secured by
LoginNameTuitorTeacher giving lectures
SNE10 Mgr. Pavla Dráždilová, Ph.D.
SUR096 Ing. Martin Šurkovský
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2
Combined Credit and Examination 10+0

Subject aims expressed by acquired skills and competences

To understand the basic concepts and methods of system modelling using Petri nets. To accept the Petri nets as a an extra suited tool for systems modelling, design, and verification. To gaine practical experiences with some software tools that support handling with Petri nets. Acquaintance with fundamentals of modeling, designing, and analysing with Petri net models. Understanding the main theoretical methods for Petri nets analysis and mastering their using in practice. Gaining practical experience with program tools supporting Petri nets design and analysis.

Teaching methods

Lectures
Tutorials

Summary

Petri nets are one of the most adequate and sound languages for description and analysis of discrete dynamic systems with concurrent processes, distributed states and hierarchical structure. The course covers the fundamentals of the theory and practical use of classical "low-level" Petri nets, i.e. Place/Transition nets and their extensions.

Compulsory literature:

Markl, J.: Petriho sítě I. Lecture notes in Czech language, VŠB-TU Ostrava, http://drazdilova.cs.vsb.cz/Data/Sites/5/petrinet/petrinetsylabus.pdf Reisig, Wolfgang: Understanding Petri Nets. 2013.

Recommended literature:

R.David, H.Alla: Petri Nets and Grafcet /Tools for modelling discrete event systems/. Prentice Hall Ltd., 1992. W.Resig-G.Rozenberg (Eds.): Lectures on Petri Nets I: Basic Models, LNCS 149, Springer, 1998. W.Resig-G.Rozenberg (Eds.): Lectures on Petri Nets II: Applications, LNCS 1492, Springer, 1998. M.A.Marsan, G.Balbo, G.Conte, S.Donatelli, G.Franceschinis: Modelling with Generalised Stochastic Petri Nets. John Wiley & Sons, 1995. L.Priese, H.Wimmel: Theoretische Informatik Petri-Netze, Springer-Verlag Berlin Heidelberg 2003.

Way of continuous check of knowledge in the course of semester

Conditions for credit: There will be two exams: a midterm and a final examination. The weights given to these items in determining final grade are: - Midterm exam 25%, - Homeworks 15%, - Final exam 60%.

E-learning

Další požadavky na studenta

Additional requirements are not placed on the student.

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Lectures: Problems of modelling, analysing and designing complex systems with distributed states, parallel actions and hierarchical structure. Petri nets as a convenient tool to cope with these problems. Informal introduction to modelling with low-level Petri nets. Condition/Event (C/E) Petri nets. Place/Transition (P/T) Petri nets. Petri nets with inhibitors. Informal introduction to modelling with high-level Petri nets. Coloured Petri nets. Object-oriented Petri nets. Hierarchical Petri nets. PN structures, PN systems and parametrized PN systems. Structure and dynamics of P/T Petri nets. States (markings), enabling and firing rule, set of all reachable states. Reachability graph. Enabling degree of transition. Relations defined on the transition set: conflict, concurrency, causal connection, exclusivity, confusion. Basic properties of P/T Petri nets: boundness, safeness, liveness, reversibility, deadlock-freeness, conservativity. Reachability and coverability problem. Petri nets state analysis. Structure analysis of Petri nets. Graph and algebraic methods. Traps and siphons. Change matrix and fundamental equation. P-invariants, T-invariants and corresponding components. Dual Petri nets and their invariants. Using invariants for Petri nets analysis. Subclasses of Petri nets according their structure: state-machine PN, synchronization PN, free-choice PN and their properties. Hierarchical structure of Petri nets. Modular design of Petri nets that are safe, live and reversible. Formal languages specified by Petri nets and their relation to Chomsky hierarchy of languages. Some extensions of classical P/T Petri nets: Petri nets with priorities. Timed Petri nets. Transition timed Petri nets with atomic firing. Exercises: The content of exercises is determined by the content of lectures. The main goals are: Confirm understanding of theoretical knowledge by means of simple Petri nets designing and analysing. Master the basic set of methods for state-space and algebraic analysis and design PN models. Gain some experience with program systems supporting design, simulation and formal analysis of Petri net models.

Conditions for subject completion

Full-time form (validity from: 2015/2016 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Credit and Examination Credit and Examination 100 (100) 51
        Credit Credit 40  21
        Examination Examination 60  30
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2019/2020 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology P English Ostrava 1 Choice-compulsory study plan
2019/2020 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology K English Ostrava 1 Choice-compulsory study plan
2018/2019 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology P English Ostrava 1 Choice-compulsory study plan
2018/2019 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology K English Ostrava 1 Choice-compulsory study plan
2017/2018 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology P English Ostrava 1 Choice-compulsory study plan
2017/2018 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology K English Ostrava 1 Choice-compulsory study plan
2016/2017 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology P English Ostrava 1 Choice-compulsory study plan
2016/2017 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology K English Ostrava 1 Choice-compulsory study plan
2015/2016 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology P English Ostrava 1 Choice-compulsory study plan
2015/2016 (N2647) Information and Communication Technology (2612T025) Computer Science and Technology K English Ostrava 1 Choice-compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner