Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

An ordering heuristic to develop the binary decision diagram based on structural importance

6 references·8 citing·32 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
2002Fault tree analysis and binary decision diagrams90 cited
1997Improved efficiency in qualitative fault tree analysis82 cited
1975MEASURES OF IMPORTANCE OF EVENTS AND CUT SETS IN FAULT TREES.61 cited
2002An ordering heuristic for building binary decision diagrams from fault-trees52 cited

Cited by

2009Pandora : a logic for the qualitative analysis of temporal fault trees42 cited
2011A New Ordering Method of Basic Events in Fault Tree Analysis35 cited
2013A Simple Algebra for Fault Tree Analysis of Static and Dynamic Systems32 cited
2002Application of the cause–consequence diagram method to static systems30 cited
2005New Progressive Variable Ordering for Binary Decision Diagram Analysis of Fault Trees22 cited
2010Optimization of Binary Decision Diagram using Genetic algorithm7 cited
2004Development of an Efficient BDD Algorithm to Solve Large Fault Trees7 cited
2024A new ordering method of basic events in dynamic fault tree for sequential binary decision diagram6 cited

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