Abstract
Large‐scale systems have been developed with increasing requirements of high quality and performance. It would be indispensable to define the reliability of more complex systems, considering their complexity. This paper defines a complexity of redundant systems as a logarithmic function of paths, using the concept of an entropy. Further, a reliability function of complexity is given, and the reliabilities of series and parallel systems with complexity are computed. As one of typical redundant systems, a majority voting system is analyzed, and an optimal number of components is derived. Finally, a complexity of network systems is also proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.