On Simulation of Non-Markovian Stochastic Petri Nets with Heavy-Tailed Firing Times

P. W. Glynn and P. J. Haas

Proceedings of the 2012 Winter Simulation Conference, (2012)

Long-run stochastic stability is a precondition for applying steady-state simulation output analysis methods. such as regenerative, spectral, or standardized time series methods.to a stochastic Petri Net (SPN). A fundamental stability requirement for an irreducible SPN is that the markings of the net be recurrent, in that the marking process visits each marking infinitely often with probability 1. We study recurrence properties of irreducible non-Markovian SPNs with finite marking set. Our focus is on the “clocks” that govern the transition firings, and we consider SPNs in which zero, one, or at least two simultaneously-enabled transitions can have heavy-tailed clock-setting distributions. We establish positive recurrence, null recurrence, and, perhaps surprisingly, possible transience of markings for these respective regimes. The transience result stands in strong contrast to Markovian or semi-Markovian SPNs, where irreducibility and finiteness of the marking set guarantee positive recurrence.