Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

BDD algorithms based on modularization for fault tree analysis

8 references·7 citing·24 second hop

FromToDepth

this work references cited by second hop

References

1993New algorithms for fault trees analysis472 cited
1970A time-dependent methodology for fault tree evaluation285 cited
1996A linear-time algorithm to find modules of fault trees159 cited
2002A fault tree analysis strategy using binary decision diagrams133 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
1989Finding modules in fault trees55 cited
2007An enhanced component connection method for conversion of fault trees to binary decision diagrams37 cited

Cited by

2017Optimal decision-making via binary decision diagrams for investments under a risky environment69 cited
2022Spare parts control strategies for offshore wind farms: A critical review and comparative study26 cited
2018Reliability analysis by mapping probabilistic importance factors into bayesian belief networks for making decision in water deluge system24 cited
2020Reliability analysis of dynamic fault trees with spare gates using conditional binary decision diagrams22 cited
2019An Efficient Algorithm for Finding Modules in Fault Trees18 cited
2018Advanced combinatorial method for solving complex fault trees

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

12 cited

2018A comparison of fault trees and the Dynamic Flowgraph Methodology for the analysis of FPGA-based safety systems part 2: Theoretical investigations12 cited