Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering-Reference-Cited by-同舟云学术

Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering

Published:2005-09 Issue:3 Volume:165 Page:810-825
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Pekergin Nihal,Dayar Tuğrul,Alparslan Denizhan N.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference23 articles.

1. O. Abu-Amsha, J.-M. Vincent, An algorithm to bound functionals of Markov chains with large state space, Rapport de recherche MAI n 25, IMAG, Grenoble, France, 1996

2. Decomposability: Queueing and Computer System Applications;Courtois,1977

3. Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition;Courtois;Journal of the Association for Computer Machinery,1984

4. T. Dayar, Permuting Markov chains to nearly completely decomposable form, Technical Report BU-CEIS-9808, Department of Computer Engineering and Information Science, Bilkent University, Ankara, Turkey, 1998, Available from

5. T. Dayar, N. Pekergin, Stochastic comparison, reorderings, and nearly completely decomposable markov chains (NSMC'99), in: B. Plateau, W.J. Stewart, M. Silva (Eds.), Numerical Solution of Markov Chains, Prensas Universitarias de Zaragoza, Spain, 1999, pp. 228–246

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Adaptive formal approximations of Markov chains;Performance Evaluation;2021-07

2. Graph transformation and shortest paths algorithms for finite Markov chains;Physical Review E;2021-06-08

3. Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains;2009 Sixth International Conference on the Quantitative Evaluation of Systems;2009-09

4. Stochastic Bounds on Partial Ordering: Application to Memory Overflows Due to Bursty Arrivals;Computer and Information Sciences - ISCIS 2005;2005

5. Censoring Markov Chains and Stochastic Bounds;Formal Methods and Stochastic Models for Performance Evaluation