The Stack Place is used to model recursion in Petri Nets.
It holds stack tokens, which are hold in a single, central stack in their order of placement, although they might have been placed on different stack places. A Stack Place is always an input place for a transition that additionally has a return place as input place. If there is a conflict involving a return place the stack token on top of the (placement) stack is released and the associated transition is fired. This normal Stack Place can hold only one stack token. |
Place
Place (multi-token)
Place (multi-token infinity)
Stack Place (multi-token infinity)
Return Place
Token