16-17 May 2019 • Sofia, Bulgaria

Submission: 1 February 2019 • Notification: 1 March 2019 • Final Version: 1 April 2019

# Transition

A GN transition with m inputs and n outputs

Transition in the context of generalized nets is an object from the static structure of the net, which comprises the conditions of tokens' transfer from the transition's input places to its output places.

When tokens enter the input place of a transition, it becomes potentially fireable and at the moment of their transfer towards the transition's output places, the transition is being fired.

The tokens' transfer through a transition is described by a special formal algorithm.

## Formal description

Formally, every transition is described by a 7-tuple:

${\displaystyle Z=\langle L',L'',t_{1},t_{2},r,M,\Box \rangle }$

where:

• ${\displaystyle L',L''}$ are finite, non-empty sets of places: the transition's input and output places, respectively.
• ${\displaystyle t_{1}}$ is the current time-moment of the transition's firing.
• ${\displaystyle t_{2}}$ is the current value of the duration of its active state.
• ${\displaystyle r}$ is the transition's condition, determining which tokens will transfer from the transition's inputs to its outputs. The parameter has the form of an index matrix:
${\displaystyle r={\begin{array}{c|c c c c c}&l''_{1}&...&l''_{j}&...&l''_{n}\\\hline l'_{1}&&&&&\\...&&&&&\\l'_{i}&&&r_{i,j}&&\\...&&&&&\\l'_{m}&&&&&\\\end{array}}}$
where ${\displaystyle r_{i,j}}$ are predicates, ${\displaystyle 1\leq i\leq m,1\leq j\leq n}$
• ${\displaystyle M}$ is the index matrix of the capacities of the transition's arcs:
${\displaystyle M={\begin{array}{c|c c c c c}&l''_{1}&...&l''_{j}&...&l''_{n}\\\hline l'_{1}&&&&&\\...&&&&&\\l'_{i}&&&M_{i,j}&&\\...&&&&&\\l'_{m}&&&&&\\\end{array}}}$
where ${\displaystyle M_{i,j}\geq 0}$ are natural numbers or ${\displaystyle \infty }$, ${\displaystyle 1\leq i\leq m,1\leq j\leq n}$
• ${\displaystyle \Box }$ is called transition's type, an object having a form similar to a Boolean expression. It may contain as variables the symbols that serve as labels for transition's input places, and it is an expression constructed of variables and the Boolean connectives ${\displaystyle \land }$ and ${\displaystyle \lor }$ determining the following conditions:
${\displaystyle \land (l_{i_{1}},l_{i_{2}},...,l_{i_{u}})}$ - each of the places ${\displaystyle l_{i_{1}},l_{i_{2}},...,l_{i_{u}}}$ must contain at least one token,
${\displaystyle \lor (l_{i_{1}},l_{i_{2}},...,l_{i_{u}})}$ - there must be at least one token in the set of places ${\displaystyle l_{i_{1}},l_{i_{2}},...,l_{i_{u}}}$ where ${\displaystyle \lbrace l_{i_{1}},l_{i_{2}},...,l_{i_{u}}\rbrace \subset L'}$
When the value of a type (calculated as a Boolean expression) is "true", the transition can become active, otherwise it cannot.