Cutset Analysis of Networks Using Basic Minimal Paths and Network Decomposition

The concept of basic minimal paths has been introduced, and its use in deducing the node cutsets of a network was described. This 3 paper deals with two important aspects of basic minimal paths: 1) the deduction of link cutsets from node cutsets, and 2) reduction of computational requirements in deducing the basic minimal paths using network decomposition.

[1]  H. Nakazawa.  Equivalence of a Nonoriented Line and a Pair of Oriented Lines in a Network , 1979, IEEE Transactions on Reliability.

[2]  Frank A. Tillman,et al.  System-Reliability Evaluation Techniques for Complex/Large SystemsߞA Review , 1981, IEEE Transactions on Reliability.

[3]  A. Refsum,et al.  RESIN, A Desktop-Computer Program for Finding Cut-Sets , 1981, IEEE Transactions on Reliability.

[4]  S. Rai,et al.  An Efficient Method for Reliability Evaluation of a General Network , 1978, IEEE Transactions on Reliability.

[5]  R. Billinton,et al.  An Efficient Algorithm for Deducing the Minimal Cuts and Reliability Indices of a General Network Configuration , 1976, IEEE Transactions on Reliability.

[6]  Suresh Rai.  AnEfficient MethodforReliability Evaluation ofaGeneral Network , 1978 .

[7]  Jack S. K. Chang,et al.  Cut-Set Intersections and Node Partitions , 1984 .

[8]  G. B. Jasmon,et al.  A New Technique in Minimal Path and Cutset Evaluation , 1985, IEEE Transactions on Reliability.

[9]  Jane N. Hagstrom.  Using the Decomposition-Tree of a Network in Reliability Computation , 1983, IEEE Transactions on Reliability.

[10]  Y.C. Chopra,et al.  Reliability Evaluation by Network Decomposition , 1982, IEEE Transactions on Reliability.

[11]  Hayao Nakazawa.  Bayesian Decomposition Method for Computing the Reliability of an Oriented Network , 1976, IEEE Transactions on Reliability.

[12]  S. Arunkumar,et al.  Enumeration of All Minimal Cut-Sets for a Node Pair in a Graph , 1979, IEEE Transactions on Reliability.