Computing the Signature of a Generalized $k$ -Out-of-$n$ System
Computing the Signature of a Generalized $k$ -Out-of-$n$ System
复制标题
DOI：
10.1109/tr.2015.2405594
复制
发表时间：
2015
影响因子：
5.9
通讯作者：
S. Eryilmaz;Altan Tuncel
中科院分区：
文献类型：
--
作者：
S. Eryilmaz;Altan Tuncel
广义k取n系统((n1，…，nn)，f，k)由N个按直线或圆排序的模组成，第i个模由并行的ni个分量组成(ni≥1，i=1，...，N)。如果存在至少f个故障组件或至少k个连续故障模块，则系统失败。在本文中，我们计算了当n1=…=nn=n时该系统的签名，并举例说明它的应用。当模块具有不同数量的组件时，提供基于模拟的签名计算。
A generalized k-out-of-n system which is denoted by ((n1,..., nN),f,k) consists of N modules ordered in a line or a circle, and the ith module is composed of ni components in parallel (ni ≥ 1, i=1,...,N). The system fails if there exist at least f failed components or at least k consecutive failed modules. In this paper, we compute the signature of this system when n1= ... = nN=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.