Computing the Signature of a Generalized k -Out-of-n System

Eryılmaz, SerkanTuncel, Altan2020-06-252020-06-252015closedAccess0018-95291558-1721https://doi.org/10.1109/TR.2015.2405594https://hdl.handle.net/20.500.12587/6149A generalized k-out-of-n system which is denoted by ((n(1), ... , n(N)), f, k) consists N of modules ordered in a line or a circle, and the ith module is composed of n(i) components in parallel. (n(i) >= 1, i = 1, ... , N). The system fails iff there exist at least failed components or at least k consecutive failed modules. In this paper, we compute the signature of this system when n(1) = ... = n(N) = n, and present illustrative examples to demonstrate its application. Simulation based computation of the signature is provided when the modules have different numbers of components.eninfo:eu-repo/semantics/closedAccessk-out-of-n systemorder statisticssystem signatureComputing the Signature of a Generalized k -Out-of-n SystemArticle64276677110.1109/TR.2015.24055942-s2.0-85027948501Q1WOS:000355755200021Q1