An Analytical Method for Computing Troughput Times in Stochastic Workflow Nets

摘要

In this paper, an analytical method is presented to compute the throughput time of a stochastic Petri Net model. The approach is based on using arbitrary probability distributions to model the service times of the transitions in the net. The nets that can be analysed form a free choice sub class of the so-called workflow nets. Within these nets, common control principles can be applied, such as sequencing, parallelism, choice, and iteration. The Fast Fourier Transform plays an important role in makin the algorithm efficient. A numerical example is included.