Approximate sensitivity analysis for acyclic Markov reliability models

Acyclic Markov chains are frequently used for reliability analysis of nonmaintained mission-critical computer-based systems. Since traditional sensitivity (or importance) analysis using Markov chains can be computationally expensive, an approximate approach is presented which is easy to compute and which performs quite well in test cases. This approach is presented in terms of a Markov chain which is used for solving a dynamic fault-tree, but the approach applies to any acyclic Markov reliability model.

[1]  J. B. Dugan,et al.  Sensitivity analysis of modular dynamic fault trees , 2000, Proceedings IEEE International Computer Performance and Dependability Symposium. IPDS 2000.

[2]  Hiromitsu Kumamoto,et al.  Probabilistic Risk Assessment , 1996 .

[3]  David Coppit,et al.  Developing a high-quality software tool for fault tree analysis , 1999, Proceedings 10th International Symposium on Software Reliability Engineering (Cat. No.PR00443).

[4]  David Coppit,et al.  The Galileo fault tree analysis tool , 1999, Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (Cat. No.99CB36352).

[5]  J. Dugan,et al.  A modular approach for analyzing static and dynamic fault trees , 1997, Annual Reliability and Maintainability Symposium.

[6]  Yves Dutuit,et al.  A linear-time algorithm to find modules of fault trees , 1996, IEEE Trans. Reliab..

[7]  Kishor S. Trivedi,et al.  Sensitivity analysis of reliability and performability measures for multiprocessor systems , 1988, SIGMETRICS 1988.

[8]  Philip Heidelberger,et al.  Sensitivity Analysis of Continuous Time Markov Chains Using Uniformization , 1987, Computer Performance and Reliability.

[9]  Roslyn M. Sinnamon,et al.  Fault tree analysis and binary decision diagrams , 1996, Proceedings of 1996 Annual Reliability and Maintainability Symposium.

[10]  Boudewijn R. Haverkort,et al.  Sensitivity and uncertainty analysis of Markov-reward models , 1992 .