Next Article in Journal
A Revisit of the Boundary Value Problem for Föppl–Hencky Membranes: Improvement of Geometric Equations
Next Article in Special Issue
Estimation of Uncertainty in Mortality Projections Using State-Space Lee-Carter Model
Previous Article in Journal
Some Janowski Type Harmonic q-Starlike Functions Associated with Symmetrical Points
Previous Article in Special Issue
Asymptotic Results in Broken Stick Models: The Approach via Lorenz Curves
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Consecutive k1 and k2-out-of-n Reliability Systems

Department of Computer Science & Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece
Mathematics 2020, 8(4), 630; https://doi.org/10.3390/math8040630
Submission received: 28 February 2020 / Revised: 12 April 2020 / Accepted: 15 April 2020 / Published: 19 April 2020
(This article belongs to the Special Issue Probability, Statistics and Their Applications)

Abstract

:
In this paper we carry out a reliability study of the consecutive-k1 and k2-out-of-n systems with independent and identically distributed components ordered in a line. More precisely, we obtain the generating function of the structure’s reliability, while recurrence relations for determining its signature vector and reliability function are also provided. For illustration purposes, some numerical results and figures are presented and several concluding remarks are deduced.

1. Introduction

In the field of Reliability Engineering, considerable research activity has been steered towards the investigation of operating features of consecutive-type structures, due to their applications in the optimization of telecommunication networks, complex infrared detecting systems, oil pipeline systems, vacuum systems in accelerators, and spacecraft relay stations.
Generally speaking, a consecutive-out-of-n: F system consisting of n linearly ordered units (or components), fails if and only if at least k consecutive ones fail (see, e.g., [1] or [2]). Several reliability studies related to these structures have been recently accomplished, and some generalizations and extensions have been also proposed for delivering more moldable features. As a paradigm, we mention the r-within-consecutive k-out-of-n: F system ( 1 < r k n ), which was established in [3]. The particular structure fails if and only if there exist k consecutive components that include among them at least r failed components (see also [4] or [5]).
Furthermore, a variety of additional extensions of the traditional consecutive-k-out-of-n: F system has appeared in the literature during the last three decades and studied in detail. These extended versions of the well-known consecutive-k-out-of-n: F structure activate more complicated failure criteria in order to cover a larger range of applications and exhibit better performance. Among others, the interested reader is referred to the m-consecutive-k-out-of-n: F system ( n m k ) (see, e.g., [6] or [7]), the sparsely connected consecutive-k systems ([8] or [9]), the m-consecutive-k-out-of-n:F-r-S-interrupted systems ([10]), and the m-consecutive-k, l-out-of-n systems ([11]).
In addition, the reliability structures, which involve two common failure criteria, have attracted significant research interest in the literature. For instance, the ( n , f , k ) system established in [12], was also studied in [13] via a Markov chain approach, while some interesting reliability attributes and applications of it were investigated in [14,15]. Further extensions of ( n , f , k ) structures have been proposed; a reliability system which looks after two different failure criteria was also provided in [16]. More precisely, the abovementioned structure combines the well-known f-out-of-n: G and the classical consecutive- k-out-of-n: G structure. Moreover, an innovative scheme based on a m-consecutive k-out-of-n: F and a consecutive- k c -out-of-n: F system was proposed in [17], the so-called constrained (k, d)-out-of-n: F system was established in [18] (see, also [19]), while the ( ( n 1 , n 2 , , n N ) , f , k ) structure involving N modules with the i-th module consisting of ni units in parallel was introduced in [20] (see, also [21]). Moreover, the so-called n , f , k structure, which operates under two common failure criteria, was studied in [22]. The particular system contains n components and fails if and only if there exist at least f failed components and at least k consecutive failed components (see also [23]).
For a detailed and up-to-date survey on the consecutive-k-out-of-n: F systems and their generalizations, we suggest the detailed review papers [24,25] or [26] and the well-written monographs [27,28]. A survey of reliability approaches in various fields of engineering and physical sciences is provided in [29].
In this manuscript, we conduct a reliability study of the consecutive-k1 and k2-out-of-n structures introduced in [30] which operate under two common failure criteria. The consecutive-k1 and k2-out-of-n structure contains n components in a line and fails if and only if there exist at least non-overlapping consecutive k1 failed components and consecutive k2 failed components. The main motivation of the present paper is to deliver the generating function of the reliability for the linear consecutive k1 and k2-out-of-n system. The aforementioned result has not appeared in the literature to date and is now offered by Proposition 1 of the present manuscript. It is clear that the results provided in [30] do not overlap with the theoretical results proved in the present manuscript. To be more articulate, the outcomes given in [30] are complementary (rather than competitive) to those established in the present manuscript.
Delivering the generating function of a structure’s reliability calls for several algebraic manipulations and consequently seems to be of some theoretical/mathematical interest. However, having at hand the generating function of the consecutive k1 and k2-out-of-n reliability system gives us the opportunity to develop recursive schemes for computing some important reliability characteristics of the underlying structure. Indeed, Propositions 2 and 3 of the present manuscript offer innovative recurrences for determining the reliability polynomial and the signature vector of the linear consecutive k1 and k2-out-of-n reliability system.
In Section 2, we derive the generating function of the consecutive-k1 and k2-out-of-n system with independent and identically distributed components ordered in a line, while recurrence relations for determining its reliability function and its signature vector are introduced and proved in Section 3. For illustration purposes, some numerical results and figures are constructed and several concluding remarks are stated.

2. The Generating Function of the Consecutive-k1 and k2-out-of-n Systems

