Fault trees and sequence dependencies

One of the frequency cited shortcomings of fault-tree models, their inability to model so-called sequence dependencies, is discussed. Several sources of such sequence dependencies are discussed, and new fault-tree gates to capture this behavior are defined. These complex behaviors can be included in present fault-tree models because they utilize a Markov solution. The utility of the new gates is demonstrated by presenting several models of the FTPP (fault-tolerant parallel processor), which include both hot and cold spares.<<ETX>>

[1]  Malathi Veeraraghavan,et al.  An Approach to Solving Large Reliability Models , 1988 .

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

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

[4]  C. H. Lie,et al.  Fault Tree Analysis, Methods, and Applications ߝ A Review , 1985, IEEE Transactions on Reliability.

[5]  Ernest J. Henley,et al.  Reliability engineering and risk assessment , 1981 .

[6]  Malathi Veeraraghavan,et al.  Bounded approximate reliability models for distributed systems , 1989, Proceedings of the Eighth Symposium on Reliable Distributed Systems.

[7]  Jaynarayan H. Lala,et al.  Fault tolerant parallel processor architecture overview , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[8]  Richard E. Harper.  RELIABILITY ANALYSIS OF PARALLEL PROCESSING SYSTEMS , 1988 .