Algorithm for Computing the System Signatures of Linear and Circular Connected-(1,2)-or-(2,1)-out-of-(m,n):F Lattice Systems

Abstract

This study focuses on developing an algorithm to compute the system signatures of linear and circular connected-[Formula: see text]-or-[Formula: see text]-out-of-[Formula: see text]:F lattice systems. In reliability engineering, system signatures have diverse theoretical applications, such as conducting stochastic comparisons of certain systems, deriving mean time to failure, and providing optimal maintenance policy. However, the complexity involved in computing the system signature increases with the increase in the number of components, making the aforementioned applications challenging. Moreover, the computation of system signatures for connected-[Formula: see text]-or-[Formula: see text]-out-of-[Formula: see text]:F lattice systems has not been sufficiently discussed. Thus, this study proposes an algorithm for computing the system signatures of both linear and circular connected-[Formula: see text]-or-[Formula: see text]-out-of-[Formula: see text]:F lattice systems. Numerical experiments were conducted to investigate the efficiency and it was determined that the proposed algorithm can generate system signatures that the enumerative method cannot obtain. Consequently, the proposed algorithm will contribute to various applications.