Discrete Time Stochastic Petri Nets

  • Authors:
  • Michael K. Molloy

  • Affiliations:
  • Univ. of Texas at Austin, Austin

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1985

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.