Abstract

PurposeA multi-state linear k-within-(r, s)-of-(m, n): F lattice system consists of m×n components arranged in m rows and n columns. The possible states of the system and its components are: 0, 1, 2, …, H. According to k values, the system can be categorized into three special cases: decreasing, increasing and constant. The system reliability of decreasing and constant cases exists. The purpose of this paper is to evaluate the system reliability in increasing case with i.i.d components, where there is no any algorithm for evaluating the system reliability in this case.Design/methodology/approachThe Boole-Bonferroni bounds were applied for evaluating the reliability of many systems. In this paper, the author reformulated the second-order Boole-Bonferroni bounds to be suitable for the evaluation of the multi-state system reliability. And the author applied these bounds for deriving the lower bound and upper bound of increasing multi-state linear k-within-(r, s)-of-(m, n): F lattice system.FindingsAn illustrated example of the proposed bounds and many numerical examples are given. The author tested these examples and concluded the cases that make the new bounds are sharper.Practical implicationsIn this paper, the author considered an important and complex system, the multi-state linear k-within-(r, s)-of-(m, n): F lattice system; it is a model for many applications, for example, telecommunication, radar detection, oil pipeline, mobile communications, inspection procedures and series of microwave towers systems.Originality/valueThis paper suggests a method for the computation of the bounds of increasing multi-state linear k-within-(r,s)-of-(m,n): F lattice system. Furthermore, the author concluded that the cases that make these bounds are sharper.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.