Note on reliability of a system complexity

✍ Scribed by T. Nakagawa; K. Yasui

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 419 KB
• Volume: 38
• Category: Article
• ISSN: 0895-7177
• DOI: 10.1016/s0895-7177(03)90139-7

✦ Synopsis

Most systems have been recently complicated with remarkable development of their high performances. Both hardware and softavare become redundant, and sometimes, serious problems of interference between them might be newly generated. It would be inappropriate to calculate the reliabilities of such complex systems, using the usual computing method. In this paper, a measure of complexity is defined by the number of paths, and its reliability functions are given. Using this definition, the reliabilities of some typical redundant systems with complexity are obtained. Further, optimal numbers of components which maximize the reliabilities are given as numerical examples.