Abstract

In the context of discrete event simulation, the marking of a stochastic Petri net (SPN) corresponds to the state of the underlying stochastic process of the simulation and the firing of a transition corresponds to the occurrence of an event. A study is made of the modeling power of SPNs with timed and immediate transitions, showing that such Petri nets provide a general framework for simulation. The principle result is that for any (finite or) countable state GSMP (generalized semi-Markov process) there exists an SPN having a marking process that mimics the GSMP in the sense that the two processes (and their underlying general state-space Markov chains) have the same finite dimensional distributions.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Petri netEvent (particle physics)Stochastic Petri netComputer scienceMarkov chainState spaceContext (archaeology)Stochastic processTheoretical computer scienceMarkov processRepresentation (politics)State (computer science)Discrete mathematicsCountable setDiscrete event simulationAlgorithmMathematicsSimulationStatisticsMachine learning

Affiliated Institutions

Related Publications

Publication Info

Year
1989
Type
article
Volume
15
Issue
4
Pages
381-393
Citations
55
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

55
OpenAlex

Cite This

Peter J. Haas, Gerald S. Shedler (1989). Stochastic Petri net representation of discrete event simulations. IEEE Transactions on Software Engineering , 15 (4) , 381-393. https://doi.org/10.1109/32.16599

Identifiers

DOI
10.1109/32.16599