FI:IA023 Petri Nets - Course Information

IA023 Petri Nets

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)

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

Thu 10:00–11:50 D3

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

• Applied Informatics (programme FI, N-AP)
• Information Technology Security (programme FI, N-IN)
• Bioinformatics (programme FI, N-AP)
• Information Systems (programme FI, N-IN)
• Informatics (programme FI, M-IN)
• Informatics (programme FI, N-IN)
• Parallel and Distributed Systems (programme FI, N-IN)
• Computer Graphics (programme FI, N-IN)
• Computer Networks and Communication (programme FI, N-IN)
• Computer Systems (programme FI, N-IN)
• Embedded Systems (eng.) (programme FI, N-IN)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (eng.) (programme FI, N-AP)
• Service Science, Management and Engineering (programme FI, N-AP)
• Theoretical Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-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) (2)
• Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
• Image Processing (programme FI, N-AP)

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.

• Enrolment Statistics (Spring 2011, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2011/IA023