Accession Number : ADA323330

Title :   Boolean Algebraic Methods for Phased-Mission System Analysis.

Descriptive Note : Contractor rept.,

Corporate Author : INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA

Personal Author(s) : Somani, Arun K. ; Trivedi, Kishor S.

PDF Url : ADA323330

Report Date : JAN 1997

Pagination or Media Count : 22

Abstract : Most reliability analysis techniques and tools assume that a system is used for a mission consisting of a single phase. However, multiple phases are natural in many missions. The failure rates of components, system configuration, and success (failure) criteria may vary from phase to phase. In addition, the duration of a phase may be deterministic or random. We describe a new technique for phased-mission system reliability analysis based on Boolean algebraic methods. Our technique is computationally efficient and is applicable to a large class of systems for which the failure criterion in each phase can be expressed as a fault tree (or an equivalent representation). Our technique avoids state space explosion that commonly plague Markov chain-based analysis. We develop a phase algebra to account for the effects of variable configurations and failure criteria from phase to phase. Our technique yields exact (as opposed to approximate) results. We demonstrate the use our technique by means of an example and present numerical results to show the effects of mission phases on the system reliability.

Descriptors :   *SYSTEMS ENGINEERING, *SYSTEMS ANALYSIS, *BOOLEAN ALGEBRA, PROBABILITY DISTRIBUTION FUNCTIONS, FAULT TREES, APPLIED MATHEMATICS, FAULT TOLERANCE, COMPUTER PROGRAM RELIABILITY.

Subject Categories : Computer Programming and Software
      Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE