A New Approach To The d-Mc Problem

Elsevier Sci Ltd
Publication Type:
Journal Article
Reliability Engineering & System Safety, 2002, 77 (2), pp. 201 - 206
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004135OK.pdf142.21 kB
Adobe PDF
Many real-world systems are multi-state systems composed of multi-state components in which the reliability can be computed in terms of the lower bound points of level d, called d-Mincuts (d-MCs). Such systems (electric power, transportation, etc.) may be regarded as flow networks whose arcs have independent, discrete, limited and multi-valued random capacities. In this paper, all MCs are assumed to be known in advance, and we focused on how to verify each d-MC candidate before using d-MCs to calculate the network reliability. The proposed algorithm is more efficient than existing algorithms. The algorithm runs in OðpsmnÞ time, a significant improvement over the previous Oðpsm2Þ time bounds based on max-flow/min-cut, where p and s are the number of MCs and d-MC candidates, respectively. It is simple, intuitive and uses no complex data structures. An example is given to show how all d-MC candidates are found and verified by the proposed algorithm. Then the reliability of this example is computed.
Please use this identifier to cite or link to this item: