This chapter will be based mainly on Chapters 4 and 5 in Peterson. Another source is the web referece at Dortmund.We will discuss the following topics:
- Analysis problems for Petri Nets (Peterson)
- Safeness
- Boundedness
- Conservation
- Liveness
- Reachability and coverability
- Firing sequences
- Equivalence and subset problems
- Analysis techniques
- The reachability tree (Peterson)
- Some tricks in deriving the reachablity tree [Törn 1998]
- Matrix equations (Peterson)
- Invariants (Dortmund),(Törn)
- Reduction and synthesis (Dortmund)
- Analysis of State Machines, Marked Graphs, Extended Free Choice Nets (Dortmund)
- Concurrent runs (Reisig)
- Complexity and decidability (Peterson)