Evaluating FTRE's for Dependability Measures in Fault Tolerant Systems

In order to analyze dependability measures in a fault tolerant system, we generally consider a nonstate space or a state space type model. A fault tree with repeated events (FTRE's) presents an important strategy for the nonstate space model. The paper deals with a conservative assessment to complex fault tree models, henceforth called CRAFT, to obtain an approximate analysis of the FTRE's. It is a noncutset, direct, bottom-up approach. It uses failure probability or failure rate as input and determines a bound on the probability of occurrence of the TOP event. CRAFT generalizes the concept of a cutting heuristic that obtains the signal probabilities for testability measurement in logic circuits. The method is efficient and solves coherent and noncoherent FTRE's having AND, OR, XOR, and NOT gates. In addition, CRAFT considers M/N priority AND, and two types of functional dependency, namely OR and AND types. Examples such as the Cm* architecture and a fault-tolerant software based on recovery block concept are used to illustrate the approach. The paper also provides a comparison with approaches such as SHARPE, HARP, and FTC. >

[1]  Kishor S. Trivedi,et al.  Performance and Reliability Analysis Using Directed Acyclic Graphs , 1987, IEEE Transactions on Software Engineering.

[2]  Takehisa Kohda,et al.  Finding modules in fault trees , 1989 .

[3]  W. G. Schneeweiss Approximate fault-tree analysis without cut sets , 1992, Annual Reliability and Maintainability Symposium 1992 Proceedings.

[4]  Toshiyuki Inagaki,et al.  Probabilistic Evaluation of Prime Implicants and Top-Events for Non-Coherent Systems , 1980, IEEE Transactions on Reliability.

[5]  Robert S. Swarz,et al.  Reliable Computer Systems: Design and Evaluation , 1992 .

[6]  Suresh Rai,et al.  CAREL: Computer Aided Reliability Evaluator for Distributed Computing Networks , 1991, IEEE Trans. Parallel Distributed Syst..

[7]  Gary S. Ditlow,et al.  Random Pattern Testability , 1984, IEEE Transactions on Computers.

[8]  Kishor S. Trivedi,et al.  Power-hierarchy of dependability-model types , 1994 .

[9]  Jean Arlat,et al.  Dependability Modeling and Evaluation of Software Fault-Tolerant Systems , 1990, IEEE Trans. Computers.

[10]  M. Ray Mercer,et al.  Bounding Signal Probabilities for Testability Measurement Using Conditional Syndromes , 1992, IEEE Trans. Computers.

[11]  J. Scott Provan,et al.  Disjoint Products and Efficient Computation of Reliability , 1988, Oper. Res..

[12]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[13]  Olivier Coudert,et al.  MetaPrime: an interactive fault-tree analyzer , 1994 .

[14]  Kishor S. Trivedi,et al.  The hybrid automated reliability predictor , 1986 .

[15]  Anna L. Martensen,et al.  The Fault Tree Compiler (FTC): Program and mathematics , 1989 .

[16]  Karl Stecher,et al.  Evaluation of Large Fault-Trees with Repeated Events Using an Efficient Bottom-Up Algorithm , 1986, IEEE Transactions on Reliability.

[17]  J. E. Perry,et al.  A simple approach to fault-tree probabilities , 1986 .

[18]  Kishor S. Trivedi,et al.  An improved algorithm for symbolic reliability analysis , 1991 .

[19]  Kishor S. Trivedi,et al.  Reliability Modeling Using SHARPE , 1987, IEEE Transactions on Reliability.

[20]  Dharma P. Agrawal,et al.  Advances in distributed system reliability , 1990, IEEE Computer Society Press Tutorial.

[21]  Kishor S. Trivedi Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[22]  Salvatore J. Bavuso,et al.  Fault trees and sequence dependencies , 1990, Annual Proceedings on Reliability and Maintainability Symposium.

[23]  F.A. Patterson-Hine,et al.  Simple models of fault tolerant software , 1993, Annual Reliability and Maintainability Symposium 1993 Proceedings.

[24]  J.B. Fussell,et al.  On the Quantitative Analysis of Priority-AND Failure Logic , 1976, IEEE Transactions on Reliability.