A bi-level Bernoulli scheme for database sampling
Peter J. Haas, Christian König
SIGMOD 2004
Generalized semi-Markov processes and stochastic Petri nets provide building blocks for specification of discrete event system simulations on a finite or countable state space. The two formal systems differ, however, in the event scheduling (clock-setting) mechanism, the state transition mechanism, and the form of the state space. We have shown previously that stochastic Petri nets have at least the modeling power of generalized semi-Markov processes. In this paper we show that stochastic Petri nets and generalized semi-Markov processes, in fact, have the same modeling power. Combining this result with known results for generalized semi-Markov processes, we also obtain conditions for time-average convergence and convergence in distribution along with a central limit theorem for the marking process of a stochastic Petri net. © 1991, Cambridge University Press. All rights reserved.
Peter J. Haas, Christian König
SIGMOD 2004
Gerald S. Shedler, Jonathan Southard
Performance Evaluation
Peter J. Haas
Stochastic Models
Peter W. Glynn, Peter J. Haas
ACM TOMACS