Course on Petri Nets, SS 2006 (Module III 1.4)
This course can be used for completing the master module
III.1.4 (SWTuIS). Please note that this course is not available
for students in the BSc program (2. Studienabschnitt)!
Special Note
The lecture on May 24, 2006 starts at 12.00 (due to the Senatssitzung); the tutorial, however, will be held at 2.15pm as planned.
Lecture
Wednesday 11-13, N3.237 (Start: April 5)
Tutorial
Wednesday 14-16, C3.203 (!), bi-weekly (Start: April 12)
Lecturer
Ekkart Kindler
(mailto:kindler@uni-paderborn.de),
Raum E3.167
Contents
Petri nets can be used for modelling, analysing and verifying
reactive and distributed systems. Their strength are their simple
but precise semantics, their clear garphical notation, and many
methods and algorithms for analysis and verification.
The course introduces Petri nets and their theory by the help of
examples from different application domains. The focus, however,
will be on traditional Petri net theory, in particular on
Place/Transition-Systems and on concepts such as place and transition
invariants, deadlocks and traps, and the coverability tree.
The course also covers different versions and variants of Petri nets
as well as different modelling and analyisis techniques for particular
application areas.
Material
The material covering this
course in particular the assigmnents and solutions will be available
at http://www.upb.de/cs/kindler/Lehre/SS06/PN/material.html.
Moreover, there is a German manuscript covering the complete material
of this course: Manuscript "Petrinetze" (in German).
Literature
B. Baumgarten:
Petri-Netze: Grundlagen und Anwendungen.
Spektrum Akademischer Verlag 1996.
K. Schmidt:
Analyse von Petrinetz-Modellen.
Vorlesungsskript (Schwerpunkt: Modelchecking),
HU Berlin, SS 1998, SS 1999.
W. Reisig:
Petri nets: An Introduction.
Springer 1985.
W. Reisig:
Elements of Distributed Algorithms -- Modeling and Analysis with
Petri Nets.
Springer 1998.
P. Starke:
Analyse von Petri-Netz-Modellen.
Teubner 1990.