Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have