DocumentCode :
1857486
Title :
Bounding and approximating Markov models
Author :
Laemmel, Arthur E. ; Shooman, Martin L.
Author_Institution :
Polytech. Univ., Farmingdale, NY, USA
fYear :
1990
fDate :
23-25 Jan 1990
Firstpage :
254
Lastpage :
259
Abstract :
Simple expressions are developed for upper and lower bounds on the Markov state probabilities obtained from inspection of the terms in the Markov probability matrix. These bounds can be used for quick paper-and-pencil and calculator estimates. The bounds are also combined with the merging and decomposition methods in several examples of reliability and maintainability assessment. Use of these bounds can aid the well-known simplification technique of truncation (deleting the low probability states) by quickly obtaining upper bounds on the state probabilities, which ensures that only low-probability states are truncated
Keywords :
Markov processes; approximation theory; maintenance engineering; probability; reliability; Markov state probabilities; approximation; bounding; decomposition; maintainability; merging; probability matrix; reliability; truncation; Availability; Differential equations; Distributed computing; Fault tolerant systems; Hardware; Inspection; Matrix decomposition; Merging; Reliability; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reliability and Maintainability Symposium, 1990. Proceedings., Annual
Conference_Location :
Los Angeles, CA
Type :
conf
DOI :
10.1109/ARMS.1990.67966
Filename :
67966
Link To Document :
بازگشت