The PREP/KITT computer program package obtains system reliability information from a system fault tree. The PREP program finds the minimal cut sets and/or the minimal path sets of the system fault tree. (A minimal cut set is a smallest set of components such that if all the components are simultaneously failed the system is failed. A minimal path set is a smallest set of components such that if all of the components are simultaneously functioning the system is functioning.) The KITT programs determine reliability information for the components of each minimal cut or path set, for each minimal cut or path set, and for the system. Exact, time-dependent reliability information is determined for each component and for each minimal cut set or path set. For the system, reliability results are obtained by upper bound approximations or by a bracketing procedure in which various upper and lower bounds may be obtained as close to one another as desired. The KITT programs can handle independent components which are nonrepairable or which have a constant repair time. Any assortment of nonrepairable components and components having constant repair times can be considered. Any inhibit conditions having constant probabilities of occurrence can be handled. The failure intensity of each component is assumed to be constant with respect to time. The KITT2 program can also handle components which during different time intervals, called phases, may have different reliability properties.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Ruijters, Enno; Stoelinga, Mariëlle: Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools (2015)
- Kuznetsov, N. Yu.: Fault trees -- problems and the modern state of investigations (1994)
- Kokawa, Masasumi; Shingai, Sadanori: Failure propagating simulation and nonfailure paths search in network systems (1982)
- Rasmuson, D. M.; Marshall, N. H.: FATRAM - a core efficient cut-set algorithm (1978)