About  |  Study  |  Members  |  Projects  |  Publications  |  Events  |  Search  |  Internals  |  Contact & Imprint

Courses in Summer Term 2006  -  Design and Analysis with Petri Nets

Course title:  Design and Analysis with Petri Nets

Lecturer:   Dr. Nauber

Module:  SV

Status:  advanced unit

SWS (lecture/tutorial/practical):  2/0/1

Credit points:  4

Examination method:  oral examination

Prerequisites:

• knowledge in Set and Graph Theory

Course description:

Petri Nets are objects of a theory for modelling, simulation und analysis of concurrent systems based on graph theory. With Petri Nets one cananalyze programs and protocols, describe transactions in business, control of manufactoring systems, operating systems and the interaction with data banks. All these systems have the property that in certain situations various activities can occur concurrently. In the lecture we consider important net classes and give algorithms for the analysis of such properties like liveness, boundedness, invariants and the existence of deadlocks or livelocks. Practicals in a computer lab help students to model Petri Nets with a graphical editor and to use software for analysing nets.

References:

• T. Murata Petri-Nets: Properties, Analysis and Applications. Proc. of the IEEE 77(4) 1989
• W. Reisig. Petrinetze. Springer 1986
• P. Starke. Analyse von Petri-Netz-Modellen. Teubner 1990
• K. Jensen. Coloured Petri Nets Vol. I-III. Springer ETACS 1992-96
• W. Reisig, G. Rozenberg (Eds) Lectures on Petri Nets I: Basic Models and Lectures on Petri Nets II: Applications. Springer LNCS 1491/1492 (1998)
• W. Reisig. Elements of Distributed Algorithms. Springer 1998

Additional information:

• the course web page