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
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
2010004139OK.pdf | 103.4 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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: