Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Advanced combinatorial method for solving complex fault trees

13 references·1 citing·23 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
2000Event-tree analysis using binary decision diagrams248 cited
1996A linear-time algorithm to find modules of fault trees159 cited
2001Mathematical foundations of minimal cutsets121 cited
2003A practical comparison of methods to assess sum-of-products59 cited
2010Analysis of large fault trees based on functional decomposition42 cited
2007An enhanced component connection method for conversion of fault trees to binary decision diagrams37 cited
2015BDD algorithms based on modularization for fault tree analysis35 cited
2008FAST BDD TRUNCATION METHOD FOR EFFICIENT TOP EVENT PROBABILITY CALCULATION24 cited
2010A reduction approach to improve the quantification of linked fault trees through binary decision diagrams23 cited
2016Fault-tree-based instantaneous risk computing core in nuclear power plant risk monitor23 cited
2015Dynamic labelling of BDD and ZBDD for efficient non-coherent fault tree analysis20 cited

Cited by

2023Integration frameworks and intelligent research in dynamic fault tree: A comprehensive review and future perspectives11 cited

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