In: Seventh Annual International Phoenix Conference on Computers and Communications, pages 324-329. Washington: IEEE Comput. Soc. Press, 1988.
Abstract: It is shown that for timed Petri nets with exponentially distributed firing times (M-timed Petri nets), the state space can be generated directly from net specifications, and then the stationary probabilities of states can be obtained by standard methods, developed for analysis of (continuous-time) Markov chains. The author also presents a short theoretical background for performance evaluation using timed Petri nets.