ENUMERATION OF MINIMAL PATHS OF MODIFIED NETWORKS

被引:17
作者
NAHMAN, JM
机构
来源
MICROELECTRONICS AND RELIABILITY | 1994年 / 34卷 / 03期
关键词
D O I
10.1016/0026-2714(94)90086-8
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A method is presented for enumeration of minimal paths of networks generated by sequential modifications of an initial network, based upon step wise reformation of minimal paths sets associated with network modifications. The method can be applied for an effective enumeration of minimal paths of various extensions and reinforcements of an existing network in the network reliability analysis for the expansion planning. An illustrative example is included.
引用
收藏
页码:475 / 484
页数:10
相关论文
共 4 条
[1]  
AGGARWAL KK, 1973, MICROELECTRONIC RELI, V22, P4325
[2]   METHOD FOR COMPUTING COMPLEX SYSTEM RELIABILITY [J].
KIM, YH ;
CASE, KE ;
GHARE, PM .
IEEE TRANSACTIONS ON RELIABILITY, 1972, R 21 (04) :215-&
[3]   MINIMAL PATHS AND CUTS OF NETWORKS EXPOSED TO COMMON-CAUSE FAILURES [J].
NAHMAN, JM .
IEEE TRANSACTIONS ON RELIABILITY, 1992, 41 (01) :76-80
[4]  
Samads MA, 1978, MICROELECTRON RELIAB, V27, P443