The efficiency of computing the reliability of k-out-of-n systems

It is shown that the algorithm of R.S. Barlow and K.D. Heidtmann (ibid., vol.R-33, p.322-3, Oct. 1984) is more computationally efficient than those reported by S.P. Jain and K. Gopal (ibid., vol.R-34, p.144-6, June 1985) and S. Rai et al. (ibid., vol.R-36, p.261-5, June 1987). Efficiency is measured here by the number of multiplications. >

[1]  Krishna Gopal,et al.  Recursive Algorithm for Reliability Evaluation of k-out-of-n:G System , 1985, IEEE Transactions on Reliability.

[2]  Thomas Risse.  On the Evaluation of the Reliability of k-out-of-n Systems , 1987, IEEE Transactions on Reliability.

[3]  Suresh Rai,et al.  Two Recursive Algorithms for Computing the Reliability of k-out-of-n Systems , 1987, IEEE Transactions on Reliability.

[4]  R. E. Barlow,et al.  Computing k-out-of-n System Reliability , 1984, IEEE Transactions on Reliability.