Petri Nets and their Analyses

Teacher

Attendees

Prerequisites

No prerequisites

Contents

In this tutorial, I will cover the basics of Petri nets, as well as some classical methods and tools to analyse them. A preliminary list of the topics includes:

  • Definition of PN, and mathematical prerequisites
  • Usefulness in modeling and analysis of distributed system
  • Relevant problems: marking reachability, coverability, boundedness, semi-liveness...
  • p-semiflows
  • Coverability set and the Karp and Miller tree
  • Fixed-point algorithms to decide coverability
  • Some extensions

Link to the pdf of the slides

Duration

From 13h30 to 16h00 on 19 Dec 2007, local OF202

tut/petrinets.txt · Last modified: 2008/05/30 13:57 by ahu