The Community for Technology Leaders
Green Image
<p>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. To include generally distributed firing times into the model one must specify the way in which the next transition to fire is chosen, and how the model keeps track of its past history; this set of specifications is called an execution policy. A discussion is presented of the impact that different execution policies have on semantics of the mode, as well as the characteristics of the stochastic process associated with each of these policies. When the execution policy is completely specified by the transition with the minimum delay (race policy) and the firing distributions are of the phase type, an algorithm is provided that automatically converts the stochastic process into a continuous time homogeneous Markov chain. An execution policy based on the choice of the next transition to fire independently of the associated delay (preselection policy) is introduced, and its semantics is discussed together with possible implementation strategies.</p>
execution policies; semantics; stochastic Petri nets; atomic transitions; race policy; continuous time homogeneous Markov chain; Markov processes; performance evaluation; Petri nets

G. Balbo, A. Cumani, G. Chiola, G. Conte, M. Ajmone Marsan and A. Bobbio, "The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 832-846, 1989.
83 ms
(Ver 3.3 (11022016))