| 摘要 |
<p>The present invention is a minimal cut set calculation system for calculating a minimal cut set of a fault tree comprising a binary decision diagram (BDD), said system having a subtraction means for eliminating from one sub-BDD among two sub-BDDs of the input BDD a redundant path that is included in the other sub-BDD, using a recursive function comprising a recursive portion and a basic portion; and the subtraction means including, in the basic portion, an equivalence-elimination means for outputting a terminal node (O) when the two sub-BDDs are not terminal nodes and are equivalent.</p> |
