论文信息 - On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net

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.

Ger Koole

[1] J.P.C. Blanc,et al. The Power-Series Algorithm for a Wide Class of Markov Processes , 1994 .

[2] J. Blanc. On a numerical method for calculating state probabilities for queueing systems with more than one waiting line , 1987 .

[3] J.P.C. Blanc. A note on waiting times in systems with queues in parallel , 1987 .

[4] Onno Boxma,et al. Queueing-theoretic solution methods for models of parallel and distributed systems , 1994 .

[5] J.P.C. Blanc,et al. Development and justification of the power-series algorithm for BMAP-systems , 1995 .

[6] J. P. C. Blanc. Performance evaluation of polling systems by means of the power-series algorithm , 1992, Ann. Oper. Res..

[7] J. P. C. Blanc,et al. Performance Analysis and Optimization with the Power-Series Algorithm , 1993, Performance/SIGMETRICS Tutorials.

[8] G. M. Koole. On the power series algorithm , 1994 .

[9] Gerard Hooghiemstra,et al. Power series for stationary distributions of coupled processor models , 1988 .

[10] P. Wynn,et al. On the Convergence and Stability of the Epsilon Algorithm , 1966 .

[11] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[12] J. P. C. Blanc. A numerical approach to cyclic-service queueing models , 1990, Queueing Syst. Theory Appl..