Near complete decomposability: Bounding the error by a stochastic comparison method

Advances in Applied Probability

Volumn 29, Issue 3, 1997, Pages 830-855

  Truffet, Laurent ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Matrix comparison; Near complete decomposability; Stochastic bounds; Strong ordering

Indexed keywords

APPROXIMATION THEORY; MATRIX ALGEBRA; PROBABILITY;

NEAR COMPLETE DECOMPOSABLE MARKOVIAN SYSTEMS; STOCHASTIC COMPARISON METHOD;

MARKOV PROCESSES;

EID: 0031222571     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0001867800028354     Document Type: Review

References (21)

1. ABU-AMSHA, O. (1995) Evaluation de performance: Méthode d'encadrements stochastiques dans les réseaux d'automates stochastiques. Technical report. DEA INPG-ENSIMAG.
2. ABU-AMSHA, O. AND VINCENT, J.-M. (1995) An algorithm to bound functionals of Markov chains with large state space. Technical report.
3. COURTOIS, P. J. (1977) Decomposability: Queueing and Computer Systems Applications. Academic Press, London.
4. COURTOIS, P. J. (1978) Exact aggregation in queueing networks. In Proc. 1st AFCET-SMF Meeting on Appl. Math. Ecole Polytechn, Palaiseau. Tome I. pp. 35-51.
5. COURTOIS, P. J. (1982) Error minimization in decomposable stochastic models. Appl. Prob. Comp. Sci. 1.
6. COURTOIS, P. J. AND SEMAL, P. (1984) Bounds for the positive eigenvectors of non-negative matrices and for their approximations by decomposition. J. Assoc. Comput. Mach. 31, 804-825.
7. COURTOIS, P. J. AND SEMAL, P. (1985) On polyhedra of Perron-Frobenius eigenvectors. Linear Algebra Appl. 65, 157-170.
8. DALEY, D. J. (1968) Stochastically monotone Markov chains. Z. Wahrscheinlichkeitsth. 10, 305-317.
9. FRANCESCHINIS, G. AND MUNTZ, R. R. (1994) Bounds for quasi-lumpable Markov chains. Perf. Eval. 20, 223-244.
10. KESTER, A. AND KEILSON, J. (1977) Monotone matrices and monotone Markov processes. Stoch. Proc. Appl. 5, 231-241.
11. MASSEY, W. A. (1987) Stochastics orderings for Markov processes on partially ordered spaces. Math. Operat. Res. 11, 350-367.
12. MUNTZ, R. R., DE SOUZA E SILVA, E. AND GOYAL, A. (1989) Bounding availability of repairable computer systems. In ACM Sigmetrics and Performance '89 17, 29-38.
13. ROSS, S. M. (1982) Stochastic Processes. Wiley, New York.
14. SIMON, H. A. AND ANDO, A. (1961) Aggregation of variables in dynamic systems. Econometrica 29.
15. STEWART, G. W. (1987) Computable error bounds for aggregated Markov chains. J. Assoc. Comput. Mach. 30, 271-285.
16. STOYAN, D. (1970) Comparison Methods for Queues and Other Stochastic Models. Wiley, New York.
17. TRÉMOLIÈRES, M., VINCENT, J. M. AND PLATEAU, B. (1992) Determination of the optimal stochastic upper bound of a Markovian generator. Technical report. Grenoble.
18. VANTILBORGH, H. (1978) Exact aggregation in exponential queueing networks. J. Assoc. Comput. Mach. 25, 620-629.
19. 2). J. Assoc. Comput. Mach. 32, 162-190.
20. VINCENT, J.-M. (1994) Encadrement de performances: une approche algorithmique. Technical report.
21. WHITT, W. (1986) Stochastic comparisons for non-Markov processes. Math. Operat. Res. 11, 608-618.