MIRAP, microcomputer reliability analysis program

Technical Report · Sun Jan 01 00:00:00 EST 1989

DOI:https://doi.org/10.2172/6138642· OSTI ID:6138642

Jehee, J. N.T.

A program for a microcomputer is outlined that can determine minimal cut sets from a specified fault tree logic. The speed and memory limitations of the microcomputers on which the program is implemented (Atari ST and IBM) are addressed by reducing the fault tree's size and by storing the cut set data on disk. Extensive well proven fault tree restructuring techniques, such as the identification of sibling events and of independent gate events, reduces the fault tree's size but does not alter its logic. New methods are used for the Boolean reduction of the fault tree logic. Special criteria for combining events in the 'AND' and 'OR' logic avoid the creation of many subsuming cut sets which all would cancel out due to existing cut sets. Figures and tables illustrates these methods. 4 refs., 5 tabs.

• Research Organization: EG and G Idaho, Inc., Idaho Falls, ID (United States)
• DOE Contract Number: AC07-76ID01570
• OSTI ID: 6138642
• Report Number(s): EGG-SSRE-8137; ON: DE89009749
• Resource Relation: Other Information: Portions of this document are illegible in microfiche products
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PERSONAL COMPUTERS
FAULT TREE ANALYSIS
ALGORITHMS
DATA PROCESSING
M CODES
RELIABILITY
COMPUTER CODES
COMPUTERS
DIGITAL COMPUTERS
MATHEMATICAL LOGIC
MICROCOMPUTERS
PROCESSING
SYSTEM FAILURE ANALYSIS
SYSTEMS ANALYSIS
990210* - Supercomputers- (1987-1989)