Abstract: Concurrent Generalized Petri Nets (CGPNs) are a sub-class of Markov Regenerative Stochastic Petri Nets characterized by timed transitions, with general distributed firing times (GEN transitions), that become enabled simultaneously while no other GEN transitions can be activated during their enabling periods. In their original definition, CGPNs are identified through the study of their state space, hence they are recognized only after the construction of their tangible reachability graphs. In this paper we present sufficient conditions representing a first step in the definition of an alternative method for the characterization of this type of models. The method is based on the structural analysis of the net, it does not require the generation of its tangible reachability graph, and is thus computationally convenient. Moreover, an advantage of this method is that it can be applied also in case of models characterized by large state spaces, hence prone to be analyzed via simulation using regenerative techniques. The criteria that we propose represent the basis for a preliminary analysis of the model in order to verify its membership to the class of CGPNs whose numerical solution always requires the construction of its tangible reachability graph and the characterization of the underlying Markov regenerative process.
Concurrent Generalized Petri Nets: Regenerative Conditions
BERNARDI, Simona;BALBO, Gianfranco
2001-01-01
Abstract
Abstract: Concurrent Generalized Petri Nets (CGPNs) are a sub-class of Markov Regenerative Stochastic Petri Nets characterized by timed transitions, with general distributed firing times (GEN transitions), that become enabled simultaneously while no other GEN transitions can be activated during their enabling periods. In their original definition, CGPNs are identified through the study of their state space, hence they are recognized only after the construction of their tangible reachability graphs. In this paper we present sufficient conditions representing a first step in the definition of an alternative method for the characterization of this type of models. The method is based on the structural analysis of the net, it does not require the generation of its tangible reachability graph, and is thus computationally convenient. Moreover, an advantage of this method is that it can be applied also in case of models characterized by large state spaces, hence prone to be analyzed via simulation using regenerative techniques. The criteria that we propose represent the basis for a preliminary analysis of the model in order to verify its membership to the class of CGPNs whose numerical solution always requires the construction of its tangible reachability graph and the characterization of the underlying Markov regenerative process.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.