Giovanni Chiola

TL;DR: In this paper, a class of Petri nets in which transitions can fire after either a deterministic or a random, exponentially distributed, firing delay is defined, and a solution technique is presented to obtain the steady-state probability distribution over markings, introducing restrictions on the use of deterministic firing delays.

TL;DR: It turns out that SWN's allow the representation of any color function in a structured form, so that any unconstrained high-level net can be transformed into a well-formed net.

TL;DR: The class of Petri nets obtained by eliminating timing from generalized stochastic Petri net (GSPN) models while preserving the qualitative behavior is identified and it is shown that for a (wide) class of nets, the definition of firing probabilities of conflicting immediate transitions does not require the information on reachable markings.

TL;DR: Petri nets in which random delays are associated with atomic transitions are defined in a comprehensive framework that contains most of the models already proposed in the literature and includes an execution policy based on the choice of the next transition to fire independently of the associated delay.

TL;DR: The new class of Well Formed Coloured Nets (WN) is formally defined as an extension of Regular Nets, together with an extended Symbolic Reachability Graph (SRG) construction algorithm, which allows the representation of any colour function in a structured form, so that they have the same modelling power as general coloured nets (CPN).