A Simple Algorithm To Search For All D-Mps With Unreliable Nodes

Publisher:
Elsevier Sci Ltd
Publication Type:
Journal Article
Citation:
Reliability Engineering & System Safety, 2001, 73 (1), pp. 49 - 54
Issue Date:
2001-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010004139OK.pdf103.4 kB
Adobe PDF
Many real-world systems are multistate systems composed of multistate components in which the reliability can be computed in terms of the lower bound points of level d, by formulating in terms of either the d-minimal paths (d-MPs) or d-minimal cutsets (d
Please use this identifier to cite or link to this item: