The Stack Place (multi-token infinity) 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. The Stack Place (multi-token infinity) can hold an infinite number of stack tokens. |
When you select the shape, it will show you its available input boxes. The gray description texts show the meaning of those boxes.
To enter text, click a second time (after selecting the shape), now on the desired input box, and finally start typing to overwrite or press F2 to edit an existing text. After you have entered text, the gray descriptions will no longer be visible.
|
(Note: These texts only appear when the FMC Support Tools >= 2.0 add-in is installed. With an older version or no installed add-in there will be colored boxes.)
|
Place
Place (multi-token)
Place (multi-token infinity)
Stack Place
Return Place
Token