| Article ID: | iaor19982950 |
| Country: | United States |
| Volume: | 9 |
| Issue: | 1 |
| Start Page Number: | 51 |
| End Page Number: | 56 |
| Publication Date: | Dec 1997 |
| Journal: | INFORMS Journal On Computing |
| Authors: | Koole Ger |
| Keywords: | probability |
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.