Report 90--40 des Fachbereichs 20, Informatik, pages 1-19 pp.. Berlin, Germany: Technische Universität, 1990.
Abstract: This paper introduces an algorithm for efficiently computing the time-dependent quantities required for solving a Deterministic and Stochastic Petri Net (DSPN) model. The proposed method employs the randomization technique for calculating the state transition matrix of the embedded Markov chain. A DSPN model for a medium access control protocol with limited contention and a DSPN model for a fault-tolerant clocking system are considered. The examples show that the steady-state solutions are calculated with significantly less computational effort and a better accuracy by the approach proposed than by the method implemented in the version 1.4 of the software package GreatSPN.
Keywords: (efficient) deterministic (and) stochastic net (solving); randomization technique; state transition matrix; Markov chain; medium access control protocol; fault-tolerant clocking system; steady-state solution; net tool; GreatSPN.