Minimum cut set evaluation system, minimum cut set calculation method, and program

A minimum cut set calculation system for calculating minimum cut sets of a fault tree with binary decision diagram (BDD), comprising:

• minimizing means configured to calculate a minimum cut set of a fault tree comprised of a BDD using a recursive function comprised of a recursive case and a base case, wherein
• said minimizing means performs a calculation of said recursive case after redundant paths in a sub-BDD of said BDD have been removed.

A minimum cut set calculation method for calculating minimum cut sets of a fault tree with binary decision diagram (BDD), comprising:

• subtracting processing of, from one of two sub-BDDs of an input BDD, removing redundant paths included in the other sub-BDD using a recursive function comprised of a recursive case and a base case, wherein
• said subtracting processing comprises equivalence removing processing of outputting a terminal node 0 (false) when said two sub-BDDs are equivalent in said base case.

A minimum cut set calculation method for calculating a minimum cut set of a fault tree comprised of a binary decision diagram (BDD), comprising:

• minimizing processing of calculating minimum cut sets of a fault tree with BDD using a recursive function comprised of a recursive case and a base case, wherein
• said minimizing processing performs a calculation of said recursive case after redundant paths in a sub-BDD of said BDD have been removed.

A non-transitory computer readable storage medium storing a minimum cut set calculation program for calculating minimum cut sets of a fault tree with binary decision diagram (BDD), said minimum cut set calculation program causing a computer to execute:

• subtracting processing of, from one of two sub-BDDs of an input BDD, removing redundant paths included in the other sub-BDD using a recursive function comprised of a recursive case and a base case, wherein
• said subtracting processing comprises equivalence removing processing of outputting a terminal node 0 (false) when said two sub-BDDs are not terminal nodes and are equivalent in said base case.

A non-transitory computer readable storage medium storing a minimum cut set calculation program for calculating minimum cut sets of a fault tree with binary decision diagram (BDD), said minimum cut set calculation program causing a computer to execute:

• minimizing processing of calculating a minimum cut set of a fault tree comprised of a BDD using a recursive function comprised of a recursive case and a base case, wherein
• said minimizing processing performs a calculation of said recursive case after redundant paths in a sub-BDD of said BDD have been removed.