This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Discrete Time Stochastic Petri Nets
April 1985 (vol. 11 no. 4)
pp. 417-423
M.K. Molloy, Department of Computer Science, University of Texas at Austin
Basic graph models of processes, such as Petri nets, have usually omitted the concept of time as a parameter. Time has been added to the Petri net model in two ways. The timed Petri net (TPN) uses a fixed number of discrete time intervals. The stochastic Petri net (SPN) uses an exponentially distributed random variable. In this paper, a discrete time stochastic Petri model is described. These discrete time SPN's fill the gap between TPN and normal SPN. However, the use of discrete time complicates the SPN model in that more than one transition may fire at a time step. Finally, an example of a live and bounded Petri net which has nonempty, disjoint, recurrent subsets of markings is given.
Index Terms:
stochastic models, Markovian processes, performance, Petri nets
Citation:
M.K. Molloy, "Discrete Time Stochastic Petri Nets," IEEE Transactions on Software Engineering, vol. 11, no. 4, pp. 417-423, April 1985, doi:10.1109/TSE.1985.232230
Usage of this product signifies your acceptance of the Terms of Use.