SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Analysis of non-coherent fault trees using ternary decision diagrams
10 references·2 citing·25 second hop
Analysis of non-coherent fault trees using ternary decision diagrams (2008)Analysis of non-coherent fault trees usin…Choosing a heuristic for the "fault tree to binary decision diagram" conversion, using neural networks (2002)Choosing a heuristic for the …The use of not logic in fault tree analysis (2001)The use of not logic in fault…Mathematical foundations of minimal cutsets (2001)Mathematical foundations of m…Comparison of two new approaches to variable ordering for binary decision diagrams (2001)Comparison of two new approac…Improved efficiency in qualitative fault tree analysis (1997)Improved efficiency in qualit…Improved accuracy in quantitative fault tree analysis (1997)Improved accuracy in quantita…Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia (1997)Exact and truncated computati…A linear-time algorithm to find modules of fault trees (1996)A linear-time algorithm to fi…New algorithms for fault trees analysis (1993)New algorithms for fault tree…A time-dependent methodology for fault tree evaluation (1970)A time-dependent methodology …Quantum fault trees and minimal cut sets identification (2025)Quantum fault trees and minim…SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets (2020)SATMCS: An Efficient SAT-Base…Fault Tree Analysis, Methods, and Applications ߝ A Review (1985)A fast BDD algorithm for large coherent fault trees analysis (2003)Minimal cut set/sequence generation for dynamic fault trees (2004)Reliability and Risk Assessment (1994)Joint Failure Importance for Noncoherent Fault Trees (2007)On the use of non-coherent fault trees in safety and security studies (2008)Coherence region of the Priority‐AND gate: Analytical and numerical examples (2017)New approaches to evaluating fault trees (1997)An efficient real‐time method of analysis for non‐coherent fault trees (2008)Fault tree analysis and binary decision diagrams (2002)A New Ordering Method of Basic Events in Fault Tree Analysis (2011)A Simple Algebra for Fault Tree Analysis of Static and Dynamic Systems (2013)Fault Tree Analysis Including Component Dependencies (2023)A fault tree analysis strategy using binary decision diagrams (2002)A new approach to solve dynamic fault trees (2003)Probabilistic Algebraic Analysis of Fault Trees With Priority Dynamic Gates and Repeated Events (2010)An ordering heuristic to develop the binary decision diagram based on structural importance (2001)An efficient phased mission reliability analysis for autonomous vehicles (2009)Dynamic and dependent tree theory (D2T2): A framework for the analysis of fault trees with dependent basic events (2022)Techniques and methodologies for risk analysis in chemical process industries (1998)Event-tree analysis using binary decision diagrams (2000)A new formalism that combines advantages of fault-trees and Markov models: Boolean logic driven Markov processes (2003)Binary Decision Diagrams for Reliability Studies (2008)Fault Tree Analysis (2008)Can we trust PRA? (2004)
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
  • 1997Exact and truncated computations of prime implicants of coherent and non-coherent fault trees within Aralia126 cited
  • 2001Mathematical foundations of minimal cutsets121 cited
  • 1997Improved efficiency in qualitative fault tree analysis82 cited
  • 1997Improved accuracy in quantitative fault tree analysis79 cited
  • 2002Choosing a heuristic for the "fault tree to binary decision diagram" conversion, using neural networks47 cited
  • 2001The use of not logic in fault tree analysis41 cited
  • 2001Comparison of two new approaches to variable ordering for binary decision diagrams21 cited

Cited by

  • 2025Quantum fault trees and minimal cut sets identification14 cited
  • 2020SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets9 cited

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