Recent Developments in Computing of System-Reliability (Q3707744)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3936900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recent Developments in Computing of System-Reliability |
scientific article; zbMATH DE number 3936900 |
Statements
Recent Developments in Computing of System-Reliability (English)
0 references
1985
0 references
system reliability
0 references
inclusion-exclusion
0 references
sum of disjoint products
0 references
topological reliability
0 references
m-out-of-n system
0 references
0.8382407426834106
0 references
0.806476891040802
0 references
0.7997761964797974
0 references
0.7991102337837219
0 references
The three algorithms, inclusion-exclusion (IE), sum of disjoint products (SDP), and topological reliability (TR), all have the exponential-time property. Experimental results show that with large systems, SDP results in a shorter formula than IE. In the special case of an m-out-of-n system, by ordering the paths so that each path differs from its predecessor by exactly one component, the SDP probability formula has the same number of terms as there are paths, and the formula is derived and solved in polynomial time. Certain proofs are provided for SDP: (a) the inner and outer loops of the Abraham algorithm, (b) counting of computer operations for m-out-of-n systems. The direct relationship between the IE and TR formulas is described. This paper revises the explanation of TR given in the seminal paper by \textit{A. Satyanarayana} and \textit{A. Prabhakar} [ibid. R-27, 82-100 (1978; Zbl 0409.90039)], while retaining their terminology and procedures.
0 references