• [email protected]
  • +971 507 888 742
Submit Manuscript
SciAlert
  • Home
  • Journals
  • Information
    • For Authors
    • For Referees
    • For Librarian
    • For Societies
  • Contact
  1. Journal of Applied Sciences
  2. Vol 15 (3), 2015
  3. 431-443
  • Issues
    Online First Current Issue All Issues
  • Information About
    Aims and Scope Editorial Board Guide to Authors Article Processing Charges
    Submit a Manuscript

Journal of Applied Sciences

Year: 2015 | Volume: 15 | Issue: 3 | Page No.: 431-443
DOI: 10.3923/jas.2015.431.443

Facebook Twitter Reddit Linkedin E-mail
Google Scholar ASCI
Research Article

Reliability of Coherent Threshold Systems

Ali Muhammad Ali Rushdi
Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, P.O. Box 80204, Jeddah, 21589, Saudi Arabia

Alaa Mohammad Alturki
Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, P.O. Box 80204, Jeddah, 21589, Saudi Arabia

A Threshold System (TS) is a reliability system whose success/failure is a threshold switching function in the successes/failures of its components. A Coherent System (CS) is one that is both monotone and with relevant components and hence its success function is expressible without any complemented literals. The Coherent Threshold System (CTS) is consequently described by strictly positive weights and threshold. It is a useful model for many decision or supply systems and being a natural generalization of the k-out-of-n system, it is typically called the weighted k-out-of-n system. This study lists fundamental properties of the CTS and presents two novel methods of deriving its weights and threshold. The first method is called the unit-gap method and proceeds by writing a set of 2n linear inequalities and then reducing this set utilizing symmetry and the elimination of dominated inequalities. The reduced set is then solved subject to the unit-gap restriction. The second method is called the fair-power method since it insists that the system weights be representative of component importance or voting power. This is achieved by making the weight of each component proportional to its Banzhaf index which is the weight of the Boolean derivative or difference of the system success with respect to the component success. The study further presents the recursive relations governing the success of the CTS, transforms these relations to the probability domain and then utilizes them together with appropriate boundary conditions to derive a recursive algorithm for computing the reliability of the CTS. The algorithm is given two pictorial interpretations in term of signal flow graphs and probability maps. An illustrative example demonstrates the implementation of the algorithm and the optimal order of the components to be followed during the algorithm implementation. The study is concluded with a general discussion of its findings compared to those of previously-published studies and an overview of potential future work.
PDF Fulltext XML References Citation

How to cite this article

Ali Muhammad Ali Rushdi and Alaa Mohammad Alturki, 2015. Reliability of Coherent Threshold Systems. Journal of Applied Sciences, 15: 431-443.

DOI: 10.3923/jas.2015.431.443

URL: https://scialert.net/abstract/?doi=jas.2015.431.443

Leave a Comment


Your email address will not be published. Required fields are marked *

Article Trend



Total views 3466

