대규모 고장수목 계산에서 빠른 BDD 생성을 위한 고장수목 축소
Fault Tree Reduction for Fast BDD Generation in Solving Large Fault Trees
2
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
It is known that the size of fault tree affects the BDD(Binary Decision Diagram) structure and as the fault tree size decreases, the number of BDD nodes also decreases in general and the BDD generation time is shorter than the other. For two given fault trees which are logically the same each other, the BDD generation time for the smaller fault tree is shorter. Contraction, absorption and extraction rule can be applied for the logically same, but smaller fault tree transformation. As the BDD conversion of fault tree is performed per gate, the aim of fault tree reduction is to reduce the number of gates and to simplify the repeated events. Formulation of fault tree reduction is obtained and three forms of fault tree reduction are recommended before the BDD conversion of fault trees in order to reduce the runtime. The fault tree of an derailment accident is calculated and it is shown that the reduction strategy can be used for huge fault trees in order to reduce conversion runtime in BDD generation.
Abstract
It is known that the size of fault tree affects the BDD(Binary Decision Diagram) structure and as the fault tree size decreases, the number of BDD nodes also decreases in general and the BDD generation time is shorter than the other. For two given fault trees which are logically the same each other, the BDD generation time for the smaller fault tree is shorter. Contraction, absorption and extraction rule can be applied for the logically same, but smaller fault tree transformation. As the BDD conversion of fault tree is performed per gate, the aim of fault tree reduction is to reduce the number of gates and to simplify the repeated events. Formulation of fault tree reduction is obtained and three forms of fault tree reduction are recommended before the BDD conversion of fault trees in order to reduce the runtime. The fault tree of an derailment accident is calculated and it is shown that the reduction strategy can be used for huge fault trees in order to reduce conversion runtime in BDD generation.
참고문헌 (8)
- R. Bryant, "Graph-based algorithms for Boolean function manipulation", IEEE Transaction On Computers, C-35(8), pp.677~691 (1986)
- N. Limnios, "Fault Trees", ISTE, UK, 42~44 (2007)
- A. Rauzy, "New algorithms for fault tree analysis", Reliability Engineering System Safety, 40(3), pp.203~211 (1993)
- K. Reay, "Efficient Fault Tree Analysis Using Decision Diagrams", 박사, pp.2003
- K. Reay, "A Fault Tree Analysis Using Binary Decision Diagrams", pp.2~5 (2003), Loughborough University
- F. Somenzi, "CUDD : CU Decision Diagram Package, Release 2.5.0", University of Colorado, 4~39 (2013)
- 조병호, "BDD를 이용한 사고수목 정상사상확률 계산", 한국정보통신학회논문지, 20(3), pp.654~662 (2016), 한국정보통신학회[DOI]
- Wang Ming-yan, "Research on Fault Tree Analysis of Train Derailment in Urban Rail Transit", International Journal of Business and Social Science, 5(8), pp.31~ (2014)