Dependability assessment using binary decision diagrams (BDDs)

Presents the DREDD (Dependability and Risk Evaluation using Decision Diagrams) algorithm which incorporates coverage modeling into a BDD solution of a combinatorial model. BDDs, which do not use cutsets to generate system unreliability, can be used to find exact solutions for extremely large systems. The DREDD algorithm takes advantage of the efficiency of the BDD solution approach and increases the accuracy of a combinatorial model by including consideration of imperfect coverage. The usefulness of combinatorial models, long appreciated for their logical structure and concise representational form, is extended to include many fault-tolerant systems previously thought to require more complicated analysis techniques in order to include coverage modeling. In. This paper, the DREDD approach is presented and applied to the analysis of two sample systems, the F18 flight control system and a fault-tolerant multistage interconnection network.<<ETX>>

[1]  Joanne Bechta Dugan,et al.  Fault trees and imperfect coverage: a combinatorial approach , 1993, Annual Reliability and Maintainability Symposium 1993 Proceedings.

[2]  Olivier Coudert,et al.  Fault tree analysis: 10/sup 20/ prime implicants and beyond , 1993, Annual Reliability and Maintainability Symposium 1993 Proceedings.

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

[4]  Albert R. Wang,et al.  Logic verification using binary decision diagrams in a logic synthesis environment , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[5]  Olivier Coudert,et al.  Fault Tree Analysis: 1020 Prime Implicants and Beyond , 1993 .

[6]  J. C. Cluley,et al.  Probabilistic Reliability: an Engineering Approach , 1968 .

[7]  Joanne Bechta Dugan,et al.  A combinatorial approach to modeling imperfect coverage , 1995 .

[8]  Olivier Coudert,et al.  Application of a new logically complete ATMS to digraph and network-connectivity analysis , 1994, Proceedings of Annual Reliability and Maintainability Symposium (RAMS).

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

[10]  Salvatore J. Bavuso,et al.  Dynamic fault-tree models for fault-tolerant computer systems , 1992 .

[11]  Jean Christophe Madre,et al.  Proving circuit correctness using formal comparison between expected and extracted behaviour , 1988, 25th ACM/IEEE, Design Automation Conference.Proceedings 1988..

[12]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[13]  Ann Patterson-Hine,et al.  A quantitative analysis of the F18 flight control system , 1993 .

[14]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[15]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[16]  William C. Carter,et al.  Reliability Modeling for Fault-Tolerant Computers , 1971, IEEE Transactions on Computers.

[17]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[18]  D. L. Iverson.  Automatic translation of digraph to fault-tree models , 1992, Annual Reliability and Maintainability Symposium 1992 Proceedings.

[19]  Salvatore J. Bavuso,et al.  Fault trees and Markov models for reliability analysis of fault-tolerant digital systems , 1993 .

[20]  Antoine Rauzy,et al.  New algorithms for fault trees analysis , 1993 .

[21]  Joanne Bechta Dugan,et al.  Dependability analysis of fault-tolerant systems: a new look at combinatorial modeling , 1995 .

[22]  Kishor S. Trivedi,et al.  Coverage Modeling for Dependability Analysis of Fault-Tolerant Systems , 1989, IEEE Trans. Computers.

[23]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[24]  Kishor S. Trivedi,et al.  Decomposition in Reliability Analysis of Fault-Tolerant Systems , 1983, IEEE Transactions on Reliability.

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