FI:IA023 Petri Nets - Course Information
IA023 Petri Nets
Faculty of InformaticsSpring 2006
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).
- Teacher(s)
- prof. RNDr. Antonín Kučera, Ph.D. (lecturer)
doc. RNDr. Tomáš Brázdil, Ph.D. (alternate examiner)
doc. Mgr. Jan Obdržálek, PhD. (alternate examiner) - Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Antonín Kučera, Ph.D. - Timetable
- Wed 14:00–15:50 B204
- Prerequisites
- ! I023 Petri Nets
Students should be familiar with basic notions of computability, complexity, and automata theory. - 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
- Applied Informatics (programme FI, N-AP)
- Informatics (programme FI, M-IN)
- Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
- Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS)
- Course objectives
- An introduction to Petri nets; it covers the classical results (about boundedness, liveness, reachability, etc.) as well as the `modern' ones (undecidability of equivalence-checking and model-checking, etc.)
- Syllabus
- The theory of Petri nets provides a formal basis for modelling, design, simulation and analysis of complex distributed (concurrent, parallel) systems, which found its way to many applications in the area of computer software, communication protocols, flexible manufacturing systems, software engineering, etc.
- Principles of modelling with Petri nets.
- Classical results for place/transition nets. Boundedness, coverability, Karp-Miler tree, weak Petri computer; reachability and liveness.
- Undecidability of equivalence-checking and model-checking with place/transition nets.
- S-systems, T-systems. Reachability, liveness, S-invariants, T-invariants.
- Free-choice Petri nets. Liveness, Commoner's theorem.
- Literature
- REISIG, Wolfgang. Elements of distributed algorithms : modeling and analysis with Petri Nets. Berlin: Springer, 1998, xi, 302. ISBN 3540627529. info
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
- Enrolment Statistics (Spring 2006, recent)
- Permalink: https://is.muni.cz/course/fi/spring2006/IA023