ACM Home Page
Please provide us with feedback. Feedback
Semi-numerical transient analysis of Markov models
Full text PdfPdf (993 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 33rd annual on Southeast regional conference table of contents
Clemson, South Carolina
SESSION: Systems modeling table of contents
Pages: 13 - 23  
Year of Publication: 1995
ISBN:0-89791747-2
Authors
A. V. Ramesh  Duke University, Durham, NC
Kishor Trivedi  Duke University, Durham, NC
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1122018.1122021
What is a DOI?

ABSTRACT

We present a new O(n3) algorithm for seminumerical transient analysis of continuous time Markov chains with n states. The algorithm is based on spectral decomposition of the transition rate matrix in combination with partial fraction expansion based on Laplace transforms. The algorithm acknowledges the inherent numerical difficulties associated with illconditioned problems and finite machine precision by incorporating a realistic assessment of the condition and sensitivity of the problem. It is more efficient and provides more accurate solutions in the face of round-off error when compared to similar algorithms in the literature. We demonstrate the performance of the algorithm on many ill-conditioned applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
C. Bavely and G. Stewart. An Algorithm for Computing Reducing Subspaces by Block Diagonalization. SIAM. J. Numer. Anal., Vol. 16, No. 2: 359--367, April 1979.
 
4
G. Golub and C. Van Loan. Matrix Computations. Johns Hopkins University Press, Baltimore, MD, 1983.
 
5
G. Golub and J. Wilkinson. Illconditioned Eigensystems and The Computation of The Jordan Canonical Form. SIAM Review, Vol. 18, No. 4: 578--619, Oct. 1976.
6
 
7
W. Ledermann and G. E. H. Reuter. Spectral Theory for the Differential Equations of Simple Birth and Death Processes. Phil. Trans. Royal Society, Series A, 246: 321--369, 1954.
 
8
 
9
J. Muppala, M. Malhotra and K. Trivedi. Stiffness-Tolerant Methods for Transient Analysis of Stiff Markov Chains. Microelectronics and Reliability, Vol 34, No 11 pp 1825--1841, 1994.
 
10
Y. Ng and A. Avizienis. A Unified Reliability Model for Fault-Tolerant Computers. IEEE Trans. on Computers, Vol. C-29, No. 11, Nov. 1980.
 
11
 
12
A. V. Ramesh and K. Trivedi. Semi-Numerical Transient Analysis of Markov Models. Technical Report, Dept. of Electrical Engineering, Duke University, Durham, NC.
 
13
R. Sahner and K. Trivedi. Reliability Modeling Using SHARPE. IEEE Trans. on Reliability, Vol. R-36, No. 2: 186--193, June 1987.
 
14
 
15
J. Sjogren. Closed-Form Solution of Decomposable Stochastic Models. Computers Math. Applic., Vol. 23, No. 12: 43--67, 1992.
 
16
B. Smith, J. Boyle, J. Dongarra, B. Garbow, Y. Ikebe, V. Klema, and C. Moler. Matrix Eigensystem Routines: EISPACK Guide. Springer-Verlag, New York, 2 edition, 1971.
 
17
 
18
H. Tardif, K. Trivedi, and A. V. Ramesh. Closed-Form Transient Analysis of Markov Chains. Technical Report CS-1988, Dept. of Computer Science, Duke University, Durham, NC, June 1988.
 
19
 
20
 
21
W. Whitt. Untold Horrors of the Waiting Room: What the Equilibruim Distribution Will Never Tell About The Queue-Length Process. Management Science, Vol. 5, No. 4: 395--408, April 1983.
 
22
Collaborative Colleagues:
A. V. Ramesh: colleagues
Kishor Trivedi: colleagues