Browse > Article
http://dx.doi.org/10.6109/jkiice.2019.23.6.711

A Method of BDD Restructuring for Efficient MCS Extraction in BDD Converted from Fault Tree and A New Approximate Probability Formula  

Cho, Byeong Ho (Korea Reliability Technology & System)
Hyun, Wonki (Korea Reliability Technology & System)
Yi, Woojune (Korea Reliability Technology & System)
Kim, Sang Ahm (Korea Railway Research Institute)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.23, no.6, 2019 , pp. 711-718 More about this Journal
Abstract
BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.
Keywords
Binary Decision Diagram; Cut Set; Failure Path; Fault Tree; Minimal Cut Set;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 E. Ruijters, M. Stoelinga, "Fault tree analysis: A survey of the state-of-the-art in modeling, analysis and tools," Computer Science Review, vol. 15-16, pp. 29-62, 2015.   DOI
2 R. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transaction On Computers, C35(8): pp. 677-691, Aug. 1986.   DOI
3 Y. Deng, H. Wang, B. Guo, "BDD algorithms based on modularization for fault tree analysis," Progress in Nuclear Energy, 85, pp. 192-199, 2015.   DOI
4 A. Rauzy, "New algorithms for Fault Tree Analysis," Reliability Engineering System Safety, 40, pp. 203-211, 1993.   DOI
5 W. Jung, J. Riley, K. Canavan, "BDD application to the calculation of probability and importance measures of minimal cutsets," 10th International Conference on Probabilistic Safety Assessment and Management 2010, PSAM 2010, 1. pp. 771-780, 2010.
6 F. Somenzi, "CUDD: CU Decision Diagram Package Release 2.4.1," Department of Electrical and Computer Engineering, University of Colorado at Boulder: UT, CUDD Package Manual, 2005.
7 D. K. Houngninou (2017), CUDD Tutorials, Learn it by examples. Available:http://davidkebo.com/cudd.
8 B. Cho, B. Yum, S. Kim, "Calculation of Top Event Probability of Fault Tree using BDD," Journal of The Korea Institute of Information and Communication Engineering, vol. 20, no. 3, pp. 654-662, Mar. 2016.   DOI
9 N. Limnios, "Appendix B. European Benchmark Fault Trees," in Fault Trees, London:ISTE, Appendix B, pp. 191-192, 2007.
10 L. Xing, S. Amari, Binary Decision Diagrams and Extensions for System Reliability Analysis, NJ: Scrivener Publishing Wiley, ch. 2, pp. 30-31, 2015.