On efficiently calculating transient solutions of generalized stochastic Petri net models

The author describes an efficient numerical algorithm for calculating transient solutions of generalized stochastic Petri net (GSPN) models. The method described is based on the randomization technique and a stable calculation of Poisson probabilities. A complete redesign and reimplementation of the appropriate components of the software package GreatSPN lead to a significant savings in computation time and memory space. The benefit of employing the described solution algorithm is illustrated by a GSPN model for the M/M/1/K queueing system. This example shows that transient solutions of GSPN models are calculated with significantly less computational effort and better error control by the algorithm described than by the method implemented in version 1.4 of the analysis tool GreatSPN