References


  1. Al-Qasimi, A.M. and A.M. Rushdi, 2008. A tutorial on how to efficiently calculate and format tables of the Binomial distribution. J. King Abdulaziz Univ.: Eng. Sci., 19: 3-17.
    Direct Link

  2. Amari, S.V., M.J. Zuo and G. Dill, 2008. O(Kn) Algorithms for Analyzing Repairable and Non-Repairable k-out-of-n: G Systems. In: Handbook of Performability Engineering, Misra, K.B. (Ed.). Chapter 21, Springer, London, UK., ISBN-13: 9781848001312, pp: 309-320.

  3. Aziz, H., M. Paterson and D. Leech, 2007. Efficient algorithm for designing weighted voting games. Proceedings of the IEEE International Multitopic Conference, December 28-30, 2007, Lahore, Pakistan, pp: 1-6.
    CrossRef

  4. Ball, M.O. and J.S. Provan, 1988. Disjoint products and efficient computation of reliability. Oper. Res., 36: 703-715.
    CrossRefDirect Link

  5. Banzhaf, III J.F., 1965. Weighted voting doesn't work: A mathematical analysis. Rutgers Law Rev., 19: 317-343.
    Direct Link

  6. Chen, Y. and Q. Yang, 2005. Reliability of two-stage weighted-k-out-of-n systems with components in common. IEEE Trans. Reliab., 54: 431-440.
    CrossRefDirect Link

  7. Cochran, J.K. and T.P. Lewis, 2002. Computing small-fleet aircraft availabilities including redundancy and spares. Comput. Oper. Res., 29: 529-540.
    CrossRefDirect Link

  8. Crama, Y. and P.L. Hammer, 2011. Boolean Functions: Theory, Algorithms and Applications. Cambridge University Press, Cambridge, UK., ISBN-13: 9780521847513, Pages: 710.

  9. Dubey, P. and L.S. Shapley, 1979. Mathematical properties of the Banzhaf power index. Math. Oper. Res., 4: 99-131.
    CrossRefDirect Link

  10. Hammer, P.L. and R. Holzman, 1992. Approximations of pseudo-Boolean functions: Applications to game theory. Zeitschrift Oper. Res., 36: 3-21.
    CrossRefDirect Link

  11. Hansen, K.M. and J.R. Bronsted, 2010. Modeling service composition reliability in pervasive computing. Technical Report RH-02-2010, Science Institute, University of Iceland, Dunhaga, Reykjavik, March, 2010.

  12. Higashiyama, Y., 2001. A factored reliability formula for weighted-k-out-of-n system. Asia-Pac. J. Oper. Res., 18: 61-66.
    Direct Link

  13. Higashiyama, Y., X. Cai and V. Rumchev, 2009. New algorithm for computing exact reliability formula of weighted-k-out-of-n system using SDP method. Proceedings of the 13th World Multi-Conference on Systemics, Cybernetics and Informatics, July 10-13, 2009, Orlando, FL., USA., pp: 92-97.
    Direct Link

  14. Higashiyama, Y. and V. Rumchev, 2012. New version of SDP method for weighted-k-out-of-n system. Proceedings of the 16th World Multi-Conference on Systemics, Cybernetics and Informatics, July 17-20, 2012, Orlando, FL., USA., pp: 120-125.
    Direct Link

  15. Ho, Y.C. and R.L. Kashyap, 1965. An algorithm for linear inequalities and its applications. IEEE Trans. Electron. Comput., EC-14: 683-688.
    CrossRef

  16. Hurst, S.L., D.M. Miller and J.C. Muzio, 1985. Spectral Techniques in Digital Logic. Academic Press, London, UK., ISBN-13: 9780123626806, Pages: 314.

  17. Kuo, W. and M.J. Zuo, 2003. The k-out-of-n System Model. In: Optimal Reliability Modelling: Principles and Applications, Kuo, W. and M.J. Zuo (Eds.). Chapter 7, John Wiley and Sons, New York, USA., ISBN-13: 9780471275459, pp: 231-280.

  18. Lee, S.C., 1978. Modern Switching Theory and Digital Design. Prentice-Hall, Englewood Cliffs, NJ., USA., ISBN-13: 9780135986806, Pages: 498.

  19. Mengert, P.H., 1970. Solution of linear inequalities. IEEE Trans. Comput., C-19: 124-131.
    CrossRef

  20. Muroga, S., 1979. Logic Design and Switching Theory. John Wiley and Sons, New York, USA., ISBN-13: 9780471044185, Pages: 617.

  21. Nagaraja, G. and G. Krishna, 1974. An algorithm for the solution of linear inequalities. IEEE Trans. Comput., C-23: 421-427.
    CrossRefDirect Link

  22. Rushdi, A.M., 1983. Symbolic reliability analysis with the aid of variable-entered Karnaugh maps. IEEE Trans. Reliab., R-32: 134-139.
    CrossRefDirect Link

  23. Rushdi, A.M., 1983. How to hand-check a symbolic reliability expression. IEEE Trans. Reliab., R-32: 402-408.
    CrossRefDirect Link

  24. Rushdi, A.M., 1984. On reliability evaluation by network decomposition. IEEE Trans. Reliab., R-33: 379-384.
    CrossRefDirect Link

  25. Rushdi, A.M. and A.S. Goda, 1985. Symbolic reliability analysis via Shannon's expansion and statistical independence. Microelectron. Reliab., 25: 1041-1053.
    CrossRefDirect Link

  26. Rushdi, A.M., 1986. Utilization of symmetric switching functions in the computation of k-out-of-n system reliability. Microelectron. Reliab., 26: 973-987.
    CrossRefDirect Link

  27. Rushdi, A.M., 1986. Map differentiation of switching functions. Microelectron. Reliab., 26: 891-907.
    CrossRefDirect Link

  28. Rushdi, A.M., 1987. On computing the syndrome of a switching function. Microelectron. Reliab., 27: 703-716.
    CrossRefDirect Link

  29. Rushdi, A.M., 1987. Efficient computation of k-to-ℓ-out-of-n system reliability. Reliab. Eng., 17: 157-163.
    CrossRefDirect Link

  30. Rushdi, A.M., 1987. A switching-algebraic analysis of consecutive-k-out-of-n: F systems. Microelectron. Reliab., 27: 171-174.
    CrossRefDirect Link

  31. Rushdi, A.M., 1987. On computing the spectral coefficients of a switching function. Microelectron. Reliab., 27: 965-979.
    CrossRefDirect Link

  32. Rushdi, A.M. and F.M.A. Dehlawi, 1987. Optimal computation of k-to-ℓ-out-of-n system reliability. Microelectron. Reliab., 27: 875-896.
    CrossRefDirect Link

  33. Rushdi, A.M., 1988. A switching-algebraic analysis of circular consecutive-k-out-of-n: F systems. Reliab. Eng. Syst. Safety, 21: 119-127.
    CrossRefDirect Link

  34. Rushdi, A.M., 1990. Threshold systems and their reliability. Microelectron. Reliab., 30: 299-312.
    CrossRefDirect Link

  35. Rushdi, A.M., 1991. Comment on: An efficient nonrecursive algorithm for computing the reliability of k-out-of-n systems by A.K. Sarje and E.V. Prasad. IEEE Trans. Reliab., 40: 60-61.
    CrossRefDirect Link

  36. Rushdi, A.M., 1993. Reliability of k-out-of-n Systems. In: New Trends in System Reliability Evaluation, Misra, K.B. (Ed.). Chapter 5, Elsevier Science Publishers, Amsterdam, Netherlands, ISBN-13: 9780444816603, pp: 185-227.

  37. Rushdi, A.M. and K.A. Al-Hindi, 1993. A table for the lower boundary of the region of useful redundancy for k-out-of-n systems. Microelectron. Reliab., 33: 979-992.
    CrossRefDirect Link

  38. Rushdi, A.M. and A.O. Al-Thubaity, 1993. Efficient Computation of the sensitivity of k-out-of-n system reliability. Microelectron. Reliab., 33: 1963-1979.
    CrossRefDirect Link

  39. Rushdi, A.M. and A.A. Abdulghani, 1993. A comparison between reliability analyses based primarily on disjointness or statistical independence: The case of the generalized indra network. Microelectron. Reliab., 33: 965-978.
    CrossRefDirect Link

  40. Rushdi, A.M. and A.M. Al-Qasimi, 1994. Efficient computation of the P.M.F. and the C.D.F. of the generalized binomial distribution. Microelectron. Reliab., 34: 1489-1499.
    CrossRefDirect Link

  41. Rushdi, A.M. and O.M. Ba-Rukab, 2004. A doubly-stochastic fault-tree assessment of the probabilities of security breaches in computer systems. Proceedings of the 2nd Saudi Science Conference, Part Four: Computer, Mathematics and Statistics, March 15-17, 2004, Jeddah, Saudi Arabia, pp: 1-17.

  42. Rushdi, A.M. and O.M. Ba-Rukab, 2005. Fault-tree modelling of computer system security. Int. J. Comput. Math., 82: 805-819.
    CrossRefDirect Link

  43. Rushdi, A.M. and A.E. Alsulami, 2007. Cost elasticities of reliability and MTTF for k-out-of-n systems. J. Math. Stat., 3: 122-128.
    CrossRefDirect Link

  44. Rushdi, A.M., 2010. Partially-redundant systems: Examples, reliability and life expectancy. Int. Mag. Adv. Comput. Sci. Telecommun., 1: 1-13.
    Direct Link

  45. Samaniego, F.J. and M. Shaked, 2008. Systems with weighted components. Stat. Probab. Lett., 78: 815-823.
    CrossRefDirect Link

  46. Shamir, A., 1979. How to share a secret. Commun. ACM, 22: 612-613.
    CrossRefDirect Link

  47. Ursani, Z., 2014. Computing availability for redundant flow systems. Optim. Lett., 8: 715-725.
    CrossRefDirect Link

  48. Wei, L. and M.J. Zuo, 2008. Reliability evaluation of multi-state weighted k-out-of-n systems. Reliab. Eng. Syst. Saf., 93: 160-167.
    CrossRefDirect Link

  49. Wu, J.S. and R.J. Chen, 1994. An algorithm for computing the reliability of weighted-k-out-of-n systems. IEEE Trans. Reliab., 43: 327-328.
    CrossRefDirect Link

  50. Censor, Y. and T. Elfving, 1982. New methods for linear inequalities. Linear Algebra Applic., 42: 199-211.
    CrossRefDirect Link

  51. Yamamoto, Y., 2012. Banzhaf index and Boolean difference. Proceedings of the 42nd IEEE International Symposium on Multiple-Valued Logic, May 14-16, 2012, Victoria, BC., pp: 191-196.
    CrossRef

  52. Yang, K. and K.G. Murty, 1992. New iterative methods for linear inequalities. J. Optim. Theory Appli., 72: 163-185.
    CrossRefDirect Link

  53. Zuo, M., S. Chiovelli and J. Huang, 1999. Reliability evaluation of furnace systems. Reliab. Eng. Syst. Safety, 65: 283-287.
    CrossRefDirect Link

  54. Zuo, M.J. and Y. Wu, 1996. Reliability evaluation of a furnace system using the k-out-of-n and the consecutive-k-out-of-n reliability models. Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, October 14-17, 1996, Beijing, China, pp: 3119-3123.
    CrossRef

  55. Higashiyama, Y. and V. Rumchev, 2011. Number of product terms in reliability formula of weighted-k-out-of-n system by SDP method. Proceedings of the 15th World Multi-Conference on Systemics, Cybernetics and Informatics, July 19, 2011, Orlando, Florida, pp: 178-183.

  56. Muroga, S., 1971. Threshold Logic and its Applications. Wiley-Interscience, New York, USA., ISBN-13: 9780471625308, Pages: 478.

  57. Lu, Z. and W. Liu, 2006. Reliability evaluation of STATCOM based on the k-out-of-n: G model. Proceedings of the International Conference on Power System Technology, October 22-26, 2006, Chongqing, China, pp: 1-6.
    CrossRef

Keywords


  • Reliability
  • recursive relations
  • importance measures
  • Banzhaf voting power
  • success
  • algorithms
  • weighted k-out-of-n systems
  • coherent
  • threshold function

Useful Links

  • Journals
  • For Authors
  • For Referees
  • For Librarian
  • For Socities

Contact Us

Office Number 1128,
Tamani Arts Building,
Business Bay,
Deira, Dubai, UAE

Phone: +971 507 888 742
Email: [email protected]

About Science Alert

Science Alert is a technology platform and service provider for scholarly publishers, helping them to publish and distribute their content online. We provide a range of services, including hosting, design, and digital marketing, as well as analytics and other tools to help publishers understand their audience and optimize their content. Science Alert works with a wide variety of publishers, including academic societies, universities, and commercial publishers.

Follow Us
© Copyright Science Alert. All Rights Reserved