Weekly Notes for Week 25

This week we continue with Petri nets. Building on the basic definitions, reachability graphs, liveness, boundedness, and reversibility from last week, we will focus on coverability, invariants, and Farkas’ algorithm. If time allows, we will also discuss complexity questions and applications of Petri nets in chemistry and systems biology.

• Slides and reading:

  • Petri-net slides
  • Petri-net invariants and Farkas’ algorithm
  • Murata, Petri Nets: Properties, Analysis and Applications
  • Esparza, Decidability and Complexity of Petri Net Problems

• Exercises:

  • Continue with Exercise Sheet 06: Petri Nets
  • Additional modelling sheet: Exercise Sheet 07: Petri Nets – Modelling and Model Checking
  • LoLA command-line material: README and example files