1. Introduction, elementary and general Petri nets, equivalent models, decision problems
  2. Elementary nets: concurrency, dependence and conflict; confusions; regions - reconstruction from a finite automaton
  3. Mazurkiewicz traces, dependence graphs, regular trace languages, asynchronous automata, labeled elementary nets
  4. Coverability trees, universal lower bound for general nets
  5. The reachability problem - decidability
  6. Approximate analysis: state equation, invariants, continuous reachability
  7. Confusion-less subclasses of Petri nets: P-nets, T-nets, free-choice nets
  8. The reachability problem - lower bound
  9. Process algebra CCS - syntax and semantics, examples
  10. Bisimulation equivalence
  11. Observational equivalence
  12. Bisimulation game, coinduction
  13. Bisimulation and logic
  14. Undecidability of bisimulation equivalence