Stud.IP Uni Oldenburg
University of Oldenburg
07.07.2022 06:13:53
inf404 - Petri Nets (Complete module description)
Inf404 - Petri Nets (Complete module description)
Original version English Download as PDF
Module label Petri Nets
Module code inf404
Credit points 6.0 KP
Workload 180 h
Institute directory Department of Computing Science
Applicability of the module
  • Bachelor's Programme Computing Science (Bachelor) > Akzentsetzungsbereich - Wahlbereich Informatik
  • Dual-Subject Bachelor's Programme Computing Science (Bachelor) > Wahlpflicht Theoretische Informatik (30 KP)
  • Master of Education Programme (Gymnasium) Computing Science (Master of Education) > Wahlpflichtmodule (Theoretische Informatik)
Responsible persons
Lehrenden, Die im Modul (Authorized examiners)
Lehrenden, Die im Modul (Module responsibility)
Prerequisites
Skills to be acquired in this module
The behaviour of modern, highly parallel, digital systems may be extremely complex. Graphical and algorithmic support may be very valuable in facilitating their design, construction, and analysis. Petri nets are a basic, widely used graphical model for the specification of parallel systems. They also provide and support a range of flexible algorithmic methods for the analysis of such systems. This module teaches the basic theory and applications of Petri nets, for the purpose of specifying and visualising, as well as for constructing and analysing highly parallel systems.

Professional competence
The students:
  • define basic concepts of Petri nets
  • classify Petri nets according to their salient poperties
  • analyse and synthesise Petri nets
  • apply Petri nets in the context of well-defined problems


Methodological competence
The students:
  • can apply specification and analysis methods based on Petri nets


Social competence
The students:
  • present solutions to given problems to a wider audience
Module contents
  • Basic concepts of Petri net theory.
  • Petri net languages.
  • Reachability and coverability.
  • Marking equation.
  • Linear-algebraic and graph-theoretic structure of Petri nets.
  • Free-choice nets.
  • Program verification using traps.
  • Computing functions with nets.
  • Unfoldings.
  • High-level nets.
Reader's advisory
  • Best/Wimmel: Skript Petrinetze (Oldenburg, 2015).
  • Secondary literature: Priese/Wimmel: Petri Netze (Springer-Verlag, 2001).
Links
Languages of instruction German, English
Duration (semesters) 1 Semester
Module frequency jährlich
Module capacity unlimited
Modullevel / module level AS (Akzentsetzung / Accentuation)
Modulart / typ of module je nach Studiengang Pflicht oder Wahlpflicht
Lehr-/Lernform / Teaching/Learning method V+Ü
Vorkenntnisse / Previous knowledge
Course type Comment SWS Frequency Workload of compulsory attendance
Lecture
2 WiSe 28
Exercises
2 WiSe 28
Total time of attendance for the module 56 h
Examination Time of examination Type of examination
Final exam of module
At the end of the lecture period
Written or oral exam