MOCUS: a computer program to obtain minimal sets from fault trees. From a description of the Boolean failure logic of a system, called a fault tree, and control parameters specifying the minimal cut set length to be obtained MOCUS determines the system failure modes, or minimal cut sets, and the system success modes, or minimal path sets. MOCUS uses direct resolution of the fault tree into the cut and path sets. The algorithm used starts with the main failure of interest, the top event, and proceeds to basic independent component failures, called primary events, to resolve the fault tree to obtain the minimal sets. A key point of the algorithm is that an and gate alone always increases the number of path sets; an or gate alone always increases the number of cut sets and increases the size of path sets. Other types of logic gates must be described in terms of and and or logic gates.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Ruijters, Enno; Stoelinga, Mariëlle: Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools (2015)
- Makajić-Nikolić, Dragana; Vujošević, Mirko; Nikolić, Nebojša: Minimal cut sets of a coherent fault tree generation using reverse Petri nets (2013)
- Samanta, Bimal; Sarkar, Bijan: Application of Petri nets for systems modelling and analysis (2012) ioport
- Kumamoto, Hiromitsu: Satisfying safety goals by probabilistic risk assessment. (2007)
- Xie, M.; Tan, K.C.; Goh, K.H.: Fault tree reduction for reliability analysis and improvement (1998)
- Kuznetsov, N.Yu.: Fault trees -- problems and the modern state of investigations (1994)
- Wheeler, Dean B.; Hsuan, Jason S.; Duersch, Ralph R.; Roe, Glenn M.: Fault tree analysis using bit manipulation (1977)