In this section, we study the linear consecutive-k1 and k2-out-of-n structure, where k 1 < k 2 . More specifically, we employ a generating function approach in order to investigate some reliability characteristics of the linear consecutive-k1 and k2-out-of-n structure. To achieve that, the Markov chain methodology established in [31] is implemented (see, also [32] or [33]) and an explicit expression for determining the generating function of the reliability function of the linear consecutive-k1 and k2-out-of-n structure with independent and identically distributed (i.i.d. hereafter) components is derived.
Let us first point out the necessary methodological background, which will be proved useful for the study of the consecutive-k1 and k2-out-of-n structure. We first assume that R n , n = 0 , 1 , corresponds to the reliability function of an imbeddable in a Markov chain structure consisting of n components. It is evident that the general form for evaluating the reliability function R n of the abovementioned system is given as
R n = π 0 Λ n u = 1 π 0 Λ n e N
where Λ is the transition probability matrix related to the system and
π 0 = ( 1 , 0 , 0 , , 0 ) ,   u = ( 1 , 1 , , 1 , 0 ) ,   e N = ( 0 , 0 , , 0 , 1 ) .
In addition, if R ( z ; p ) = n = 0 R n z n corresponds to the generating function of the sequence { R n , n = 0 , 1 , } , then R ( z ; p ) could be expressed as
R ( z ; p ) = π 0 ( I z Λ ) 1 u = 1 1 z 1 det ( I z Λ ) e 1 , N
where e i , j denotes the ( i , j ) element of the adjoint of matrix I z Λ . Consequently, should one be able to evaluate the last entry of the first row of the matrix ( I z Λ ) 1 , the generating function of the reliability function of the corresponding system can be deduced after some algebraic maneuvering.
Let us next denote by T the lifetime of a reliability system with n components and T 1 , T 2 , , T n its components’ lifetimes. If we assume that T 1 , T 2 , , T n are independent and identically distributed, the signature of the system is defined as the probability vector ( s 1 ( n ) , s 2 ( n ) , , s n ( n ) ) with
s i ( n ) = P ( T = T i : n ) , i = 1 , 2 , , n ,
where T 1 : n T 2 : n T n : n denote the respective order statistics of the random sample T 1 , T 2 , , T n . Since the system fails upon the failure of one of its components, it is clear enough that the lifetime T coincides to the corresponding ordered lifetime of this particular fatal component. Consequently, the coordinate s i ( n ) depicts the probability that the system fails when its i-th ordered component fails.
Generally speaking, the signature vector of a reliability structure has evolved as a crucial performance metric for appraising the behavior of coherent structures. Furthermore, the signature vector seems to be able to bolster the evaluation of reliability polynomial and several stochastic comparisons among systems’ lifetimes (see, e.g., [34] or [35]). For some recent advances on the evaluation of the signature vector of a reliability structure, one may refer to [36], [37] or [38].
Applying Equation (1) and taking into account the Markov chain representation of the linear consecutive-k1 and k2-out-of-n system proposed in [30], we may determine the reliability function R n , n = k , k + 1 , of the consecutive-k1 and k2-out-of-n structure, where k = k 1 + k 2 . It is evident that the outcomes given in [30] are complementary (rather than competitive) to the ones established in the present manuscript. For example, Proposition 1 provides an explicit expression for determining the generating function R ( z ; p ) = n = k R n z n of the sequence { R n , n = k , k + 1 , } , while the authors in [30] offered only the necessary blocked form of the transition probability matrix of the underlying structure.
It is worth mentioning that the below-mentioned result, which calls for several complex algebraic operations, seems to be the main theoretical outcome of the present manuscript, since it supports the proof of the remaining propositions and consequently all numerical or figurative illustrations displayed later.
Proposition 1.
The generating function of the reliability function of the linear consecutive-k1 and k2-out-of-n ( k 1 < k 2 ) structure with i.i.d. components can be determined as
R ( z ; p ) = b 2 ( k 1 ) b ( k 2 ) ( q z ) k 1 + k 2 ( b ( k 2 ) + p b ( k 1 ) i = 0 k 2 k 1 1 ( q z ) i ) ( 1 z ) b 2 ( k 1 ) b ( k 2 )
where p , q = 1 p correspond to the common reliability and unreliability of the components while
  b ( g ) = 1 p z i = 0 g 1 ( q z ) i , g > 1
Proof. 
Taking advantage of the blocked form of the transition probability matrix Λ of the linear consecutive-k1 and k2-out-of-n structure proposed in [30], we may write
Λ = [ A k 2 × k 2 D k 2 × k 2 E k 2 × ( k 1 + 1 ) 0 k 2 × k 2 B k 2 × k 2 F k 2 × ( k 1 + 1 ) 0 ( k 1 + 1 ) × k 2 0 ( k 1 + 1 ) × k 2 C ( k 1 + 1 ) × ( k 1 + 1 )   ] = ( p   q   0   0 0 k 2 0   0   0 0 k 2 0   0   0 0 k 1 + 1 p   0   q   0 0 0   0   0 0 0   0   0 0     p   0   0   0 0 0   0   0 0 0   0   0 0 0   0   0   0 0 p   0   0 0 0   0   0 0     0   0   0   0 q p   0   0 0 0   0   0 0 0   0   0   0 0 p   0   0 0 q   0   0 0   _ 0   0   0   0 0 p   q   0 0 0   0   0 0 0   0   0   0 0 p   0   q 0 0   0   0 0 0   0   0   0 0 p   0   0 q 0   0   0 0 0   0   0   0 0 p   0   0 0 0   0   0 q   _ 0   0   0   0 0 0   0   0 0 p   q   0 0 0   0   0   0 0 0   0   0 0 p   0   q 0   0   0   0   0 0 0   0   0 0 p   0   0 q 0   0   0   0 0 0   0   0 0 0   0   0 1 ) N × N
where N = 2 k 2 + k 1 + 1 denotes the order of matrix Λ. The ( 1 , N ) element of the adjoint of the matrix I z Λ is given by
e 1 , N = ( 1 ) N + 1 M N , 1
where M N , 1 corresponds to the minor determinant which is deduced by deleting the last row and the first column of the square matrix I z Λ . More precisely, the determinant M N , 1 takes on the following form:
M N , 1 = | q z   0 0 0 k 2 1 0 0 0 0 k 2 0 0 0 0   k 1 + 1 1 q z   0 0 0 0 0 0 0 0 0 0   0 0   0 0 0 0 0 0 0 0 0 0 0 0   0 0   p z 0 0 0 0 0 0 0 0 0   0 q z   p z 0 0 0 0 0 0 0 0 0   0 1 p z 0 0 0   q z 0 0 0 _ 0 0   0 0 1 p z   q z 0 0 0 0 0 0 0 0   0 0 p z 1 q z   0 0 0 0 0 0 0   0 0 p z 0 0 q z 0 0 0 0 0 0   0 0 p z 0 0 1 0 0 0 q z _ 0 0   0 0 0 0 0 0 1 p z   q z 0   0 0 0   0 0 0 0 0 0 p z 1 q z 0   0 0   0 0 0 0 0 0 p z 0 0 q z | N × N
We next expand the above determinant according to the elements of its first row and we repeat the same expansion k1 times successively. We then conclude that M N , 1 may we rewritten as
M N , 1 = ( q z ) k 1 | β 0 0 0   k 2 k 1 1 ζ 0 0 0   k 2 0 0 0 0   k 1 + 1     1 β 0 0 ζ 0 0 0 0 0 0 0   0 1 β 0 ζ 0 0 0 0 0 0 0     0 0 0 β ζ 0 0 0 0 0 0 0   0 0 0 1 ζ 0 0 0 β 0 0 0 _     0 0 0 0 ω β 0 0 0 0 0 0   0 0 0 0 ζ 1 β 0 0 0 0 0     0 0 0 0 ζ 0 0 β 0 0 0 0   0 0 0 0 ζ 0 0 1 0 0 0 β   _   0 0 0 0 0 0 0 0 ω β 0 0     0 0 0 0 0 0 0 0 ζ 1 β 0     0 0 0 0 0 0 0 0 ζ 0 0 β | 2 k 2 × 2 k 2
where
β = q z , ζ = p z , ω = 1 p z .
By expanding the above determinant through the items of its ( 2 k 2 k 1 ) t h column, we get
M N , 1 = ( q z ) k 1 [ ( 1 ) 3 k 2 2 k 1 ( q z ) D 1 + ( 1 ) 4 k 2 2 k 1 + 1 ( 1 p z ) D 2 p z ( D 3 D 4 + D 5 + ( 1 ) k 1 D ξ ) ]
where
D 1 = ( q z ) k 2 1 ( 1 p z i = 0 k 2 1 ( q z ) i ) ,   D 2 = ( 1 ) ( 4 k 2 2 k 1 + 1 ) ( k 1 1 ) + k 2 k 1 ( q z ) k 2 p i = 0 k 2 k 1 1 ( q z ) i ,
D 3 = ( 1 ) ( 4 k 2 2 k 1 + 1 ) ( k 1 1 ) + k 2 k 1 ( q z ) k 2 + 1 p i = 0 k 2 k 1 1 ( q z ) i , D 4 = ( 1 ) ( 4 k 2 2 k 1 + 1 ) ( k 1 1 ) + k 2 k 1 ( q z ) k 2 + 2 p i = 0 k 2 k 1 1 ( q z ) i D 5 = ( 1 ) ( 4 k 2 2 k 1 + 1 ) ( k 1 1 ) + k 2 k 1 ( q z ) k 2 + 3 p i = 0 k 2 k 1 1 ( q z ) i , , D ξ = ( 1 ) ( 4 k 2 2 k 1 + 1 ) ( k 1 1 ) + k 2 k 1 ( q z ) k 2 + k 1 1 p i = 0 k 2 k 1 1 ( q z ) i .
We then substitute the above expressions for the sub-determinants D 1 , D 2 , D 3 , D 4 , D 5 , , D ξ in Equation (6) and the following ensues:
M N , 1 = ( q z ) k 1 + k 2 [ ( 1 ) 2 k 2 k 1 ( 1 p z i = 0 k 2 1 ( q z ) i ) + ( 1 ) k 1 ( 4 k 2 2 k 1 + 1 ) p i = 0 k 2 k 1 1 ( q z ) i ( 1 p z i = 0 k 1 1 ( q z ) i ) ]
or equivalently:
M N , 1 = ( q z ) k 1 + k 2 ( 1 ) k 1 [ ( 1 p z i = 0 k 2 1 ( q z ) i ) + p i = 0 k 2 k 1 1 ( q z ) i ( 1 p z i = 0 k 1 1 ( q z ) i ) ]
Combining Equations (2), (5), and (7), the desired expression required for determining the generating function of the reliability function of the linear consecutive-k1 and k2-out-of-n ( k 1 < k 2 ) system is readily deduced. □
It is true that delivering the generating function of a structure’s reliability calls for several algebraic manipulations and consequently seems to be of some theoretical or mathematical interest. However, having at hand the generating function of the consecutive-k1 and k2-out-of-n reliability system gives us the opportunity to develop recursive schemes for computing some important reliability characteristics of the underlying structure. Indeed, Propositions 2 and 3, which appear in the next section, offer innovative recurrences for determining the reliability polynomial and the signature vector of the linear consecutive-k1 and k2-out-of-n reliability system. Based on these recursive schemes, several numerical results for specific values of the design parameters k1, k2, n could be produced for providing an illuminating impression about how the theoretical results of the manuscript could be proved useful in practice.

