An improved method for bounding stationary measures of finite Markov processes

Performance Evaluation

Volumn 62, Issue 1-4, 2005, Pages 349-365

  Buchholz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Bounding techniques; Dependability evaluation; Markov processes; Numerical analysis; Performance analysis; Stationary analysis

Indexed keywords

COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; VECTORS;

BOUNDING TECHNIQUES; DEPENDABILITY EVALUATION; PERFORMANCE ANALYSIS; STATIONARY ANALYSIS;

MARKOV PROCESSES;

EID: 24144454695     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2005.07.002     Document Type: Conference Paper

References (15)

1. P. Buchholz Exact and ordinary lumpability in finite Markov chains J. Appl. Probab. 31 1994 59 75
2. P. Buchholz An iterative bounding method for stochastic automata networks Perform. Evaluat. 49 1-4 2002 211
3. P. Buchholz, An Improved Method for Bounding Stationary Measures of Finite Markov Processes, Technical Report, University of Dortmund, Department of Computer Science, 2005, Extended version available under http://ls4-www.cs.uni- dortmund.de/home/buchholz/bounding.pdf.
4. G. Chiola, C. Dutheillet, G. Franceschini, and S. Haddad Stochastic well-formed coloured nets and multiprocessor modelling applications IEEE Trans. Comput. 42 11 1993 1343 1360
5. P.J. Courtois, and P. Semal Bounds for the positive eigenvectors of nonnegative matrices and for their approximation by decomposition J. ACM 31 4 1984 804 825
6. P.J. Courtois, and P. Semal On polyhedra of Perron-Frobenius eigenvectors Linear Algebra Appl. 65 1985 157 170
7. G. Franceschinis, and R.R. Muntz Bounds for quasi-lumpable Markov chains Perform. Evaluat. 20 1-3 1994 223 244
8. W.W. Hager Updating the inverse of a matrix SIAM Rev. 31 2 1989 221 239
9. J.G. Kemeny, J.L. Snell, Finite Markov Chains, Springer, New York, Berlin, Heidelberg, 1976.
10. S. Mahevas, and G. Rubino Bound computation of dependability and performance measures IEEE Trans. Comput. 50 5 2001 399 413
11. R.R. Muntz, and J. Lui Computing bounds on steady-state availability of repairable computer systems J. ACM 41 4 1994 676 707
12. M.J.D. Powell A theorem on rank modifications to a matrix and its inverse Comput. J. 12 1969 288 290
13. W.H. Sanders, and J.F. Meyer Reduced base model construction for stochastic activity networks IEEE J. Select. Areas Commun. 9 1 1991 25 36
14. P. Semal Refineable bounds for large Markov chains IEEE Trans. Comput. 44 10 1995 1216 1222
15. W.J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.