Computing minimal signature of coherent systems through matrix-geometric distributions

Abstract Signatures are useful in analyzing and evaluating coherent systems. However, their computation is a challenging problem, especially for complex coherent structures. In most cases the reliability of a binary coherent system can be linked to a tail probability associated with a properly defined waiting time random variable in a sequence of binary trials. In this paper we present a method for computing the minimal signature of a binary coherent system. Our method is based on matrix-geometric distributions. First, a proper matrix-geometric random variable corresponding to the system structure is found. Second, its probability generating function is obtained. Finally, the companion representation for the distribution of matrix-geometric distribution is used to obtain a matrix-based expression for the minimal signature of the coherent system. The results are also extended to a system with two types of components.

[1]  M. Koutras,et al.  ON THE SIGNATURE OF COHERENT SYSTEMS AND APPLICATIONS , 2007, Probability in the Engineering and Informational Sciences.

[2]  Taizhong Hu,et al.  On Computing Signatures of k-out-of-n Systems Consisting of Modules , 2014 .

[3]  Mogens Bladt,et al.  Matrix-Exponential Distributions in Applied Probability , 2017 .

[4]  Serkan Eryilmaz,et al.  On Signatures of Series and Parallel Systems Consisting of Modules with Arbitrary Structures , 2014, Commun. Stat. Simul. Comput..

[5]  Francisco J. Samaniego,et al.  System Signatures and Their Applications in Engineering Reliability , 2007 .

[6]  Serkan Eryilmaz,et al.  Computing the Signature of a Generalized k-Out-of-n System , 2015, IEEE Trans. Reliab..

[7]  F. Coolen,et al.  Mean residual life of coherent systems consisting of multiple types of dependent components , 2018 .

[8]  Ming Jian Zuo,et al.  Computing and Applying the Signature of a System With Two Common Failure Criteria , 2010, IEEE Transactions on Reliability.

[9]  Fabio Spizzichino,et al.  Aggregation and signature based comparisons of multi-state systems via decompositions of fuzzy measures , 2020, Fuzzy Sets Syst..

[10]  C. Franko,et al.  Signatures of series and parallel systems consisting of non disjoint modules , 2017 .

[11]  Jorge Navarro,et al.  Computations of Signatures of Coherent Systems with Five Components , 2009, Commun. Stat. Simul. Comput..

[12]  Maochao Xu,et al.  An efficient algorithm for computing the signatures of systems with exchangeable components and applications , 2018 .

[13]  J. Navarro,et al.  Properties of Coherent Systems with Dependent Components , 2007 .

[14]  Markos V. Koutras,et al.  Reliability Properties of $(n,f,k)$ Systems , 2014, IEEE Transactions on Reliability.

[15]  Pooja Mohan,et al.  Reliability analysis of sparsely connected consecutive-k systems: GERT approach , 2009, 2009 8th International Conference on Reliability, Maintainability and Safety.

[16]  Maochao Xu,et al.  On the signature of complex system: A decomposed approach , 2018, Eur. J. Oper. Res..

[17]  Lirong Cui,et al.  A new computation method for signature: Markov process method , 2018 .

[18]  Lirong Cui,et al.  Reliability for Sparsely Connected Consecutive-$k$ Systems , 2007, IEEE Transactions on Reliability.

[19]  Michael R. Chernick,et al.  Runs and Scans With Applications , 2002, Technometrics.

[20]  Fabio Spizzichino,et al.  Signatures of coherent systems built with separate modules , 2011 .

[21]  Fabio Spizzichino,et al.  On modular decompositions of system signatures , 2015, J. Multivar. Anal..

[22]  Jean-Luc Marichal.  Algorithms and Formulae for Conversion Between System Signatures and Reliability Functions , 2013 .