On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net

The power series algorithm has been developed as numerical procedure for solving queueing models. This paper shows that it can be used for each Markov process with a single recurrent class. This applies in particular to finite state processes, which is illustrated with the analysis of a bounded stochastic Petri net model.