1. Introduction, elementary and general Petri nets, equivalent models, decision problems
  2. Elementary nets: concurrency, dependence and conflict; regions - reconstruction from a finite automaton
  3. Mazurkiewicz traces - partially commutative languages, regular languages of traces
  4. Asynchronous automata recognize regular trace languages
  5. Algorithmic analysis of Petri nets: coverability tree, universal lower bound
  6. Decidability of the reachability problem
  7. Approximate analysis: invariants, continuous reachability
  8. Subclasses of Petri nets: free-choice nets
  9. Distributed computing in Petri nets: population protocols

Previous editions: