Abstract
A new conversion method for fault tree (FT) to binary decision diagram (BDD) was introduced. Firstly, FT was reduced and the reduction rule was proposed, share-node conception was introduced on the basis of FT decomposition, then the rules of connection of component BDD was proposed. Furthermore the route-based BDD reduction rule was proved, with which reduction can be done at the same time with BDD composition, and the route sequence and cut sets can be obtained, while computation and storage is greatly reduced during the process. Finally, the procedure of the transformation is presented. The affectivity effectiveness and practicability is thereby proved.
| Original language | English |
|---|---|
| Pages (from-to) | 140-144 |
| Number of pages | 5 |
| Journal | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
| Volume | 27 |
| Issue number | SUPPL. 1 |
| Publication status | Published - May 2007 |
Keywords
- Binary decision diagram
- Fault tree
- Reduction rules
- Route
- Share-node