Bypassing BDD construction for reliability analysis

[1]  A. Rauzy,et al.  Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia , 1997 .

[2]  Henrik Reif Andersen,et al.  Equivalence checking of combinational circuits using Boolean expression diagrams , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Henrik Reif Andersen,et al.  Boolean expression diagrams , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[4]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[5]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

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