A new algorithm for reliability evaluation of three-state device complex networks: Minimal cut-minimal path method

1994 ◽  
Vol 34 (9) ◽  
pp. 1537-1540
Author(s):  
Li Dong-Kui ◽  
Chi Hang-Zhong
Author(s):  
Paul Hernandez-Herrera ◽  
Fernando Montoya ◽  
Juan M. Rendón ◽  
Alberto Darszon ◽  
Gabriel Corkidi

2018 ◽  
Vol 180 ◽  
pp. 226-236 ◽  
Author(s):  
Alfonsus Julanto Endharta ◽  
Won Young Yun ◽  
Young Myoung Ko

Author(s):  
E Zio ◽  
M Librizzi ◽  
G Sansavini

In the present work, cellular automata are combined with Monte Carlo sampling to solve two critical problems related to the unreliability assessment of complex networks composed of nodes interconnected by binary arcs: the identification of the minimal cut sets of the network and the computation of the Fussell—Vesely importance measures assessing the criticality of each arc with respect to the network unreliability. The effectiveness of the method is tested on two literature case studies.


2007 ◽  
Vol 39 (8) ◽  
pp. 811-817 ◽  
Author(s):  
Ming J. Zuo ◽  
Zhigang Tian ◽  
Hong-Zhong Huang

1998 ◽  
Vol 35 (01) ◽  
pp. 104-114
Author(s):  
M. Xie ◽  
C. D. Lai

In this paper we study an approximation of system reliability using one-step conditioning. It is shown that, without greatly increasing the computational complexity, the conditional method may be used instead of the usual minimal cut and minimal path bounds to obtain more accurate approximations and bounds. We also study the conditions under which the approximations are bounds on the reliability. Some further extensions are also presented.


Sign in / Sign up

Export Citation Format

Share Document