• DocumentCode
    1237769
  • Title

    Discrete Time Stochastic Petri Nets

  • Author

    Molloy, Michael K.

  • Author_Institution
    Department of Computer Science, University of Texas at Austin
  • Issue
    4
  • fYear
    1985
  • fDate
    4/1/1985 12:00:00 AM
  • Firstpage
    417
  • Lastpage
    423
  • 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.
  • Keywords
    Markovian processes; Petri nets; performance; stochastic models; Delay; Fires; Performance analysis; Petri nets; Power system modeling; Protocols; Random variables; Stochastic processes; System recovery; Timing; Markovian processes; Petri nets; performance; stochastic models;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/TSE.1985.232230
  • Filename
    1702023