- Volume 20 Issue 3
As the number of gates and basic events in fault trees increases, it becomes difficult to calculate the exact probability of the top event. In order to overcome this difficulty the BDD methodology can be used to calculate the exact top event probability for small and medium size fault trees in short time. Fault trees are converted to BDD by using CUDD library functions and a failure path search algorithm is proposed to calculate the exact top event probability. The backward search algorithm is more efficient than the forward one in finding failure paths and in the calculation of the top event probability. This backward search algorithm can reduce searching time in the identification of disjoint failure paths from BDD and can be considered as an effective tool to find the cut sets and the minimal cut sets for the given fault trees.
Binary Decision Diagram;Cut Set;Failure Path;Fault Tree;Minimal Cut Set
- R. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transaction On Computers, vol. C-35 no. 8, pp. 677-691, Aug. 1986. https://doi.org/10.1109/TC.1986.1676819
- A. Rauzy, "New algorithms for fault tree analysis," Reliability Engineering System Safety, vol. 40, no. 3, pp. 203-211, 1993. https://doi.org/10.1016/0951-8320(93)90060-C
- K. Reay, "Efficient Fault Tree Analysis Using Decision Diagrams," Ph. D. dissertation, Loughborough University, England, GB, 2002.
- F. Somenzi, CUDD Documentation [Internet]. Available: http://vlsi.colorado.edu/personal/fabio/CUDD/html/index.html
- C. Park, J. Ha, Probabilistic Safety Assessment, pp. 60-63, Brainkorea, 2003.
- Failure Analysis to Derive the Causes of Abnormal Condition of Electric Locomotive Subsystem vol.41, pp.2, 2018, https://doi.org/10.11627/jkise.2018.41.2.084
Supported by : Ministry of Land, Infrastructure and Transport of Korean government