Signature-based block diagram analysis. Calculating complex-structure signatures

Aim. The signature theory allows comparing the structural dependability of complex systems consisting of identical components using a numeric vector referred to as signature that is determined using a certain algorithm. The signature describes a system’s structure and is associated with the order statistics of the components’ times to failure. The paper aims to familiarize the Russian readers with the theory, as well as to build simple algorithms that would allow finding the signature of an arbitrary VooL system, including a series parallel system using the known signatures of its subsystems.

Methods. Calculations and theorem proving primarily involve the use of combinatorics with various element selection patterns. Additionally, classical methods of the probability theory and mathematical theory of dependability are used.

Conclusions. The paper introduces such concept of the mathematical dependability theory as technical system signature. The primary purpose of this characteristic consists in comparing the structural dependability of several, in particular, two systems. The algorithm is sufficiently simple and involves comparing two finite numeric arrays according to a certain rule. Structural dependability is understood as the dependability of connection circuits of components that are identical in terms of dependability. That significantly reduces the capabilities of the signature theory, as practically all technical systems consist of components with various dependability. However, with a certain conservatism, it can be considered that all of a system’s components have a dependability identical to that of the least dependable one. The degree of conservatism will be determined by the difference in the component dependability that will be a sufficiently low value for highly dependable components. Additionally, we should note the purely mathematical beauty of the signature theory that has recently been gaining significant momentum in foreign scientific publications. It must be noted that according to the classical laws of combinatorics, as the number n of system component elements grows, the construction of a technical system signature speeds up significantly. Therefore, it becomes necessary to develop sufficiently simple algorithms for calculating the signature of a random system. As part of the presented work, analytical approaches to signature acquisition were developed for both simple cases when a single component is, in series or parallely, added to a subsystem, and more complex situations when one or more subsystems are added to another subsystem. A number of cases of signature construction were considered using both the classical method, and the one suggested in this paper. An example was analysed of system dependability comparison using their respective signatures. The structural dependability of systems with various numbers of components was compared. The paper proves a number of theorems that allow calculating the signature of a random structure diagram consisting of components that are identical in terms of dependability.

1. Samaniego F.J. On closure of the IFR class under formation of coherent systems. IEEE Trans. Reliability1985;34:69-72.

2. Kochar S., Mukerjee H., Samaniego F.J. The “Signature” of a Coherent System and Its Application to Comparisons among Systems. Naval Research Logistics 1999. DOI: 10.1002/(SICI)1520-6750(199908)46:53.0.CO;2-D.

3. Boland P.J. Signatures of indirect majority systems. J. Appl. Prob. 603;2001:597-38. DOI: https://doi.org/10.1239/jap/996986765.

4. Samaniego F.J. System signatures and their applications in engineering reliability. New York: Springer; 2007. DOI: 10.1007/978-0-387-71797-5.

5. Gertsbakh I., Shpungin Y., Spizzichino F. Signatures of coherent systems built with separate modules. J. Appl. Probab. 2011;48(3):843–855. DOI: https://doi.org/10.1239 jap/1316796919.

6. Da G., Zheng B., Hu T. On computing signatures of k-out-of-n systems consisting of modules. Methodology and Computing in Applied Probability 2014;16(1):223-233. DOI:10.1016/j.jmva.2011.06.015.

7. Coolen F.P.A., Coolen-Maturi T. Generalizing the Signature to Systems with Multiple Types of Components. In: Zamojski W., Mazurkiewicz J., Sugier J., Walkowiak T., Kacprzyk J., editors. Complex Systems and Dependability. Advances in Intelligent and Soft Computing 2013;170. Berlin, Heidelberg: Springer. DOI: 10.1007/978-0-387-71797-5.

8. Marichal J. Algorithms and Formulae for Conversion Between System Signatures and Reliability Functions. Journal of Applied Probability 2015;52(2):490-507. DOI:10.1239/jap/1437658611.

9. Jin Y., Hall P.G., Jiang J. et al. Estimating component reliability based on failure time data from a system of unknown design. Statistica Sinica 2017;27. doi: http://dx.doi.org/10.5705/ss.202015.0209.

10. Beichelt F., Franken P. Reliability and Maintenance – Mathematical Methods. Moscow: Radio i sviaz; 1988.