Work

Efficient implementation of simulation of prioritized transitions for high-level Petri nets

Year: 2013
Type: report
Abstract: . Transition priorities can be a useful mechanism when mod-eling using Petri nets. For example, exception handling can be modeled using high-priority transitions and background tasks can be modeled using low-priority transitions. Although transition priorities can be sim-ulated in Petri nets using, e. g., inhibitor arcs, such constructs tend to unnecessarily clutter models. Hence, it is useful to support priorities di-rectly. The main problem with transition priorities is that they introduce a nonlocal enabling condition. At first sight, this forces us to compute enabling for all transitions in a highest-priority-first order. However, this should be avoided whenever possible as computing whether transitions in high-level Petri nets are enabled is an expensive operation. This pa-per shows that we can minimize the number of enabling computations, and hence can do better. Experiments show that using the algorithms presented in this paper we can execute approximately 10 times as many transitions a second as is possible for simpler algorithms. This holds for both toy examples and real-life models, though the gain is often larger for real-life models. 1
Language: English
Open Access status: green
OpenAlex ID: W827625440
Cites: 12
Cited by: 3
Related to: 9