Fault trees considered thus far, featuring AND-, OR- and VOTING-gates are coherentCoherent fault tree. This means that, whenever the system has failed, additional occurrences of any basic event will never result in a state where the system resumes functioning. In terms of cut sets: if we add more basic events to a cut set, the new set remains a cut set. This coherence property might not hold if we use negated gates, which include the NOT-gate and NOT-based gates such as the NAND, NOR, and XOR-gate, see Fig. 15.1.

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

Non-coherent Fault Trees

  • Mariëlle Stoelinga,
  • Enno Ruijters,
  • Pavel Krčál

摘要

Fault trees considered thus far, featuring AND-, OR- and VOTING-gates are coherentCoherent fault tree. This means that, whenever the system has failed, additional occurrences of any basic event will never result in a state where the system resumes functioning. In terms of cut sets: if we add more basic events to a cut set, the new set remains a cut set. This coherence property might not hold if we use negated gates, which include the NOT-gate and NOT-based gates such as the NAND, NOR, and XOR-gate, see Fig. 15.1.