The Community for Technology Leaders
Proceedings of the Fourth International Workshop on Petri Nets and Performance Models (1991)
Melbourne, Victoria, Australia
Dec. 2, 1991 to Dec. 5, 1991
ISBN: 0-8186-2285-7
pp: 176-185
C. Lindemann , Inst. fur Tech. Inf., Tech. Univ., Berlin, Germany
ABSTRACT
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. The author considers DSPN models for an E/sub r//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.<>
INDEX TERMS
fault tolerant computing, Petri nets, queueing theory
CITATION

C. Lindemann, "An improved numerical algorithm for calculating steady-state solutions of deterministic and stochastic Petri net models," Proceedings of the Fourth International Workshop on Petri Nets and Performance Models(PNPM), Melbourne, Victoria, Australia, , pp. 176-185.
doi:10.1109/PNPM.1991.238803
90 ms
(Ver 3.3 (11022016))