In: Proc. of the IEEE Conf. TENCON 87: Computers and Communications Technology Toward 2000, Vol. 2, pages 482-486. New York: IEEE, 1987.
Abstract: Deterministic stochastic Petri nets (DSPNs), which are timed Petri nets with three types of transition (immediate, deterministic and stochastic), are considered. For a class of DSPNs under the resampling policy, an efficient analytical method is presented for computing the steady-state probability distribution of the reachable markings of the DSPN.