A Novel Cut-Based Universal Generating Function Method

A multistate information network (MIN) is a generalization of the tree-structured multistate-state system that does not satisfy the flow conservation law. The current known universal generating function methods (UGFMs, here called pUGFMs) used to evaluate acyclic MIN (AMIN) reliability are based on the connectedness between node 1 and the targets, i.e. find all possible paths between node 1 and the targets. A novel cut-based UGFM (cUGFM) is proposed for the AMIN reliability problem. The proposed cUGFM is based on the disconnectedness between node 1 and the targets, i.e. find all possible cuts between node 1 and the targets. It provides a flexible, novel method to calculate reliability and unreliability. The computational complexity of the proposed algorithm is also analyzed and compared with the best-known existing methods. Finally, three benchmark examples are given to illustrate how the exact one-to-all-target-subset AMIN reliability is calculated using the proposed cUGFM.

[1]  Gregory Levitin A Universal Generating Function in the Analysis of Multi-state Systems , 2008 .

[2]  Wei-Chang Yeh,et al.  A Simple Universal Generating Function Method to Search for All Minimal Paths in Networks , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[3]  Terje Aven,et al.  Availability evaluation of oil/gas production and transportation systems , 1987 .

[4]  Wei-Chang Yeh,et al.  A simple universal generating function method for estimating the reliability of general multi-state node networks , 2008 .

[5]  Wei-Chang Yeh A Convolution Universal Generating Function Method for Evaluating the Symbolic One-to-All-Target-Subset Reliability Function of Acyclic Multi-State Information Networks , 2009, IEEE Transactions on Reliability.

[6]  Gregory Levitin,et al.  Survivability maximization for vulnerable multi-state systems with bridge topology , 2000, Reliab. Eng. Syst. Saf..

[7]  Xiangjian He,et al.  A New Universal Generating Function Method for Estimating the Novel Multiresource Multistate Information Network Reliability , 2010, IEEE Transactions on Reliability.

[8]  Gregory Levitin,et al.  A new approach to solving problems of multi‐state system reliability optimization , 2001 .

[9]  Gregory Levitin,et al.  Element maintenance and allocation for linear consecutively connected systems , 2012 .

[10]  Kailash C. Kapur,et al.  Reliability Bounds for Multistate Systems with Multistate Components , 1985, Oper. Res..

[11]  Hoang Pham Guest Editorial Special Issue on Critical Reliability Challenges and Practices , 2007 .

[12]  Wei-Chang Yeh The Extension of Universal Generating Function Method to Search for All One-to-Many $d$ -Minimal Paths of Acyclic Multi-State-Arc Flow-Conservation Networks , 2008, IEEE Transactions on Reliability.

[13]  Wei-Chang Yeh,et al.  A Novel Label Universal Generating Function Method for Evaluating the One-to-all-Subsets General Multistate Information Network Reliability , 2011, IEEE Transactions on Reliability.

[14]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[15]  Gregory Levitin,et al.  Linear Multistate Consecutively-Connected Systems With Gap Constraints , 2012, IEEE Transactions on Reliability.

[16]  Hoang Pham Special Issue on Critical Reliability Challenges and Practices [Guest Editorial] , 2007, IEEE Trans. Syst. Man Cybern. Part A.

[17]  Gregory Levitin,et al.  The Universal Generating Function in Reliability Analysis and Optimization , 2005 .

[18]  Gregory Levitin,et al.  Reliability evaluation for acyclic consecutively connected networks with multistate elements , 2001, Reliab. Eng. Syst. Saf..