In: Focus on Software. Proceedings of the ACM Sixteenth Annual Computer Science Conference, 1988, Atlanta, GA, USA, pages 239-248. New York, NY, USA: ACM, 1988.
Abstract: It is shown that the behavior of timed Petri nets with deterministic firing times (D-timed nets) and with exponentially distributed random firing times (M-timed nets) can be described within one uniform formalism. Moreover, for both classes of nets the state spaces are homogeneous semi-Markov chains, the stationary probabilities of states and many performance measures can thus be obtained by standard techniques. Because of sparsity of nets as well as corresponding systems of equilibrium equations, list structure representations are proposed and a general procedure for generation of the state space is outlined.
Keywords: generation (of) state space (for) timed net(s); deterministic firing time; D-timed net; random firing time; M-timed nets; homogeneous state space; homogeneous semi-Markov chains; stationary probability; performance measure; state space generation; equilibrium equations.