AN ALGORITHM TO DETERMINE RELIABILITY OF A COMPLEX SYSTEM

被引：74

作者：

JENSEN, PA

BELLMORE, M

机构：

[1] Department of Mechanical Engineering, University of Texas, Austin Tex.

[2] Department of Operations Research and Industrial Engineering, The Johns Hopkins University, Baltimore. Md.

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1969年 / R 18卷 / 04期

关键词：

D O I：

10.1109/TR.1969.5216346

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

The method most often suggested for determining the reliability of a system is to construct a reliability network, enumerate from the network all mutually exclusive working states of the system, calculate the probability of occurrence of each working state, and sum these probabilities. For a complex system this is not a practical method for there is a very large number of working states. Esary and Proschan suggest a lower bound approximation to reliability that requires the enumeration of a much smaller set of system states. These states are called minimal cuts. An algorithm is presented to determine the set of minimal cuts and thus calculate a lower bound to system reliability. The algorithm is intended for digital-computer implementation and computational times are provided. Copyright © 1970 by The Institute of Electrical and Electronics Engineers, Inc.

引用

页码：169 / &

共 10 条

[1]

BARLOW RE, 1965, MATHEMATICAL THEORY, P202

[2]

BELLMORE M, TO BE PUBLISHED

[3]

BELLMORE M, 1965, THESIS JOHNS HOPKINS

[4] COHERENT STRUCTURES OF NON-IDENTICAL COMPONENTS [J].

ESARY, JD ;

PROSCHAN, F .

TECHNOMETRICS, 1963, 5 (02) :191-&

[5]

JENSEN PA, 1967, THESIS JOHNS HOPKINS

[6]

JENSEN PA, 1964, IEEE T REL, VR 13, P23

[7]

MESSINGER M, 1967 P IEEE ANN S RE

[8]

PROSCHAN F, 1962, REDUNDANCY TECHNIQUE, P47

[9]

SHOOMAN LM, 1968, PROBABILISTIC RELIAB, pCH3

[10]

1964, RELIABILITY ENGINEER

← 1 →