Algorithm for generalized net functioning

Below we will describe the most general algorithm for the generalized net functioning.

For this purpose, we will introduce the concept of Abstract Transition (AT). This is a GN tranition represented as the union of all active GN-transitions at a given time-moment. For its construction the operation "union" of transitions is used (see Operations and relations over generalized nets).

This algorithm helps us to realize the different subprocesses (which exist in the frames of the most global modelled process) on the level of places, while analogous processes in other nets are modelled on the level of transitions. Moreover, the places are sorted by their priorities while in other nets this is not the case. Therefore, the sequence of the process realization by generalized nets is performed on the level of places (from different active transitions). Furthermore, when some places have equal priority, the tokens' transfer is related to the tokens' priorities, which is difficult to achieve in other nets.

This algorithm was described in the "Generalized Nets" from 1991 year and "On Generalized Nets Theory" from 2007 year.