In: Proc. 4th Int. Workshop on Petri Nets and Performance Models (PNPM'91), Melbourne, Australia, pages 176-185. IEEE Comp. Soc. Press, December 1991.
Abstract: This paper introduces an algorithm for calculating steady-state solutions of DSPN models. The described method employs the randomization technique enhanced by a stable calculation of Poisson probabilities. A complete re-design and re-implementation of the appropriate components implemented in the version 1.4 of the software package GreatSPN has lead to significant savings in both computation time and memory space. These benefits are illustrated by DSPN models taken from the literature. We consider DSPN models for an Er/D/1/K queueing system and a fault-tolerant clocking system. These examples show that the model solutions are calculated with significantly less computational effort and a better error control by the algorithm described than by the method implemented in the version 1.4 of the software package GreatSPN.