Abstract
This article focuses on a toroidal connected-( r,s)-out-of-( m,n):F lattice system, which has m vertical circles and n horizontal circles, and the components are deployed at their intersections. This system fails if and only if the system has an [Formula: see text] sub-matrix where all components fail. It might be used to evaluate the reliability of a system with a toroidal structure, for example, toroidal storage tanks and neutron accelerators. The purpose of this article is to efficiently compute the reliability of the toroidal connected-( r,s)-out-of-( m,n):F lattice system. First, we propose a recursive method and then develop two kinds of algorithms based on this method. We apply an idea of preparing a set in a pre-processing phase to one algorithm, and consequently, the algorithm with the idea requires the extra memory space but has better time complexity compared with the other one. Finally, we investigate the efficiency of the two algorithms through numerical experiments.
Sign-in/Register to access full text options 
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 callMore From: Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability
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.
