I023 Petri Nets

Faculty of Informatics
Autumn 2001
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 14:00–15:50 B411
Prerequisites (in Czech)
I006 Automata II && I010 Communication and Parallelism
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
Syllabus
  • Petri nets are a basis for a wide class of tools for modelling, design, simulation and analysis of complex distributed (concurrent, parallel) systems. They have many applications in the area of computer hardware, communication protocols, flexible manufacturing systems, software engineering etc.
  • Principles of system modelling by means of nets.
  • Relations of structural and dynamic properties.
  • Analysis techniques.
  • Questions of algorithmic decidability and complexity.
  • Modular construction.
  • Nonsequential semantics for Petri nets.
  • Relation to other models from the theory of processes.
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.
The course is also listed under the following terms Spring 1996, Spring 1997, Autumn 2000.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2001/I023