IA023 Petri Nets

Faculty of Informatics
Spring 2012
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. Petr Novotný, Ph.D. (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.
Supplier department: Department of Computer Science – Faculty of Informatics
Timetable
Thu 10:00–11:50 D2
Prerequisites
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
there are 18 fields of study the course is directly associated with, display
Course objectives
An introduction to Petri nets; the course covers both "classical" results (about boundedness, liveness, reachability, coverability, etc.) and "modern" results (the (un)decidability of equivalence-checking and model-checking, etc.)
At the end of the course, students should be able to: understand the language of Petri nets; model various classes of systems using Petri nets; apply specific analytical techniques developed for Petri nets; prove properties of discrete systems using Petri nets and appropriate specification formalisms.
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.
  • (Un)decidability 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
Teaching methods
Lectures, class discussions.
Assessment methods
Lectures: 2 hours/week.
Written exam.
Language of instruction
Czech
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Autumn 2002, Autumn 2003, Autumn 2004, Spring 2006, Spring 2007, Spring 2008, Spring 2009, Spring 2010, Spring 2011, Spring 2013, Spring 2014, Spring 2015, Spring 2016, Spring 2017, Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023, Spring 2024, Spring 2025.
  • Enrolment Statistics (Spring 2012, recent)
  • Permalink: https://is.muni.cz/course/fi/spring2012/IA023