Minimal Paths & Cuts of Networks Exposed to Common-Cause Failures

IEEE Transactions on Reliability

Volumn 41, Issue 1, 1992, Pages 76-80

  Nahman, J M ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

Common cause failure; Minimal cut; Minimal path; Network

Indexed keywords

FAILURE ANALYSIS;

COMMON CAUSE FAILURE; MINIMAL CUT; MINIMAL PATH; NETWORK RELIABILITY INDICES; SET THEORY;

ELECTRIC POWER SYSTEMS;

EID: 0026838598     PISSN: 00189529     EISSN: 15581721     Source Type: Journal    
DOI: 10.1109/24.126675     Document Type: Article

References (4)

1. M. O. Locks, “A minimizing algorithm for sum of disjoint products”, IEEE Trans Reliability, vol R-36, 1987 Oct, pp 445-453.
2. J. M. Wilson, “An improved minimizing algorithm for sum of disjoint products”, IEEE Trans Reliability, vol 39, 1990 Apr, pp 42-46.
3. D. R. Shier, D. E. Whited, “Algorithms for generating minimal cuts by inversion”, IEEE Trans Reliability, vol R-34, 1985 Oct, pp 314-319.
4. J. A. Abraham, “An improved method for network reliability”, IEEE Trans Reliability, vol R-28, 1979 Apr, pp 58-61.