PN: Change of States (2)

• A transition is firable or enabled when there are sufficient tokens in its input places.

• After firing, tokens will be transferred from the input places (old state) to the output places, denoting the new state.

• Note that the examples are Petri nets representation of a finite state machine (FSM). PNs are much more powerful to model systems beyond FSMs.

Previous slide

Next slide

Back to first slide

View graphic version