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

Elsevier Sci Ltd
Publication Type:
Journal Article
Reliability Engineering & System Safety, 2001, 73 (1), pp. 49 - 54
Issue Date:
Filename Description Size
Thumbnail2010004139OK.pdf103.4 kB
Adobe PDF
Full metadata record
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: