Scholarlink

Cut set analysis requires a list of minimal cut sets of the fault tree to be available. Numerous algorithms exist to accomplish this task. The two main classes are based on manipulation of lists of events and methods based on binary decision diagrams (BDD). Other methods exploit, for example, SAT-solving and Monte Carlo simulation.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Computing Minimal Cut Sets

  • 章节

  • 发表日期：

    2026年

查看全文
  • Mariëlle Stoelinga,
  • Enno Ruijters,
  • Pavel Krčál

摘要

Cut set analysis requires a list of minimal cut sets of the fault tree to be available. Numerous algorithms exist to accomplish this task. The two main classes are based on manipulation of lists of events and methods based on binary decision diagrams (BDD). Other methods exploit, for example, SAT-solving and Monte Carlo simulation.