A note on “A simple approach to search for all d-MCs of a limited-flow networkâ€

H. Salehi Fathabadi and M. Forghani-elahabadi

Reliability Engineering and System Safety, 2009, vol. 94, issue 11, 1878-1880

Abstract: 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 considered as network flows whose arcs have independent and discrete random capacities. In this comment, we investigate the algorithm proposed by Yeh [A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering and System Safety 2001;71(1):15–19]. We show that the algorithm misses some real d-MCs, and then pinpoint the algorithm's failure and suggest the correcting point.

Keywords: Reliability; Limited-flow network; d-MC (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0951832009001161
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:94:y:2009:i:11:p:1878-1880

DOI: 10.1016/j.ress.2009.05.016

Access Statistics for this article

Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares

More articles in Reliability Engineering and System Safety from Elsevier
Bibliographic data for series maintained by Catherine Liu ().