DocumentCode
3558584
Title
Bounds on the reliability of binary coherent systems
Author
Beichelt, Frank ; Spross, Lutz
Author_Institution
Dept. of Math., Univ. for Inf. Electron. Mittweida, East Germany
Volume
38
Issue
4
fYear
1989
fDate
10/1/1989 12:00:00 AM
Firstpage
425
Lastpage
427
Abstract
The structure function of a binary coherent system is approximated by using only a few of its minimal path sets and minimal cut sets. These two incomplete structure functions are represented as disjoint sums. The average of each is a lower and upper bound, respectively, for the system reliability. The usefulness of these bounds is demonstrated on example networks
Keywords
reliability theory; binary coherent systems; disjoint sums; lower bound; minimal cut sets; minimal path sets; network reliability; structure function; system reliability; upper bound; Accuracy; Approximation methods; Boolean algebra; Boolean functions; Mathematics; Modems; Reliability theory; Upper bound;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
Conference_Location
10/1/1989 12:00:00 AM
ISSN
0018-9529
Type
jour
DOI
10.1109/24.46455
Filename
46455
Link To Document