Transformation from availability expression to failure frequency expression

The problem of computing the system's Failure Frequency is reduced to the problem of computing its Availability. This is performed by a transformation operator. However, the existing transformation operator is not practical because its transformation time increases exponentially with system size. To overcome this difficulty, this paper proposes a new method of transforming the Availability expression of a system into the corresponding Failure Frequency expression of the system. This method is based on a matrix approach using a 2 /spl times/ 2 matrix consisting of 0, Availability, and Failure Frequency in an appropriate manner. This transformation also enables algorithms for computing the Availability of a system to be transformed into algorithms for computing its Failure Frequency by replacing parameters and operations with matrix parameters and operations. The computation time after transformation is linear with respect to the original Availability algorithm. This implies that the problems of computing other well-known reliability measures including, Availability, Unavailability, MTBF, MTTR, MCT, Failure Rate, Failure Rate, and Failure Frequency, are reduced to only the Availability computation problem.

[1]  D. Shi.  General Formulas for Calculating the Steady-State Frequency of System Failure , 1981, IEEE Transactions on Reliability.

[2]  Klaus D. Heidtmann,et al.  Smaller sums of disjoint products by subproduct inversion , 1989 .

[3]  C. Singh,et al.  Rules for Calculating the Time-Specific Frequency of System Failure , 1981, IEEE Transactions on Reliability.

[4]  Lavon B. Page,et al.  A practical implementation of the factoring theorem for network reliability , 1988 .

[5]  Chanan Singh.  Tie set approach to determine the frequency of system failure , 1975 .

[6]  J. Abraham.  An Improved Algorithm for Network Reliability , 1979, IEEE Transactions on Reliability.

[7]  U. Montanari,et al.  A Boolean algebra method for computing the terminal reliability in a communication network , 1973 .

[8]  Mark K. Chang,et al.  Network reliability and the factoring theorem , 1983, Networks.

[9]  J.P. Gadani,et al.  A Heuristic Algorithm for System Failure Frequency , 1981, IEEE Transactions on Reliability.

[10]  John A. Buzacott.  Network Approaches to Finding the Reliability of Repairable Systems , 1970 .

[11]  M. Hayashi.  System failure-frequency analysis using a differential operator , 1991 .

[12]  W. Schneeweiss,et al.  Computing Failure Frequency, MTBF & MTTR via Mixed Products of Availabilities and Unavailabilities , 1981, IEEE Transactions on Reliability.

[13]  Suprasad V. Amari.  Generic rules to evaluate system-failure frequency , 2000, IEEE Trans. Reliab..

[14]  Appajosyula Satyanarayana,et al.  A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks , 1985, SIAM J. Comput..

[15]  J.P. Gadani,et al.  System Effectiveness Evaluation Using Star and Delta Transformations , 1981, IEEE Transactions on Reliability.

[16]  J. Carlier,et al.  Factoring and reductions for networks with imperfect vertices , 1991 .

[17]  P. Tittmann,et al.  A generalized reduction method for the connectedness probability of stochastic networks , 1991 .

[18]  Suprasad V. Amari.  Addendum to: generic rules to evaluate system-failure frequency , 2002, IEEE Trans. Reliab..

[19]  K. Rajamani,et al.  Closed Form Solutions for Delta-Star and Star-Delta Conversions of Reliability Networks , 1976, IEEE Transactions on Reliability.

[20]  Themistocles Politof,et al.  An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks , 1992 .

[21]  R. K. Wood,et al.  Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network" , 1996, SIAM J. Comput..