NESC0653 MOCUS
MOCUS, Minimal Cut Sets and Minimal Path Sets from Fault Tree Analysis
NAME OR DESIGNATION OF PROGRAM, COMPUTER, DESCRIPTION OF PROBLEM OR FUNCTION, METHOD OF SOLUTION, RESTRICTIONS ON THE COMPLEXITY OF THE PROBLEM, TYPICAL RUNNING TIME, UNUSUAL FEATURES OF THE PROGRAM, RELATED AND AUXILIARY PROGRAMS, STATUS, REFERENCES, MACHINE REQUIREMENTS, LANGUAGE, OPERATING SYSTEM UNDER WHICH PROGRAM IS EXECUTED, OTHER PROGRAMMING OR OPERATING INFORMATION OR RESTRICTIONS, NAME AND ESTABLISHMENT OF AUTHORS, MATERIAL, CATEGORIES
[ top ]
[ top ]
To submit a request, click below on the link of the version you wish to order.
Only liaison officers are authorised to submit online requests. Rules for requesters are
available here.
| Program name | Package id | Status | Status date |
|---|---|---|---|
| MOCUS | NESC0653/01 | Tested | 01-DEC-1976 |
Machines used:
| Package ID | Orig. computer | Test computer |
|---|---|---|
| NESC0653/01 | IBM 370 series | IBM 370 series |
[ top ]
3. DESCRIPTION OF PROBLEM OR FUNCTION
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.
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.
[ top ]
4. METHOD OF SOLUTION
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.
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.
[ top ]
[ top ]
[ top ]
[ top ]
[ top ]
10. REFERENCES
- W.E. Vesely and R.E. Narum,
PREP and KITT: Computer Codes for the Automatic Evaluation of a
Fault Tree
IN-1349, August 1970.
- J.B. Fussell,
Synthetic Tree Model--A Formal Methodology for Fault Tree
Construction
ANCR-1098, March 1973.
- W.E. Vesely and R.E. Narum,
PREP and KITT: Computer Codes for the Automatic Evaluation of a
Fault Tree
IN-1349, August 1970.
- J.B. Fussell,
Synthetic Tree Model--A Formal Methodology for Fault Tree
Construction
ANCR-1098, March 1973.
NESC0653/01, included references:
- J.B. Fussell, E.B. Henry and N.H. Marshall:MOCUS - A Computer Program to Obtain Minimal Sets from Fault Trees
ANCR-1156 (August 1974)
[ top ]
[ top ]
[ top ]
[ top ]
[ top ]
NESC0653/01
| File name | File description | Records |
|---|---|---|
| NESC0653_01.001 | PROGRAM SOURCE - FORTRAN IV | 1739 |
| NESC0653_01.002 | SAMPLE PROBLEM DATA | 20 |
| NESC0653_01.003 | SAMPLE PROBLEM OUTPUT LIST | 19 |
| NESC0653_01.004 | SAMPLE PROBLEM OUTPUT CARDS | 169 |
| NESC0653_01.005 | JCL | 18 |
[ top ]
- G. Radiological Safety, Hazard and Accident Analysis
- P. General Mathematical and Computing System Routines
Keywords: fault tree analysis, reliability, system failure analysis.