Discrete Time Stochastic Petri Nets
- 1 April 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-11 (4) , 417-423
- https://doi.org/10.1109/tse.1985.232230
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
This publication has 12 references indexed in Scilit:
- A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1983
- Performance Analysis Using Stochastic Petri NetsIEEE Transactions on Computers, 1982
- Special Feature: Putting Petri Nets to WorkComputer, 1979
- Specification and Validation of ProtocolsIEEE Transactions on Communications, 1979
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- Petri NetsACM Computing Surveys, 1977
- Recoverability of Communication Protocols--Implications of a Theoretical StudyIEEE Transactions on Communications, 1976
- Formal verification of parallel programsCommunications of the ACM, 1976
- A Comparison of Some Theoretical Models of Parallel ComputationIEEE Transactions on Computers, 1973
- A Petri Net model of the CDC 6400Published by Association for Computing Machinery (ACM) ,1971