3. Recurrence Relations for the Reliability Function and the Signature Vector of the Consecutive-k1 and k2-out-of-n Systems

We next focus on two important performance characteristics of the linear consecutive-k1 and k2-out-of-n ( k 1 < k 2 ) structure consisting of i.i.d. components. More precisely, we exploit the general result proved in Section 2 in order to establish recurrence relations not only for evaluating the reliability function of the underlying system but also for determining the coordinates of the respective signature vector.
The following proposition provides a recursive scheme in terms of the design parameter n for determining the reliability function of the linear consecutive-k1 and k2-out-of-n ( k 1 < k 2 ) structure.
Proposition 2.
The reliability function R n of the linear consecutive-k1 and k2-out-of-n structure ( k 1 < k 2 ) consisting of i.i.d. components serves the next recurrence
R n R n 1 2 p i = 0 k 1 1 q i ( R n i 1 R n i 2 ) p i = 0 k 2 1 q i ( R n i 1 R n i 2 ) + p 2 i = 0 k 1 1 j = i i + k 1 1 q j ( R n j 2 R n j 3 ) + 2 p 2 i = 0 k 1 1 j = i i + k 2 1 q j ( R n j 2 R n j 3 ) p 3 i = 0 k 1 1 j = i i + k 2 1 h = 0 k 1 1 q j + h ( R n j h 3 R n j h 4 ) = 0 , n 2 k 2 + k 1 + 1 .
Proof. 
Recalling formula (3) we may write
( 1 z ) ( 1 p z i = 0 k 1 1 ( q z ) i ) 2 ( 1 p z i = 0 k 2 1 ( q z ) i ) n = 0 R n z n = ( 1 p z i = 0 k 1 1 ( q z ) i ) 2 ( 1 p z i = 0 k 2 1 ( q z ) i ) ( q z ) k 1 + k 2 [ ( 1 p z i = 0 k 2 1 ( q z ) i ) + p i = 0 k 2 k 1 1 ( q z ) i ( 1 p z i = 0 k 1 1 ( q z ) i ) ] .
We next observe that the maximum power exponent on the right-hand side of the above relation equals 2 k 2 + k 1 . Consequently, taking into account that the coefficients of z n on the left-hand side should not appear for n 2 k 2 + k 1 + 1 , the above equality can be rewritten as
n = 0 R n z n ( 2 p z i = 0 k 1 1 ( q z ) i ( p z i = 0 k 1 1 ( q z ) i ) 2 + p z i = 0 k 2 1 ( q z ) i 2 p 2 z 2 i = 0 k 1 1 ( q z ) i i = 0 k 2 1 ( q z ) i   + p 3 z 3 ( i = 0 k 1 1 ( q z ) i ) 2 ( i = 0 k 2 1 ( q z ) i ) + z 2 p z 2 i = 0 k 1 1 ( q z ) i + p 2 z 3 ( i = 0 k 1 1 ( q z ) i ) 2 )   n = 0 R n z n   + ( p z 2 ( i = 0 k 2 1 ( q z ) i ) 2 p 2 z 3 ( i = 0 k 1 1 ( q z ) i ) ( i = 0 k 2 1 ( q z ) i ) + p 3 z 4 ( i = 0 k 1 1 ( q z ) i ) 2 ( i = 0 k 2 1 ( q z ) i ) ) n = 0 R n z n = 0   .
We next collect together the reliability terms having the same low index and the outcome we are looking for is readily deduced by applying some simple algebraic operations. □
In order to apply the recurrence for determining the reliability function of the linear consecutive-k1 and k2-out-of-n structure ( k 1 < k 2 ) provided in Equation (8), a suitable set of initial conditions is needed. Please note that the initial conditions that follow are algebraically necessary for implying the proposed recursive scheme. However, these initial cases correspond to reliability structures without any practical interest in real applications. For example, if the total number of components is no greater than the parameter k 1 or k 2 , then we readily deduce that the resulting structure never fails. In other words, it is evident that if n < k 1 or n < k 2 , then at least one of the failure criteria of the linear consecutive-k1 and k2-out-of-n structure cannot be fulfilled. This means that, given that n < k 1 or n < k 2 , the reliability function of the linear consecutive-k1 and k2-out-of-n system is equal to 1. Finally, if the parameter n equals k2, then the underlying structure behaves actually as the traditional parallel system. One may easily deduce that the latter cases mentioned above could not be discussed as existing structures, and that we need their reliability in order to run the proposed recurrence. The sufficient group for setting forth the recursive relation in (8) is given as
R n = { 1 , if 0 < n < k 2 , 1 , if 0 < n < k 1 , 1 ( 1 p ) k 2 , if n = k 2 .
Apart from the abovementioned conditions, if additional calculations are needed for running the recurrence, then these computations could be covered by the aid of the traditional definition of the signature vector of a coherent system with independent and identically distributed components (see, e.g., [34]).
We next apply Proposition 2 in order to determine the reliability polynomial of the linear consecutive-k1 and k2-out-of-n system for specific designs. Table 1 displays the corresponding results of the linear consecutive-k1 and k2-out-of-n structures for different values of their design parameters.
By casting a glance at the abovementioned results, one may deduce some interesting conclusions about the reliability function of the underlying structure. Based on Table 1, we next construct several figures, in order to reveal the impact of the design parameters n , k 1 , k 2 on the reliability behavior of the linear consecutive-k1 and k2-out-of-n system.
Figure 1 displays the reliability polynomial of the linear consecutive k1 and k2-out-of-n systems consisting of i.i.d. components under specified values of design parameters n, k1 versus the common reliability of its components. Generally speaking, as the reliability polynomial of a structure increases, its credence strengthens. Consequently, when we compare the performance of two or more systems, we look at their corresponding reliability polynomials and conclude that the frontrunner is the structure which exhibits the larger reliability values.
The above figure reveals the impact of the design parameter k2 on the reliability of the resulting linear structure. More precisely, three different designs are depicted in Figure 1, namely the structures under the design parameter k2 = 3, 4, and 5 (k2 = 3: Green, k2 = 4: Blue, k2 = 5: Red). It is quite clear that the reliability polynomial under the design parameter k2 = 5 (Red color line) exceeds the remaining polynomials displayed in Figure 1. More specifically, it seems that the polynomials under the design parameters k2 = 4 (Blue color line) and k2 = 3 (Green color line) lag behind. Therefore, based on the above figure, it is readily observed that the reliability of the linear consecutive-k1 and k2-out-of-n system increases as the design parameter k2 increases (given that the remaining design parameters do not change).
In addition, it is of some interest to investigate the impact of parameter k1 on the reliability of the consecutive-k1 and k2-out-of-n structure. For this reason, we next depict the reliability polynomial of the aforementioned system under three different designs.
More precisely, the parameters k2 and n are chosen to be common, namely k2 = 3 and n = 6, while the design parameter k1 ranges from 1 to 3 (k1 = 1: Green, k1 = 2: Blue, k1 = 3: Red). As already mentioned, larger values of the reliability polynomial indicate a more reliable structure. Having that in mind, we observe that the reliability polynomial under the design parameter k1 = 3 (Red color line) exceeds the remaining polynomials displayed in Figure 2. More specifically, it seems that the polynomials under the design parameters k1 = 2 (Blue color line) and k1 = 1 (Green color line) fall short. Consequently, based on Figure 2, we conclude that the reliability of the linear consecutive-k1 and k2-out-of-n system increases as the design parameter k1 increases (given that the remaining design parameters do not change).
Furthermore, in order to shed light on the influence of parameter n over the reliability of the resulting system, we compare the polynomials, which correspond to structures of different order with common parameters k1 and k2.
In other words, after determining the latter parameters as k1 = 2 and k2 = 4, we then display the reliability function of the resulting systems of order n = 6 (Red line), 7 (Blue line) and 8 (Green line) respectively. We then notice that the reliability polynomial of order n = 6 (Red color line) outcompetes the remaining polynomials displayed in Figure 3. More precisely, it seems that the polynomials of order n = 7 (Blue color line) and n = 8 (Green color line) give smaller reliability values in comparison with the corresponding ones of the structure with parameter n = 6 (Red color line). Therefore, based on Figure 3, one may readily observe that as the parameter n increases, the reliability function decreases.
In addition, Figure 4 depicts the reliability polynomial of several well-known consecutive-type structures. In order to accomplish some figure-based comparisons, we consider different reliability systems of order n = 6 consisting of i.i.d. components. More precisely, the reliability structures appearing in Figure 4 are given as:
  • the linear < 6 , 3 , 2 > system (Black color line)
  • the linear ( 6 , 3 , 2 ) system (Purple color line)
  • the 4-out-of-6: F system (Yellow color line)
  • the consecutive 3-out-of-6: F system (Brown color line)
  • the 2-within-consecutive-3-out-of-6: F system (Green color line)
  • the 2-consecutive 2-out-of-6: F system (Blue color line)
  • the consecutive-1 and 3-out-of-6 system (Red color line)
  • the consecutive-2 and 3-out-of-6 system (Pink color line)
In order to draw conclusions referring to the abovementioned competitive structures, we recall once again that as the reliability polynomial of a system increases, its performance is appraised more favorable. Consequently, in order to examine the performance of the systems appearing in Figure 4, we study their corresponding reliability polynomials and, based on the above figure, the following useful remarks can be stated:
  • the consecutive-2 and 3-out-of-6 system outperforms all competitive structures of order 6 for all cases examined;
  • the 2-within-consecutive-3-out-of-6: F system seems to exhibits the weakest performance in comparison with the other structures of order 6 appearing in the same figure;
  • the consecutive-2 and 3-out-of-6 system outperforms the linear <6,3,2> system, the linear (6,3,2) system, and the 2-within-consecutive-3-out-of-6: F structure, while it seems to be competitive with the 4-out-of-6: F system and the consecutive 3-out-of-6: F structure. However, the consecutive-2 and 3-out-of-6 system exhibits a clearly weaker performance versus the 2-consecutive 2-out-of-6: F structure and the consecutive-1 and 3-out-of-6 system.
The following proposition provides a recurrence relation in terms of the design parameter n for determining the coordinates of the signature vector of the linear consecutive-k1 and k2-out-of-n structure.
Proposition 3.
The coordinates s i ( n , k 1 , k 2 ) of the signature vector of the linear consecutive k1 and k2-out-of-n ( k 1 < k 2 ) structure consisting of n i.i.d. components serves the next recursive scheme
a i ( n ) + a i 1 ( n ) 5 ( a i 2 ( n 1 ) + a i ( n 1 ) a i 5 ( n 4 ) a i ( n 4 ) a i m 2 ( n m 5 ) ) 40 ( a i 3 ( n 3 ) + a i 1 ( n 3 ) ) 10 ( a i 1 ( n 1 ) a i 3 ( n 2 ) a i ( n 2 ) + a i 4 ( n 3 ) + a i ( n 3 ) ) + 42 a i k m 2 ( n m k 4 ) a i 2 m 4 ( n 2 m 5 ) + 30 ( a i 2 ( n 2 ) + a i 1 ( n 2 ) + a i m 2 ( n m 3 ) a i m 2 ( n m 4 ) + a i k 2 ( n k 5 ) + a i k 3 ( n k 5 ) ) 60 a i 2 ( n 3 ) + 25 ( a i 4 ( n 4 ) + a i 1 ( n 4 ) ) + 30 ( a i k m 1 ( n m k 4 ) a i k m 1 ( n m k 3 ) ) + 18 ( a i k ( n k 3 ) + a i k 3 ( n k 3 ) ) + 54 ( a i k 1 ( n k 3 ) + a i k 2 ( n k 3 ) a i 2 k 1 ( n 2 k 3 ) ) + 18 ( a i 2 k 2 ( n 2 k 5 ) a i k m 2 ( n m k 3 ) a i k m 3 ( n m k 4 ) a i k m 2 ( n m k 2 ) ) + 18 ( a i k m 3 ( n m k 5 ) a i m 2 k 1 ( n m 2 k 4 ) ) + 50 ( a i 3 ( n 4 ) + a i 2 ( n 4 ) ) a i 6 ( n 5 ) 6 ( a i 5 ( n 5 ) + a i 1 ( n 5 ) + a i m ( n m 2 ) a i m ( n m 3 ) + a i 2 m 2 ( n 2 m 3 ) + a i 2 m 2 ( n 2 m 5 ) ) + 6 ( a i k m ( n m k 2 ) + a i k m 1 ( n m k 2 ) + a i k m ( n m k 4 ) a i k m 1 ( n m k 5 ) ) 6 ( a i k 2 m 2 ( n 2 m k 4 ) a i 2 k m 3 ( n m 2 k 5 ) + a i 2 k ( n 2 k 4 ) ) 15 ( a i 4 ( n 5 ) + a i 2 ( n 5 ) a i k 1 ( n k 5 ) a i k 4 ( n k 5 ) ) 20 a i 3 ( n 5 ) a i ( n 5 ) + a i 3 k ( n 3 k 3 ) + a i 3 k 1 ( n 3 k 3 ) 14 ( a i m 1 ( n m 2 ) + a i m 1 ( n m 4 ) ) a i 2 m ( n 2 m 5 ) + 2 ( a i m ( n m 1 ) + a i m 1 ( n m ) a i m ( n m 4 ) + a i m 5 ( n m 5 ) a i 3 k ( n 3 k 4 ) a i 3 k 2 ( n 3 k 4 ) ) 8 ( a i m 2 ( n m 2 ) + a i m 4 ( n m 4 ) ) + a i m 1 ( n m 5 ) + a i 2 m ( n 2 m 2 ) + a i 2 m 1 ( n 2 m 2 ) + 24 ( a i m 1 ( n m 3 ) + a i k 1 ( n k 2 ) ) + 27 ( a i 2 k 1 ( n 2 k 4 ) + a i 2 k 2 ( n 2 k 4 ) ) 26 a i m 3 ( n m 4 ) 48 ( a i k 1 ( n k 4 ) + a i k 3 ( n k 4 ) ) 72 a i k 2 ( n k 4 ) + 9 ( a i m 3 ( n m 5 ) a i 2 m 1 ( n 2 m 3 ) + a i 2 m 1 ( n 2 m 4 ) + a i 2 m 2 ( n 2 m 4 ) a i 2 k ( n 2 k 3 ) ) + 9 ( a i 2 k 2 ( n 2 k 3 ) a i 2 k 3 ( n 2 k 4 ) + a i k 2 m 1 ( n 2 m k 5 ) + a i k 2 m 2 ( n 2 m k 5 ) ) + 7 a i m 4 ( n m 5 ) + a i 3 k ( n 3 k 5 ) + a i 3 k 3 ( n 3 k 5 ) + a i 3 k 2 m ( n 2 m 3 k 5 ) + a i 3 k 2 m 1 ( n 2 m 3 k 5 ) 3 ( a i 2 m ( n 2 m 3 ) a i 2 m ( n 2 m 4 ) a i 2 m 3 ( n 2 m 4 ) a i k ( n k ) a i k 1 ( n k 1 ) a i 3 k 2 ( n 3 k 5 ) ) + 3 ( a i 2 k ( n 2 k 2 ) + a i 2 k 1 ( n 2 k 2 ) 3 a i 2 k ( n 2 k 5 ) a i 2 k 4 ( n 2 k 5 ) + a i 3 k 1 ( n 3 k 5 ) ) + 3 ( a i k 2 m ( n 2 m k 3 ) + a i k 2 m 1 ( n 2 m k 3 ) + a i k 2 m ( n 2 m k 5 ) + a i k 2 m 3 ( n 2 m k 5 ) ) 4 ( a i 2 m 1 ( n 2 m 5 ) + a i 2 m 3 ( n 2 m 5 ) + a i 3 k 1 ( n 3 k 4 ) ) 3 ( a i k ( n k 5 ) + a i k 5 ( n k 5 ) ) 12 ( a i k ( n k 2 ) a i m 3 ( n m 3 ) + a i k 2 ( n k 2 ) + a i k ( n k 4 ) + a i k 4 ( n k 4 ) + a i 2 k 1 ( n 2 k 5 ) ) 12 ( a i k m ( n m k 3 ) + a i k 2 m 1 ( n 2 m k 4 ) + a i m 2 k 2 ( n m 2 k 4 ) a i m 2 k 2 ( n m 2 k 5 ) ) 12 ( a i 2 k 3 ( n 2 k 5 ) + a i 2 k m 2 ( n m 2 k 5 ) ) + 6 a i 2 k m 1 ( n m 2 k 5 ) + 3 ( a i 2 k 2 m ( n 2 m 2 k 4 ) + a i 2 k 2 m 1 ( n 2 m 2 k 4 ) a i 2 k 2 m ( n 2 m 2 k 5 ) a i 2 k 2 m 2 ( n 2 m 2 k 5 ) ) 6 ( a i 2 k 2 m 1 ( n 2 m 2 k 5 ) a i m 2 k ( n m 2 k 3 ) a i m 2 k ( n m 2 k 4 ) + a i k 2 m ( n 2 m k 4 ) ) + 2 ( a i 3 k m ( n m 3 k 4 ) + a i 3 k m 1 ( n m 3 k 4 ) a i 3 k m 1 ( n m 3 k 5 ) a i 3 k m 2 ( n m 3 k 5 ) ) = 0 .
where
k = k 1 , m = k 2 , a i ( n ) = i ( n i ) s i ( n , k 1 , k 2 ) ,   i = 1 , 2 , , n
Proof. 
It is evident that the double generating function of the coordinates of the signature vector multiplied by some binomial coefficients, namely of the quantities i   ( n i )   s i ( n ) , 1 i n is related to R ( z ; p ) via the following equality [39]:
n = 1 i = 1 n i ( n i )   s i ( n )   t i x n = t x R ( x ( 1 + t ) ; 1 1 + t ) x t ( t + 1 ) R ( x ( 1 + t ) ; 1 1 + t ) t
Substituting the generating function R ( z ; p ) given by formula (3) in Equation (10) we may write
n = 1 i = 1 n i ( n i )   s i ( n , k 1 , k 2 )   t i x n = Q ( 1 + t ) ( 1 x ( 1 + t ( t x ) k 1 ) ) 3 ( 1 x ( 1 + t ( t x ) k 2 ) ) 2
where s i ( n , k 1 , k 2 ) corresponds to the i-th coordinate of the signature vector of the linear consecutive-k1 and k2-out-of-n ( k 1 < k 2 ) structure consisting of n i.i.d. components, while
Q = t k 2 x k 2 1 ( 2 ( t k 1 ) ( 1 t x ) 2 ( 1 x t x ) ( 1 + t ) ( 1 x ( 1 + t ( t x ) k 2 ) ) 2 ) × ( ( 1 t x ) ( 2 k 1 k 2 ( 3 3 k 1 + k 2 ) t 4 t 2 + t x ( t + 1 ) ( 4 t + 2 3 k 1 + k 2 ) ) × ( ( 1 x ( 1 + t ( t x ) k 1 ) ) ( 1 x ( 1 + t ( t x ) k 2 ) ) 2 ) × ( t ( k 2 k 1 + 1 + t x ( 2 t + k 2 k 1 ) ) ( 1 x ( 1 + t ( t x ) k 1 ) ) 2 ( 1 x ( 1 + t ( t x ) k 2 ) ) 2 ) × ( ( k 2 k 2 t x t x ( 1 ( t x ) k 2 ) 2 ( 1 x ( 1 + t ( t x ) k 1 ) ) 3 ) .
We next denote
a i ( n ) = i ( n i ) s i ( n , k 1 , k 2 ) , i = 1 , 2 , , n
and Equation (11) takes on the following form:
( 1 + t ) ( 1 x ( 1 + t ( t x ) k 1 ) ) 3 ( 1 x ( 1 + t ( t x ) k 2 ) ) 2 n = 1 i = 1 n a i ( n ) t i x n = Q
or equivalently:
( 1 + t ) ( j = 0 3 ( 3 j ) c k 1 j ) ( l = 0 2 ( 2 l ) c k 2 l ) n = 1 i = 1 n a i ( n ) t i x n = Q
where
c h = x ( 1 + t ( t x ) h ) ,   h = k 1 , k 2 .
Looking carefully at the above form of Q, we can readily observe that the coefficients of x n on the left hand side of Equation (12) should vanish for n > 8 k 2 + 6 k 1 + 18 . Consequently, we may verify that
( 1 ( 3 t + 3 ) x + ( 3 t 2 + 6 t + 3 ) x 2 ( t 3 + 3 t 2 + 3 t + 1 ) x 3 + 3 t k 1 x k 1 + 1 ( 6 t k 1 + 1 + 6 t k 1 ) x k 1 + 2 + ( 3 t k 1 + 2 + 6 t k 1 + 1 + 3 t k 1 ) x k 1 + 3 + 3 t 2 k 1 x 2 k 1 + 2 ( 3 t 2 k 1 + 1 + 3 t 2 k 1 ) x 2 k 1 + 3 + t 3 k 1 x 3 k 1 + 3 ) × ( 1 ( 2 t + 2 ) x + ( t 2 + 2 t + 1 ) x 2 + 2 t k 2 x k 2 + 1 2 t k 2 + 1 x k 2 + 2 + t 2 k 2 x 2 k 2 + 2 ) ( 1 + t ) n = 1 i = 1 n a i ( n ) t i x n = 0
The recursive scheme we are looking for is readily deduced after several algebraic manipulations. □
Please note that in order to apply the recurrence for determining the signature vector of the linear consecutive k1 and k2-out-of-n ( k 1 < k 2 ) structure provided by the recurrence appeared in (9), a suitable set of initial conditions is needed. These values can be obtained by exploiting the same scheme and setting s i ( n , k 1 , k 2 ) = 0 if i 0 ,   n 0 ,   i < k 2 , n < k 1 or n < k 2 , or in the event of deriving a negative value of s i ( n , k 1 , k 2 ) . It is evident that the latter cases mentioned above (e.g., n < k 2 ) correspond to reliability structures without any practical interest, but we need their signature vectors in order to run the proposed recurrence.
Table 2 displays the signature vectors of linear consecutive-k1 and k2-out-of-n structures for different values of their design parameters. More specifically, we next compute the signatures of the consecutive-k1 and k2-out-of-n systems of order n = 4,5,…,10 and several specified values of the remaining parameters k1 and k2.
By casting a glance at the abovementioned numerical results, one may deduce some interesting conclusions about the behavior of the underlying reliability structure. For example, let us focus on the special case n = 10 , k 1 = 3 , k 2 = 5 ; namely let us assume that the underlying structure consists of n = 10 independent and identically distributed components and the system fails if and only if there exist at least k 1 = 3 and k 2 = 5 consecutive non-overlapping failed ones. As readily concluded, the aforementioned structure fails at the 8th ordered failure of its components with probability 38%, while it fails at the 9th ordered component’s failure with probability equal to 42%. Finally, the consecutive-3 and 5-out-of-10 structure manages to operate even if nine components have failed, with probability 20%. Similar conclusions could be drawn by the aid of the remaining numerical outcomes of the above table.

4. Discussion

In the present manuscript, the consecutive k1 and k2-out-of-n ( k 1 < k 2 ) structure with independent and identically distributed components ordered in a line is investigated. The main motivation of the present paper is to deliver the generating function of the reliability for the linear consecutive-k1 and k2-out-of-n system. The aforementioned result has not appeared in the literature so far and is now offered by Proposition 1 of the present manuscript.
Based on the theoretical results proved in previous sections, recursive schemes for calculating the reliability function and the signature of the linear consecutive-k1 and k2-out-of-n ( k 1 < k 2 ) structure are provided. The figure-based and numerical results which are illustrated reveal the impact of the design parameters on the reliability polynomial and the signature vector of the underlying structure. More precisely, the linear consecutive k1 and k2-out-of-n system exhibits better performance for larger values of the design parameters k1 and k2, while it seems that its competency weakens as the parameter n increases. Furthermore, the linear consecutive-k1 and k2-out-of-n structure seems to be competitive versus several consecutive-type reliability systems. Indeed, the linear consecutive-k1 and k2-out-of-n structure has been proved to be more reliable, for all cases considered, in comparison with the traditional k-out-of-n: F structure, the consecutive-k-out-of-n: F system or even against more complicated structures, such as the r-within-consecutive-k-out-of-n: F or the m-consecutive-k-out-of-n: F system. The reliability study of the circular consecutive-k1 and k2-out-of-n ( k 1 < k 2 ) could be an interesting topic for future research.

Funding

This research received no external funding.

Acknowledgments

The author is grateful to three anonymous referees for their constructive comments and suggestions that led to a substantial improvement of the paper.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Derman, C.; Lieberman, G.J.; Ross, S.M. On the consecutive-k-out-of-n: F system. IEEE Trans. Reliab. 1982, 31, 57–63. [Google Scholar] [CrossRef]
  2. Triantafyllou, I.S.; Koutras, M.V. On the signature of coherent systems and applications for consecutive-k-out-of-n: F systems. In Advances in Mathematical Modeling for Reliability; Bedford, T., Quigley, J., Walls, L., Alkali, B., Daneshkhah, A., Hardman, G., Eds.; IOS Press: Amsterdam, The Netherlands, 2008; pp. 119–128. [Google Scholar]
  3. Tong, Y.L. A rearrangement inequality for the longest run, with an application to network reliability. J. Appl. Probab. 1985, 22, 386–393. [Google Scholar] [CrossRef]
  4. Griffith, W.S. On consecutive-k-out-of-n: Failure systems and their generalizations. In Reliability and Quality Control; Basu, A.P., Ed.; Elsevier: Amsterdam, The Netherlands, 1986; pp. 157–165. [Google Scholar]
  5. Triantafyllou, I.S.; Koutras, M.V. Signature and IFR preservation of 2-within-consecutive k-out-of-n:F systems. IEEE Trans. Reliab. 2011, 60, 315–322. [Google Scholar] [CrossRef]
  6. Makri, F.S.; Philippou, A.N. Exact reliability formulas for linear and circular m-consecutive-k-out-of-n: F systems. Microelectron. Reliab. 1996, 36, 657–660. [Google Scholar] [CrossRef]
  7. Eryilmaz, S.; Koutras, M.V.; Triantafyllou, I.S. Signature based analysis of m-consecutive k-out-of-n: F systems with exchangeable components. Nav. Res. Logist. 2011, 58, 344–354. [Google Scholar] [CrossRef]
  8. Zhao, X.; Cui, L.; Kuo, W. Reliability for sparsely connected consecutive-k systems. IEEE Trans. Reliab. 2007, 56, 516–524. [Google Scholar] [CrossRef]
  9. Shen, J.; Cui, L. Reliability and Birnbaum importance for sparsely connected circular consecutive-k systems. IEEE Trans. Reliab. 2015, 64, 1140–1157. [Google Scholar] [CrossRef]
  10. Dafnis, S.D.; Makri, F.S.; Philippou, A.N. The reliability of a generalized consecutive system. Appl. Math. Comput. 2019, 359, 186–193. [Google Scholar] [CrossRef]
  11. Cui, L.; Lin, C.; Du, S. m-consecutive-k,l-out-of-n systems. IEEE Trans. Reliab. 2015, 64, 386–393. [Google Scholar] [CrossRef]
  12. Tung, S.S. Combinatorial analysis in determining reliability. In Proceedings of the Annual Reliability and Maintainability Symposium, Los Angeles, CA, USA, 24–27 January 2002. [Google Scholar]
  13. Chang, J.G.; Cui, L.; Hwang, F.K. Reliabilities for (n,f,k) systems. Stat. Probab. Lett. 1999, 43, 237–242. [Google Scholar] [CrossRef]
  14. Zuo, M.J.; Lin, D.; Wu, Y. Reliability evaluation of combined k-out-of-n:F, consecutive-k-out-of-n:F and linear connected-(r,s)-out-of- (m,n):F system structures. IEEE Trans. Reliab. 2000, 49, 99–104. [Google Scholar] [CrossRef]
  15. Triantafyllou, I.S.; Koutras, M.V. Reliability properties of (n,f,k) systems. IEEE Trans. Reliab. 2014, 63, 357–366. [Google Scholar] [CrossRef]
  16. Gera, A.E. Combined k-out-of-n:G and consecutive-k-out-of-n:G systems. IEEE Trans. Reliab. 2004, 53, 523–531. [Google Scholar] [CrossRef]
  17. Mohan, P.; Agarwal, M.; Sen, K. Combined m-consecutive-k-out-of-n:F & consecutive-kc-out-of-n:F systems. IEEE Trans. Reliab. 2009, 58, 328–337. [Google Scholar]
  18. Eryilmaz, S.; Zuo, M.J. Constrained (k,d)-out-of-n systems. Int. J. Syst. Sci. 2010, 41, 679–685. [Google Scholar] [CrossRef]
  19. Triantafyllou, I.S. On the lifetime and signature of the constrained (k,d) out-of-n:F reliability systems. Int. J. Math. Eng. Manag. Sci. 2020. accepted for publication. [Google Scholar]
  20. Cui, L.; Xie, M. On a generalized k-out-of-n system and its reliability. Int. J. Syst. Sci. 2005, 36, 267–274. [Google Scholar] [CrossRef]
  21. Eryilmaz, S.; Tuncel, A. Computing the signature of a generalized k-out-of-n system. IEEE Trans. Reliab. 2015, 64, 766–771. [Google Scholar] [CrossRef]
  22. Cui, L.; Kuo, W.; Li, J.; Xie, M. On the dual reliability systems of (n,f,k) and <n,f,k>. Stat. Probab. Lett. 2006, 76, 1081–1088. [Google Scholar] [CrossRef]
  23. Triantafyllou, I.S. Reliability study of <n,f,2> systems: A generating function approach. Int. J. Math. Eng. Manag. Sci. 2020. accepted for publication. [Google Scholar]
  24. Chao, M.T.; Fu, J.C.; Koutras, M.V. Survey of reliability studies of consecutive-k-out-of-n: F & related systems. IEEE Trans. Reliab. 1995, 44, 120–127. [Google Scholar]
  25. Eryilmaz, S. Review of recent advances in reliability of consecutive-k-out-of-n: F and related systems. Proc. Inst. Mech. Eng. Part O J. Risk Reliab. 2010, 224, 225–237. [Google Scholar]
  26. Triantafyllou, I.S. Consecutive-type reliability systems: An overview and some applications. J. Qual. Reliab. Eng. 2015. [Google Scholar] [CrossRef]
  27. Kuo, W.; Zuo, M.J. Optimal Reliability Modeling: Principles and Applications; John Wiley & Sons: Hoboken, NJ, USA, 2003. [Google Scholar]
  28. Chang, J.G.; Cui, L.; Hwang, F.K. Reliabilities of Consecutive-k Systems; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  29. Ram, M. On system reliability approaches: A brief survey. Int. J. Syst. Assur. Eng. Manag. 2013, 4, 101–117. [Google Scholar] [CrossRef]
  30. Zhao, X.; Cui, L.; Yang, X. A consecutive k1 and k2-out-of-n system and its reliability. In Advanced Reliability Modeling II; Yun, W.Y., Dohi, T., Eds.; World Scientific: Singapore, 2006; pp. 97–103. [Google Scholar]
  31. Koutras, M.V. On a Markov chain approach for the study of reliability structures. J. Appl. Probab. 1996, 33, 357–367. [Google Scholar] [CrossRef]
  32. Fu, J.C.; Lou, W.Y.W. Distribution Theory of Runs and Patterns and its Applications: A finite Markov Chain Approach; World Scientific: Singapore, 2003. [Google Scholar]
  33. Zhao, X.; Cui, L.R. On the accelerated scan finite Markov chain imbedding approach. IEEE Trans. Reliab. 2009, 58, 383–388. [Google Scholar] [CrossRef]
  34. Samaniego, F.J. On closure of the IFR class under formation of coherent systems. IEEE Trans. Reliab. 1985, 34, 69–72. [Google Scholar] [CrossRef]
  35. Kochar, S.; Mukerjee, H.; Samaniego, F.J. The signature of a coherent system and its application to comparison among systems. Nav. Res. Logist. 1999, 46, 507–523. [Google Scholar] [CrossRef]
  36. Kumar, A.; Ram, M. Signature reliability of k-out-of-n sliding window system. In Modeling and Simulation based Analysis in Reliability Engineering; Ram, M., Ed.; CRC Press: Boca Raton, FL, USA, 2018; pp. 233–247. [Google Scholar]
  37. Kumar, A.; Ram, M. Signature of linear consecutive k-out-of-n systems. In Systems Engineering: Reliability Analysis Using k-out-of-n Structures; Ram, M., Dohi, T., Eds.; CRC Press: Boca Raton, FL, USA, 2019; pp. 207–216. [Google Scholar]
  38. Kumar, A.; Ram, M.; Singh, S.B. Signature reliability evaluations: An overview of different systems. In Reliability Engineering: Methods and Applications; Ram, M., Ed.; CRC Press: Boca Raton, FL, USA, 2019; pp. 421–438. [Google Scholar]
  39. Triantafyllou, I.S.; Koutras, M.V. On the signature of coherent systems and applications. Probab. Eng. Inf. Sci. 2008, 22, 19–35. [Google Scholar] [CrossRef]
Figure 1. The reliability polynomial of the linear consecutive-2 and k2-out-of-8 systems (k2 = 3,4,5).
Figure 1. The reliability polynomial of the linear consecutive-2 and k2-out-of-8 systems (k2 = 3,4,5).
Mathematics 08 00630 g001
Figure 2. The reliability polynomial of the linear consecutive- k1 and 3-out-of-6 systems (k1 = 1,2,3).
Figure 2. The reliability polynomial of the linear consecutive- k1 and 3-out-of-6 systems (k1 = 1,2,3).
Mathematics 08 00630 g002
Figure 3. The reliability polynomial of the linear consecutive-2 and 4-out-of-n systems (n = 6,7,8).
Figure 3. The reliability polynomial of the linear consecutive-2 and 4-out-of-n systems (n = 6,7,8).
Mathematics 08 00630 g003
Figure 4. The reliability polynomial of several consecutive-type systems of order n = 6.
Figure 4. The reliability polynomial of several consecutive-type systems of order n = 6.
Mathematics 08 00630 g004
Table 1. Reliability polynomial of consecutive-k1 and k2-out-of-n systems for different values of n , k 1 , k 2 .
Table 1. Reliability polynomial of consecutive-k1 and k2-out-of-n systems for different values of n , k 1 , k 2 .
n ( k 1 , k 2 ) Reliability Polynomial
4(1,2) 6 p 2 8 p 3 + 3 p 4
4(1,3) 4 p 6 p 2 + 4 p 3 p 4
5(1,2) 0.5 p 2 + 8.5 p 3 13.5 p 4 + 5.5 p 5
5(1,3) p + 6 p 2 14 p 3 + 11 p 4 3 p 5
5(1,4) 5 p 10 p 2 + 10 p 3 5 p 4 + p 5
6(1,2) 0.66 p 3 + 13.02 p 4 22.02 p 5 + 9.34 p 6
6(1,3) 3 p 2 + 8 p 3 27 p 4 + 24 p 5 7 p 6
6(1,4) 1.98 p + 5.1 p 2 20.2 p 3 + 25.2 p 4 14.1 p 5 + 3.02 p 6
6(1,5) 6 p 15 p 2 + 20 p 3 15 p 4 + 6 p 5 p 6
6(2,3) 1.98 p + 5.1 p 2 20.2 p 3 + 25.2 p 4 14.1 p 5 + 3.02 p 6
6(2,4) 6 p 15 p 2 + 20 p 3 15 p 4 + 6 p 5 p 6
7(2,3) 6.006 p 2 + 4.97 p 3 44.94 p 4 + 65.94 p 5 39.97 p 6 + 8.994 p 7
7(2,4) 3.003 p + 2.982 p 2 24.955 p 3 + 44.94 p 4 38.955 p 5 + 16.982 p 6 2.997 p 7
7(2,5) 7 p 21 p 2 + 35 p 3 35 p 4 + 21 p 5 7 p 6 + p 7
7(3,4) 7 p 21 p 2 + 35 p 3 35 p 4 + 21 p 5 7 p 6 + p 7
8(2,3) 1.344 p 2 1.4 p 3 + 56.84 p 4 184.24 p 5 + 233.52 p 6 134.744 p 7 + 29.68 p 8
8(2,4) 9.492 p 2 0.952 p 3 67.62 p 4 + 146.16 p 5 137.62 p 6 + 63.048 p 7 11.508 p 8
8(2,5) 4 p 28 p 3 + 70 p 4 84 p 5 + 56 p 6 20 p 7 + 3 p 8
8(2,6) 8 p 28 p 2 + 56 p 3 70 p 4 + 56 p 5 28 p 6 + 8 p 7 p 8
8(3,4) 4 p 28 p 3 + 70 p 4 84 p 5 + 56 p 6 20 p 7 + 3 p 8
8(3,5) 8 p 28 p 2 + 56 p 3 70 p 4 + 56 p 5 28 p 6 + 8 p 7 p 8
9(2,5) 0.99 p + 15.12 p 2 49.56 p 3 + 50.4 p 4 + 18.9 p 5 89.04 p 6 + 83.88 p 7 35.64 p 8 + 5.95 p 9
9(2,6) 4.95 p 3.6 p 2 29.4 p 3 + 100.8 p 4 157.5 p 5 + 142.8 p 6 77.4 p 7 + 23.4 p 8 3.05 p 9
9(2,7) 9 p 36 p 2 + 84 p 3 126 p 4 + 126 p 5 84 p 6 + 36 p 7 9 p 8 + p 9
9(3,4) 1.98 p + 3.96 p 2 + 0.84 p 3 73.08 p 4 + 201.6 p 5 257.88 p 6 + 179.64 p 7 66.24 p 8 + 10.18 p 9
9(3,5) 4.95 p 3.6 p 2 29.4 p 3 + 100.8 p 4 157.5 p 5 + 142.8 p 6 77.4 p 7 + 23.4 p 8 3.05 p 9
9(3,6) 9 p 36 p 2 + 84 p 3 126 p 4 + 126 p 5 84 p 6 + 36 p 7 9 p 8 + p 9
10(3,5) 2 p + 9.9 p 2 31.2 p 3 16.8 p 4 + 201.6 p 5 399 p 6 + 405.6 p 7 235.8 p 8 + 74.8 p 9 10.1 p 10
10(3,6) 6 p 9 p 2 24 p 3 + 126 p 4 252 p 5 + 294 p 6 216 p 7 + 99 p 8 26 p 9 + 3 p 10
10(3,7) 10 p 45 p 2 + 120 p 3 210 p 4 + 252 p 5 210 p 6 + 120 p 7 45 p 8 + 10 p 9 p 10
Table 2. Signature vector of consecutive-k1 and k2-out-of-n systems for different designs.
Table 2. Signature vector of consecutive-k1 and k2-out-of-n systems for different designs.
n ( k 1 , k 2 ) Signature Vector n ( k 1 , k 2 ) Signature Vector
4(1,2) ( 0 , 0 , 1 , 0 ) 8(2,3) ( 0 , 0 , 0 , 0 , 0.881 , 0.071 , 0.048 , 0 )
4(1,3) ( 0 , 0 , 0 , 1 ) 8(2,4) ( 0 , 0 , 0 , 0 , 0 , 0.661 , 0.339 , 0 )
5(1,2) ( 0 , 0 , 0.95 , 0.05 , 0 ) 8(2,5) ( 0 , 0 , 0 , 0 , 0 , 0 , 0.5 , 0.5 )
5(1,3) ( 0 , 0 , 0 , 0.8 , 0.2 ) 8(2,6) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 )
5(1,4) ( 0 , 0 , 0 , 0 , 1 ) 8(3,4) ( 0 , 0 , 0 , 0 , 0 , 0 , 0.5 , 0.5 )
6(1,2) ( 0 , 0 , 0.967 , 0.033 , 0 , 0 ) 8(3,5) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 )
6(1,3) ( 0 , 0 , 0 , 0.8 , 0.2 , 0 ) 9(2,5) ( 0 , 0 , 0 , 0 , 0 , 0 , 0.36 , 0.53 , 0.11 )
6(1,4) ( 0 , 0 , 0 , 0 , 0.67 , 0.33 ) 9(2,6) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0.45 , 0.55 )
6(1,5) ( 0 , 0 , 0 , 0 , 0 , 1 ) 9(2,7) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 )
6(2,3) ( 0 , 0 , 0 , 0 , 0.67 , 0.33 ) 9(3,4) ( 0 , 0 , 0 , 0 , 0 , 0 , 0.45 , 0.33 , 0.22 )
6(2,4) ( 0 , 0 , 0 , 0 , 0 , 1 ) 9(3,5) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0.45 , 0.55 )
7(2,3) ( 0 , 0 , 0 , 0 , 0.714 , 0.286 , 0 ) 9(3,6) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 )
7(2,4) ( 0 , 0 , 0 , 0 , 0 , 0.571 , 0.429 ) 10(3,5) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0.38 , 0.42 , 0.2 )
7(2,5) ( 0 , 0 , 0 , 0 , 0 , 0 , 1 ) 10(3,6) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0.4 , 0.6 )
7(3,4) ( 0 , 0 , 0 , 0 , 0 , 0 , 1 ) 10(3,7) ( 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 1 )

Share and Cite

MDPI and ACS Style

Triantafyllou, I.S. On the Consecutive k1 and k2-out-of-n Reliability Systems. Mathematics 2020, 8, 630. https://doi.org/10.3390/math8040630

AMA Style

Triantafyllou IS. On the Consecutive k1 and k2-out-of-n Reliability Systems. Mathematics. 2020; 8(4):630. https://doi.org/10.3390/math8040630

Chicago/Turabian Style

Triantafyllou, Ioannis S. 2020. "On the Consecutive k1 and k2-out-of-n Reliability Systems" Mathematics 8, no. 4: 630. https://doi.org/10.3390/math8040630

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop