BDD algorithms based on modularization for fault tree analysis
Authors:
- Yunli DengYDYunli Deng
- He WangHWHe Wang
- Biao GuoBGBiao Guo
- 1 November 2015
- journal article
- Published by Elsevier in Progress in Nuclear Energy
- Vol. 85, 192-199
Abstract
No abstract availableKeywords
Funding Information
- Harbin Engineering University
- Nuclear Power Plant Living-PSA (2014ZX06004-003)
- National Science and Technology Major Project of China (2012AA050904)
- National High-tech R&D Program
This publication has 11 references indexed in Scilit:
- FAST BDD TRUNCATION METHOD FOR EFFICIENT TOP EVENT PROBABILITY CALCULATIONNuclear Engineering and Technology, 2008
- An enhanced component connection method for conversion of fault trees to binary decision diagramsReliability Engineering & System Safety, 2008
- A fast BDD algorithm for large coherent fault trees analysisReliability Engineering & System Safety, 2004
- A fault tree analysis strategy using binary decision diagramsReliability Engineering & System Safety, 2002
- A fast method of finding minimal cutsets in a risk monitorReliability Engineering & System Safety, 1998
- Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within AraliaReliability Engineering & System Safety, 1997
- A linear-time algorithm to find modules of fault treesIEEE Transactions on Reliability, 1996
- New algorithms for fault trees analysisReliability Engineering & System Safety, 1993
- Finding modules in fault treesIEEE Transactions on Reliability, 1989
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986