Note on reliability of a system complexity considering entropy Available to Purchase

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.