Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

FAST BDD TRUNCATION METHOD FOR EFFICIENT TOP EVENT PROBABILITY CALCULATION

7 references·8 citing·33 second hop

FromToDepth

this work references cited by second hop

References

1993New algorithms for fault trees analysis472 cited
1997Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia126 cited
2003A fast BDD algorithm for large coherent fault trees analysis115 cited
2001Efficient algorithms to assess component and gate importance in fault tree analysis81 cited
2004Can we trust PRA?78 cited
1993Fault Tree Analysis: 1020 Prime Implicants and Beyond71 cited
2003A new method to evaluate alternate AC power source effects in multi-unit nuclear power plants35 cited

Cited by

2010A reduction approach to improve the quantification of linked fault trees through binary decision diagrams23 cited
2014A method to improve cutset probability calculation in probabilistic safety assessment of nuclear power plants22 cited
2009ZBDD algorithm features for an efficient Probabilistic Safety Assessment22 cited
2012Solving dynamic flowgraph methodology models using binary decision diagrams21 cited
2015Dynamic labelling of BDD and ZBDD for efficient non-coherent fault tree analysis20 cited
2018Advanced combinatorial method for solving complex fault trees12 cited
2020SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

9 cited

2022Insights gained from applying negate-down during quantification for seismic probabilistic safety assessment9 cited