Zero-suppressed ternary decision diagram algorithm for solving noncoherent fault trees in probabilistic safety assessment of nuclear power plants
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Probabilistic safety assessment (PSA) plays a critical role in ensuring the safe operation of nuclear power plants. In PSA, event trees are developed to identify accident sequences that could lead to core damage. These event trees are then transformed into a core-damage fault tree, wherein the accident sequences are represented by usual and complemented logic gates representing failed and successful operations of safety systems, respectively. The core damage frequency (CDF) is estimated by calculating the minimal cut sets (MCSs) of the core-damage fault tree. Delete-term approximation (DTA) is commonly employed to approximately solve MCSs representing accident sequence logics from noncoherent core-damage fault trees. However, DTA can lead to an overestimation of CDF, particularly when fault trees contain many nonrare events. To address this issue, the present study introduces a new zero-suppressed ternary decision diagram (ZTDD) algorithm that averts the CDF overestimation caused by DTA. This ZTDD algorithm can optionally calculate MCSs with DTA or prime implicants (PIs) without any approximation from the core-damage fault tree. By calculating PIs, accurate CDF can be calculated. The present study provides a comprehensive explanation of the ZTDD structure, formula of the ZTDD algorithm, ZTDD minimization, probability calculation from ZTDD, strength of the ZTDD algorithm, and ZTDD application results. Results reveal that the ZTDD algorithm is a powerful tool that can quickly and accurately calculate CDF and drastically improve the safety of nuclear power plants.
Abstract
Probabilistic safety assessment (PSA) plays a critical role in ensuring the safe operation of nuclear power plants. In PSA, event trees are developed to identify accident sequences that could lead to core damage. These event trees are then transformed into a core-damage fault tree, wherein the accident sequences are represented by usual and complemented logic gates representing failed and successful operations of safety systems, respectively. The core damage frequency (CDF) is estimated by calculating the minimal cut sets (MCSs) of the core-damage fault tree. Delete-term approximation (DTA) is commonly employed to approximately solve MCSs representing accident sequence logics from noncoherent core-damage fault trees. However, DTA can lead to an overestimation of CDF, particularly when fault trees contain many nonrare events. To address this issue, the present study introduces a new zero-suppressed ternary decision diagram (ZTDD) algorithm that averts the CDF overestimation caused by DTA. This ZTDD algorithm can optionally calculate MCSs with DTA or prime implicants (PIs) without any approximation from the core-damage fault tree. By calculating PIs, accurate CDF can be calculated. The present study provides a comprehensive explanation of the ZTDD structure, formula of the ZTDD algorithm, ZTDD minimization, probability calculation from ZTDD, strength of the ZTDD algorithm, and ZTDD application results. Results reveal that the ZTDD algorithm is a powerful tool that can quickly and accurately calculate CDF and drastically improve the safety of nuclear power plants.
참고문헌 (20)
- Fault Tree Handbook, "W. E. Vesely", U.S. Nuclear Regulatory Commission, ~, pp.NUREG-0492 (1981)
- S. Minato, "Zero-suppressed BDDs for set manipulation in combinatorial problems", Proceedings of the 30th International Conference on Design Automation, pp.272~277 (1993)
- W. S. Jung, "A fast BDD algorithm for the reliability analysis of large coherent systems", Reliab. Eng. Syst. Saf, 83, pp.369~374 (2004)
- W. S. Jung, "ZBDD algorithm features for an efficient probabilistic safety assessment", Nucl. Eng. Des, 239, pp.2085~2092 (2009)
- C. Y. Lee, "Representation of switching circuits by binary-decision programs", Bell System Technical Journal, 38, pp.985~999 (1959)
- B. Akers, "Binary decision diagrams", IEEE Trans. Comput. C, 27(6), pp.509~516 (1978)
- R. Bryant, "Graph-based algorithms for Boolean function manipulation", IEEE Trans. Comput. C, 35(8), pp.677~691 (1986)
- R. Bryant, "Symbolic Boolean manipulation with ordered binary decision diagrams", ACM Comput. Surv, 24, pp.293~318 (1992)
- A. Rauzy, "New algorithms for fault trees analysis", Reliab. Eng. Syst. Saf, 5(59), pp.203~211 (1993)
- Y. Duituit, "Efficient algorithms to assess component and gate importance in fault tree analysis", Reliab. Eng. Syst. Saf, 72, pp.213~222 (2001)
- A. Rauzy, "Handbook of Performability Engineering", pp.381~396 (2008), Elsevier
- R. Remenyte-Prescott, "An enhanced component connection method BDD", Reliab. Eng. Syst. Saf, 93, pp.1543~1550 (2008)
- O. Nusbaumer, "Fault tree linking versus event tree linking approaches-a reasoned comparison", Journal of Risk and Reliability, 227, pp.315~326 (2013)
- A. Rauzy, "Decision diagram algorithms to extract minimal cutsets of finite degradation models", Information, 10, pp.368~ (2019)
- W. S. Jung, "Fast BDD truncation method for efficient top event probability calculation", Nucl. Eng. Technol, 40(7), pp.571~580 (2008)
- T. Luo, "An improved algorithm for coherent-system reliability", IEEE Trans. Reliab, 47, pp.73~78 (1998)
- T. Sasao, "Representations of Discrete Functions", pp.269~292 (1996)
- T. Sasao, "Arithmetic ternary decision diagrams applications and complexity", Proceedings of the Fourth International Workshop on Applications of the Reed-Muller Expansion in Circuit Design (1999)
- R. Remenyte-Prescott, "Analysis of non-coherent fault trees using ternary decision diagrams", Proc. Inst. Mech. Eng. O J. Risk Reliab, 222(2) (2008)
- W.S. Jung, "A new zero-suppressed ternary decision diagram algorithm", Probabilistic Safety Assessment and Management (PSAM) Topical, Virtual meeting (2023)