PN: Special Cases
- Finite-State Machines: special cases of PN (subclasses) where each transition has exactly one input and one output.
State machines represent decisions, but not
synchronization of parallel activities.
- Marked Graphs: special cases of PN where each place has exactly one input and one output.
Marked graphs represent concurrency,
but not decision (conflict).