FATRAM-A Core Efficient Cut-Set Algorithm

摘要

Many algorithms have been developed for determining minimal cut sets for logic models (in particular, fault trees). Although these methods are theoretically correct, computer implementation of these algorithms proves them less efficient than is desirable. This paper presents a new method for determining the minimal cut sets, which makes more efficient use of computer memory. The gates are resolved in a deterministic manner according to the following rules: 1) AND gates and OR gates with gate inputs are resolved; and 2) OR gates with only basic event inputs are resolved last. Other computer techniques provide increased efficiency for implementing this method. The FATRAM algorithm for finding minimal cut sets for fault trees does use computer core memory effectively. The use of stacks (last-in first-out arrays) for the AND and OR gates has also increased the efficiency of the program. The use of dynamic storage makes the program more flexible.