A program package for the evaluation of fault trees and networks is described. The package, written in standard Fortran, is primarily designed for use on a minicomputer. Special efforts were therefore made to minimize storage space requirements. The package contains programs for checking the fault tree input data for logical consistency and for providing various graphical representations of the tree. Furthermore, it contains programs for calculating minimal cut/path sets of the tree. A new technique automatically prunes the fault tree before the minimal set calculation. This pruning has in practice proved to considerably reduce computer time and storage space requirements. The probability program calculates the availability of the system at various time points from the minimal sets and from failure and repair data for the components. The network program finds all path sets in a directed or undirected network where both links and nodes may fail. The path sets represent the structure function of the network. The minimal cut sets are found by subjecting the structure function to the minimal set programs. The terminal availabilities can be calculated by using the probability program.
|Place of Publication||Roskilde, Denmark|
|Publisher||Risø National Laboratory|
|Number of pages||49|
|Publication status||Published - 1976|
|Series||Denmark. Forskningscenter Risoe. Risoe-R|
- Risø report 348