TABLE OF CONTENTS In order to generate a BDD corresponding to the structure function of an FT, we study the FT in depth, and we recursively construct the BDD for each node.
Section A2 presents the construction of a BDD starting from an FT. Algorithm 1, for this construction, takes recourse to algorithm 2. Section A3 presents the probabilistic assessment (algorithm 3) of the top event (or of an intermediate event), proceeding from the BDD constructed beforehand. Section A4 presents the calculation of the Birnbaum importance factor for the top event (algorithm 4) or of an intermediate event. Section A5 presents algorithm 5 for searching the prime implicants for a non-coherent FT, or the minimal sets (cut sets and paths) for a coherent FT. Algorithm 5 in combination with algorithm 6 completes the difference between two Boolean functions (BDD) F and G, i.e., F\ G. It generates a BDD coding for all the paths of F (as indicated in the graph), except those containing a path of G. Finally, algorithm 7 reads the reduced BDD and displays the prime implicants.
These algorithms (1 7) can constitute the basis of a software for the analysis of FTs. [1]
[1]Written by Khaled Odeh.
In this section, we present an algorithm for the construction of the BDD from the FT. The FT-to-BDD (node) function transforms the BDD of the FT, whose top event is "node".
