Abstract <p>A linear <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(m\)</EquationSource> <!--MMStat2570009Boulahia-m9--> </InlineEquation>-consecutive-<InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(k\)</EquationSource> <!--MMStat2570009Boulahia-m10--> </InlineEquation>-out-of-<InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(n:F(G)\)</EquationSource> <!--MMStat2570009Boulahia-m11--> </InlineEquation> system with sparse <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(d\)</EquationSource> <!--MMStat2570009Boulahia-m12--> </InlineEquation> consists of <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(n\)</EquationSource> <!--MMStat2570009Boulahia-m13--> </InlineEquation> components arranged in a line. The system fails (works) if and if there are at least <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(m\)</EquationSource> <!--MMStat2570009Boulahia-m14--> </InlineEquation> non overlapping runs of <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(k\)</EquationSource> <!--MMStat2570009Boulahia-m15--> </InlineEquation> consecutive failed (working) components with sparse <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(d\)</EquationSource> <!--MMStat2570009Boulahia-m16--> </InlineEquation>. In this paper, we introduce a linear weighted <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(m\)</EquationSource> <!--MMStat2570009Boulahia-m17--> </InlineEquation>-consecutive-<InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(k\)</EquationSource> <!--MMStat2570009Boulahia-m18--> </InlineEquation>-out-of-<InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(n:F(G)\)</EquationSource> <!--MMStat2570009Boulahia-m19--> </InlineEquation> system with sparse <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(d\)</EquationSource> <!--MMStat2570009Boulahia-m20--> </InlineEquation> consisting of weighted components. Such a system can find many applications in practice. We consider the situation where the system components are non-homogeneous Markov-dependent, and we derive closed-form formulas for the system reliability, the marginal reliability importance, and the joint reliability importance using conditional probability generating function method. We present numerical examples to illustrate the use of formulas.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Linear Weighted \(\boldsymbol{m}\)-Consecutive-\(\boldsymbol{k}\)-out-of-\(\boldsymbol{n}\) System with Sparse \(\boldsymbol{d}\)

  • Abdelmoumene Boulahia,
  • Soheir Belaloui

摘要

Abstract

A linear \(m\) -consecutive- \(k\) -out-of- \(n:F(G)\) system with sparse \(d\) consists of \(n\) components arranged in a line. The system fails (works) if and if there are at least \(m\) non overlapping runs of \(k\) consecutive failed (working) components with sparse \(d\) . In this paper, we introduce a linear weighted \(m\) -consecutive- \(k\) -out-of- \(n:F(G)\) system with sparse \(d\) consisting of weighted components. Such a system can find many applications in practice. We consider the situation where the system components are non-homogeneous Markov-dependent, and we derive closed-form formulas for the system reliability, the marginal reliability importance, and the joint reliability importance using conditional probability generating function method. We present numerical examples to illustrate the use of formulas.