Subclasses of Petri nets: MGs

• Marked Graph: every place has at most 1 predecessor and 1 successor

• Models only causality and concurrency (no choice)

• Same as underlying graph of SDF

• Studied by Commoner et al. (‘71)

Previous slide

Next slide

Back to first slide

View graphic version