Abstract
Practically, it is not feasible to obtain the precise reliability of systems in a reasonable time, when the systems are large and complex. In this paper, we present some stochastic bounds on generalized systems of which state spaces are mathematically partially ordered sets. In the first place we introduce a notion of generalized systems and then present some stochastic bounds on the system reliability by using maximal and minimal elements of the structures of the systems. The bounds are generalization of the well-known max-min bounds on binary-state system reliability. Furthermore, we present the other stochastic bounds when systems are decomposed into several modules and satisfy a condition which is called MC (Maximal Coincidence) condition. We show that these bounds are tighter than the former. For a few simple systems, we give numerical examples and estimations of computational complexity for obtaining these stochastic bounds.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of the Operations Research Society of Japan
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.