Minset Splitting for Improved Reliability Computation (Q3750484)
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 3987020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minset Splitting for Improved Reliability Computation |
scientific article; zbMATH DE number 3987020 |
Statements
Minset Splitting for Improved Reliability Computation (English)
0 references
1986
0 references
complexity
0 references
bound
0 references
approximation
0 references
minset splitting
0 references
computing system reliability
0 references
coherent sets
0 references
minsets
0 references
min paths
0 references
min cuts
0 references
exact and approximate system reliability
0 references
0.7499573826789856
0 references
0.7390845417976379
0 references
0.7388020753860474
0 references
0.7374686002731323
0 references
Improved algorithms are presented for computing system reliability of coherent sets based on minsets (min paths or min cuts). Split these minsets into subsets so that the union of any k subsets include a minset and that any equals such a union. Then compute the probability that at least the components of k such subsets are functioning (failed). This method results in less complex computation for exact and approximate system reliability than the usual inclusion-exclusion method based on the minsets themselves. The method can be applied to coherent systems with minsets that have the property: they can be reunited from some subsets in a special way. Specific minset splitting leads to a formula without cancelling terms. Because systems with such splitting do not belong to the class of p- graphs, a new subset of coherent structures and a new algorithm is found so that system reliability computation avoids cancelling terms.
0 references