Abstract: | This paper describes some fault tree optimization algorithms used in STUK PSA code SPSA that is capable of generating minimal cut sets for fault trees containing 12 000 gates and basic events. The complexity of a minimal cut set search is a function of multiple gates and basic events. In a fault tree containing 1000 multiple elements, these optimizations reduce the number of multiple elements often by 30 to 50%. One novel feature of the algorithm is that no boolean reduction rules are used, since the fault tree itself contains its simplification rules. |