Preprint
Article

Stochastic Orderings of the Idle time of Inactive Standby Systems

Altmetrics

Downloads

89

Views

19

Comments

0

This version is not peer-reviewed

Submitted:

31 July 2023

Posted:

01 August 2023

You are already at the latest version

Alerts
Abstract
In this paper we consider a failed cold standby systems and obtain some stochastic bounds on the idle time of such systems. It is assumed that, at a time t the failure of a cold standby system is observed, but the actual time of the failure is a time before t. The idle time of the inactive cold standby system is measured as the time between the exact time of failure, which is a random variable, and time t. We use the idle times of the components of the system to obtain lower and upper bounds on the lifetime of the standby system to which they are assembled. We bring some examples to show that the results and the conditions imposed to get them are achievable.
Keywords: 
Subject: Engineering  -   Safety, Risk, Reliability and Quality

MSC:  62N05, 90B25, 62E10, 65C20

1. Introduction and Preliminaries

The lifespan of cold standby systems can be described as longer than other types of backup systems because they are not actively operated and are therefore subject to less wear and tear. This can result in cost savings for organizations because they do not need to replace or upgrade the system as frequently. However, the life of the system can also be affected by factors such as the quality of the hardware and software used, maintenance practices, and frequency of use. Cold standby systems are commonly used in reliability to support critical systems and processes. Some applications of cold standby systems in reliability include:
1) Data backup and recovery: cold standby systems can be used to store backup data and ensure its availability in the event of a system failure or malfunction.
2) Emergency power supply: Cold standby systems can be used as a backup power supply in the event of a power failure or malfunction to ensure that critical systems remain operational.
3) Network redundancy: Cold standby systems can be used as network redundancy to ensure that critical network services remain available in the event of a network outage or failure.
4) Server redundancy: Cold standby systems can be used as server redundancy to ensure that critical applications and services remain available in the event of a server failure or defect.
5) Disaster recovery: Cold standby systems can be used as part of a disaster recovery plan to provide backup support for critical systems and processes in the event of a natural disaster or other catastrophic event.
Overall, cold standby systems are an important tool for ensuring the reliability and availability of critical systems and processes. They can help organizations minimize downtime and maintain continuity in the event of unexpected events. Cold-standby systems have recently attracted the attention of many researchers in the field of reliability enginerring (see, e.g., Wang and Ye [23], Ramezani Dobani et al. [19], Danjuma et al. [5], Malhotra et al. [16] and Lin et al. [15]).
In contrast to the residual life of a system, one of the aspects of engineering systems is their idle time. The idle time is also called the inactivity time or reversed residual lifetime. Stochastic properties of coherent systems, a large and well-known class of systems in reliability, in view of their idle time have been studied during the past decades (see, for instance, Bayramoglu and Ozkut [3], Zhang and Balakrishnan [24], Navarro et al. [17], Kayid et al. [10], Navarro and Calì [18], Salehi and Tavangar [20], Toomaj and Di Crescenzo [22], Amini-Seresht et al. [2], Guo et al. [7] and Kayid and Shrahili [11]).
Recently, Kayid and Alshehri [12] developed stochastic comparisons between the lifetime of a used cold standby system (which is still functioning) and sum of the residual lifetimes of the components in the system. Here in this paper we consider idle time of a failed cold standby system to obtain some lower/upper bound for it in terms of the idle time of the failed components in the system. As pointed out and clearly shown by Ahmad et al. [1], the results for the idle variable (the inactivity time) cannot be concluded from the similar results on the residual lifetime variable. This is the reason why we start our study in this paper. Another reason is that the properties that we obtain in this paper are quite different and cannot be acquired from the results in Kayid and Alshehri [12]. An interesting point is that in general the uncertainty in the past lifetime of an inactive coherent system is less than the uncertainty in the future lifetime and especially the remaining lifetime of a functioning coherent system. This is because the idle variable takes values at [ 0 , t ) but the residual lifetime variable takes values at ( t , + ) , so the former is obviously more predictable than the latter. Therefore, the problem of finding stochastic bounds on the idle time of a cold standby system have a complement role to refine our knowledge about the lifetime of the system.
In the continuing part of the paper several notations are used. Let X ̠ = ( X 1 , , X n ) be a random vector and denote S n = i = 1 n X i and Consider a cold standby system comprising of n components. Firstly, one component begins to work and the residual n 1 components are standby and ready to lie in the system. Upon the failure of the first component, the components that are in queue in standby mode are replaced one by one until all components become inactive and, thus, the cold standby system fails. Suppose that X 1 , , X n represent the lifetimes of the n described components having cumulative distribution functions (CDF’s) F X 1 , , F X n . It will be assumed that X 1 , , X n are independent. The lifetime of the cold standby system is then identified as
S n = X 1 + X 2 + + X n .
The CDF of the lifetime of the cold standby system is
F S n ( t ) = P ( X 1 + X 2 + + X n t ) = F X 1 ( t ) * F X 2 ( t ) * * F X n ( t ) ,
in which * stands for the convolution operator. It is acknowledged that when X i and X j , for i j are independent, then F X i ( t ) * F X j ( t ) = + F X i ( t x ) f X j ( x ) d x , where f X j is the probability density function (PDF) of X j , which is the CDF of the convolution of X i and X j , that is the CDF of X i + X j . From (1), we can develop that
F S n ( t ) = F S n 1 ( t ) * F X n ( t ) = + F S n 1 ( t x ) f X n ( x ) d x .
Suppose X denotes the life length of a lifetime organism. We assume that at the time t at which an inspection has been carried out, it is found that the organism is not alive or it is not working. This situation can be frequently encountered in different contexts, as there is no process to accurately determine the time point at which the organism failed, and maybe there will be signs by which it is realized that the organism has failed. There are many situations where the observation of events is postponed. The time t, thus, may be the first time at which a sign has observed. We will utilize the random variable (RV) X ( t ) = ( t X | X t ) , which is well-defined for every t 0 for which F X ( t ) > 0 . The RV X ( t ) is called the inactivity time of the organism (which has random lifetime X) at the time t. The RV X ( t ) has cdf
F X ( t ) ( x ) = 0 , x < 0 1 F X ( t x ) F X ( t ) , 0 x < t 1 , x t
The associated sf of X ( t ) is obviously as
F ¯ X ( t ) ( x ) = 1 , x 0 F X ( t x ) F X ( t ) , 0 x < t 0 , x t
The pdf of X ( t ) is also derived as
f X ( t ) ( x ) = f X ( t x ) F X ( t ) : 0 x < t 0 : o . w .
There are two well-known reliability measures which are constructed using the RV X ( t ) , namely, the reversed hazard rate (RHR) function, and the mean inactivity (MIT) time function. The RHR of a lifetime RV ( F X ( 0 ) = 0 ), in view of (5,) is defined as
h ˜ X ( t ) = f X ( t ) ( 0 ) = f X ( t ) F X ( t ) , for all t : F X ( t ) > 0 .
The MIT function of X, as the mathematical expectation of the RV X ( t ) , is derived as
m ˜ X ( t ) = E [ X ( t ) ] = 0 t F X ( x ) d x F X ( t ) , for all t : F X ( t ) > 0 .
For the preliminary properties of the RHR function we refer the readers to Block et al. [4] and Finkelstein [6] and for initial aspects and properties of MIT functions one can see Kayid and Izadkhah [9] and Khan et al. [13].
Stochastic orders which have been utilized to compare probability distributions provide useful procedures to compare reliability systems. Two reputable and frequently used stochastic orders are adopted in this paper for making stochastic orders between idle times of inactive systems. The following definition is adopted from Shaked and Shanthikumar [21].
Definition 1. 
Suppose that X and Y are two non-negative RVs with PDFs f X and f Y , and RFs S X and S Y , respectively. Then, we say X is smaller or equal than Y in the
(i) likelihood ratio order (denoted as X l r Y ) if f Y ( t ) f X ( t ) is increasing in t 0 .
(ii) usual stochastic order (denoted as X s t Y ) if S X ( t ) S Y ( t ) , for all t 0 .
The two stochastic orders given in Definition 1 are in a relation with each other so that X l r Y yields X s t Y (see, for instance, Theorem 1.C.1 in Shaked and Shanthikumar [21]). In accordance with comparison between X ( t 1 ) and X ( t 2 ) for all t 1 t 2 R + according to the likelihood ratio order and the usual stochastic order, new classes of lifetime distributions are generated. In the sequel of the paper, the following classes are used.
Definition 2. 
The RV X with PDF f X is said to have
(i) Increasing likelihood ratio property (denoted by X I L R ) whenever f X ( t ) is log-concave in t 0 .
(ii) Decreasing reversed hazard rate (denoted by X D R H R ) whenever F X ( t ) is log-concave in t 0 .
For instance the exponential distribution, as a standard lifetime distribution, fulfils both I L R and D R H R properties. The weibull distribution with shape parameter α and scale parameter λ , with RF S X ( t ) = exp ( ( λ t ) α ) , has I L R and D R H R properties if α > 1 . For further properties of the I L R and the D R H R classes of lifetime distributions the readers are referred to Lai and Xie [14]. The following definition is due to Karlin [8].
Definition 3. 
Let g ( x , y ) be a non-negative function defined for x X R and y Y R . Then, g ( x , y ) is said to be totally positive of order 2 (denoted as T P 2 ) in ( x , y ) X × Y , provided that g ( x 1 , y 1 ) g ( x 2 , y 2 ) g ( x 1 , y 2 ) g ( x 2 , y 1 ) for all x 1 x 2 X and for all y 1 y 2 Y .

2. Main Results

The idle time of a cold-standby system with n components (one is active with random lifetime X 1 and the residual n 1 ones with random lifetimes X 2 , , X n are ready to function upon the failure of the active component) is characterized by the random variable
( S n ) ( t ) : = ( t S n S n t ) , for all t : F S n ( t ) > 0
where t is the first time at which the failure of the system is observed.
In the following theorem, we derive a lower bound for the inactivity time of a standby system, in the sense of the usual stochastic order, in terms of the inactivity time of its components.
Theorem 1. 
Let X 1 , X 2 , , X n be independent and non-negative rvs such that X 1 ( t ) , X 2 ( t ) , , X n ( t ) are also independent. Then, for fixed t 0 ,
i = 1 n X i ( t ) s t i = 1 n X i ( t ) ( n 1 ) t .
Proof. 
We proceed and prove the theorem by the method of induction. Let n = 2 and denote W n = ( i = 1 n X i ) ( t ) and V n = i = 1 n X i ( t ) ( n 1 ) t , where t 0 is a fixed time. We show, firstly, that F ¯ W 2 ( a ) F ¯ V 2 ( a ) , for all a R . Since for every n N , S W n = [ 0 , t ] and S V n = [ ( n 1 ) t , t ] , thus for all a 0 , and also for all a t , we have F ¯ W 2 ( a ) F ¯ V 2 ( a ) . Hence, it is enough to show that F ¯ W 2 ( a ) F ¯ V 2 ( a ) holds true for all a [ 0 , t ] . This is also sufficient to claim that
W 2 = ( X 1 + X 2 ) ( t ) s t X 1 ( t ) + X 2 ( t ) t .
For a [ 0 , t ] , we can get
F ¯ W 2 ( a ) = F X 1 + X 2 ( t a ) F X 1 + X 2 ( t ) = 0 t a F X 2 ( t a x 1 ) f X 1 ( x 1 ) d x 1 0 t F X 2 ( t x 1 ) f X 1 ( x 1 ) d x 1 = a t F X 2 ( x a ) f X 1 ( t x ) d x 0 t F X 2 ( x ) f X 1 ( t x ) d x ,
where the first identity followed from equation (3), the second identity obtained by total probability formula and the fact that X 1 and X 2 are independent, and the third identity acquired after the change of variable x = t x 1 . On the other hand,
F ¯ V 2 ( a ) = P ( X 1 ( t ) + X 2 ( t ) > t + a ) = 0 t F ¯ X 2 ( t ) ( a + t x 1 ) f X 1 ( t ) ( x 1 ) d x 1 = a t F X 2 ( x 1 a ) f X 1 ( t x 1 ) d x 1 F X 1 ( t ) F X 2 ( t ) ,
in which the second equality is due to the total probability formula and that X 1 ( t ) and X 2 ( t ) are independent and the second equality obtained by using equations (4) and (5). Since, for x t , one has F X 2 ( x ) F X 2 ( t ) , thus,
0 t F X 2 ( x ) f X 1 ( t x ) d x 0 t F X 2 ( t ) f X 1 ( t x ) d x = F X 2 ( t ) 0 t f X 1 ( t x ) d x = F X 2 ( t ) F X 1 ( t ) .
Therefore, for all a [ 0 , t ] ,
F ¯ W 2 ( a ) = a t F X 2 ( x a ) f X 1 ( t x ) d x 0 t F X 2 ( x ) f X 1 ( t x ) d x a t F X 2 ( x a ) f X 1 ( t x ) d x F X 2 ( t ) F X 1 ( t ) = F ¯ V 2 ( a ) .
Let us assume now that (7) holds for n = m , that is
i = 1 m X i ( t ) s t i = 1 m X i ( t ) ( m 1 ) t .
We then prove that (7) also holds for n = m + 1 . We observe that
i = 1 m + 1 X i ( t ) = s t i = 1 m X i + X m + 1 ( t ) s t i = 1 m X i ( t ) + X m + 1 ( t ) t s t i = 1 m X i ( t ) ( m 1 ) t + X m + 1 ( t ) t = s t i = 1 m + 1 X i ( t ) m t ,
where the first stochastic order is due to (8), the second stochastic order follows from (9) and = s t means equality in distribution. Thus, the proof is validated. □
The lower bound in (7) in Theorem 1 can take negative values for some t 0 . If the lower bound is negative for a given t 0 , the result of Theorem 1 becomes trivial. However, in the following example we present a situation where (7) produces a meaningful lower bound for the MIT of a gamma distributed random lifetime.
Example 1. 
Suppose that X i E ( λ ) , i = 1 , 2 , an exponential distribution with mean 1 / λ i . Then, X i has MIT
m ˜ X i ( t ) = t 1 exp ( λ t ) 1 λ .
It is known that X 1 + X 2 has gamma distribution with shape α = 2 and scale λ. From Theorem 1, since the usual stochastic order implies the expectation order, thus we obtain a lower bound for the MIT of X 1 + X 2 as follows:
E ( X 1 + X 2 ) ( t ) E ( X 1 ( t ) ) + E ( X 2 ( t ) ) t = m ˜ X 1 ( t ) + m ˜ X 2 ( t ) t = 2 t 1 exp ( λ t ) 2 λ t .
We show that the obtained lower bound for the MIT of X 1 + X 2 is non-negative. It is readily seen that 2 t 1 exp ( λ t ) 2 λ t 0 , for all t 0 , if and only if, ( 2 + λ t ) exp ( λ t ) ( 2 λ t ) 0 , for all t 0 . Since exp ( x ) ( 1 + x ) , for all x 0 , thus 1 ( 1 + x ) exp ( x ) 0 , for all x 0 . Therefore,
( 2 + λ t ) exp ( λ t ) ( 2 λ t ) = 0 λ t ( 1 ( 1 + x ) exp ( x ) ) d x 0 , f o r a l l t 0 .
The following example clarifies another utilization of the result of Theorem 1.
Example 2. 
It is said that X has a gamma distribution with shape parameter α > 0 and the scale parameter λ and denote it by X G ( α , λ ) , whenever X has pdf f X ( x ) = λ α x α 1 e λ x Γ ( α ) . Considering two lifetime organisms or devices working one after another in a system (standby structure) and letting X i denote the lifetime of the ith organism, for i = 1 , 2 . We will consider two situations: firstly when both organisms failed before time t = 1 , and secondly, when the system failed before time t = 1 . Suppose that X 1 G ( 2 , 3 ) and X 2 G ( 3 , 3 ) . Note that if X G ( k , λ ) , where k N , the the cdf of X is derived via
F X ( x ) = 1 n = 0 k exp ( λ x ) ( λ x ) n n ! .
Denote P 4 ( a ) = 27 a 4 144 a 3 + 306 a 2 312 a + 131 . In spirit of the equation (10), we get the cdf of the RV W 2 : = ( X 1 + X 2 ) ( t ) , when t = 1 , as follows:
F ¯ W 2 ( a ) = 0 1 a F X 2 ( 1 a x ) f X 1 ( x ) d x 0 1 F X 2 ( 1 x ) f X 1 ( x ) d x = P 4 ( a ) exp ( 3 ( a 1 ) ) 8 131 exp ( 3 ) 8 ,
and on the other hand, using (10), the RV V 2 : = X 1 ( t ) + X 2 ( t ) t , for t = 1 , has RF
F ¯ V 2 ( a ) = a 1 F X 2 ( x a ) f X 1 ( 1 x ) d x F X 1 ( 1 ) F X 2 ( 1 ) = P 4 ( a ) exp ( 3 a ) 8 exp ( 3 ) 8 ( 4 exp ( 3 ) ) ( 68 exp ( 3 ) ) .
From Theorem 1, W 2 s t V 2 and thus, F ¯ W 2 ( a ) F ¯ V 2 ( a ) , for all a R . In Figure 1, we plot the graphs of F ¯ W 2 ( a ) and F ¯ V 2 ( a ) for a [ 0 , 1 ] (for the values out of [ 0 , 1 ] the ordering relation is obviously fulfilled) to exhibit the stochastic ordering property.
Before stating the next result, we introduce some notation. In what follows, we will take
S n = i = 1 n X i S n ( t ) = i = 1 n X i ( t i ) ( S n ) ( t ) = ( i = 1 n X i ) ( t ) S n ( t ) = i = 1 n X i i = 1 n X i t S n , t = i = 1 n X i ( t i ) .
In the following result, it is demonstrated that given that at a certain time t, both a cold standby system and all the components in it are inactive, the overall idle time of the components is stochastically (with respect to likelihood ratio order) greater than the idle time of the cold standby unit.
Theorem 2. 
Let X 1 , X 2 , , X n be independent rvs such that X n follows exponential distribution with parameter λ n . Let X 1 ( t ) , X 2 ( t ) , , X n ( t ) are also independent for a fixed t 0 . Then,
( i = 1 n X i ) ( t ) l r i = 1 n X i ( t ) .
Proof. 
Notice that ( S n ) ( t ) : = ( i = 1 n X i ) ( t ) has support [ 0 , t ] , while S n ( t ) : = i = 1 n X i ( t ) has support [ 0 , n t ] . Thus, we need to prove that f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) is increasing in s 0 , for every s t , since for s > t , one has f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = + . We have
f ( S n ) ( t ) ( s ) = f S n ( t s ) F S n ( t ) I [ 0 s t ] , a n d f S n ( t ) ( s ) = 0 + f X n ( t ) ( s y ) f S n 1 ( t ) ( y ) d y
, Therefore, for every s [ 0 , t ] , we have
f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = F S n ( t ) . 0 + f X n ( t ) ( s y ) f S n 1 ( t ) ( y ) d y 0 + f X n ( t s y ) f S n 1 ( y ) d y = F S n ( t ) F X n ( t ) . 0 s f X n ( t s + y ) f S n 1 ( t ) ( y ) d y 0 t s f X n ( t s y ) f S n 1 ( y ) d y = F S n ( t ) F X n ( t ) . 0 s f X n ( t s + y ) f S n 1 ( t ) ( y ) d y s t f X n ( u s ) f S n 1 ( t u ) d u ,
where the change of variable u = t y has been made to derive the last equality. Since X n E ( λ n ) , thus
f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = F S n ( t ) F X n ( t ) . 0 s λ n exp ( λ n ( t s + y ) ) f S n 1 ( t ) ( y ) d y s t λ n exp ( λ n ( u s ) ) f S n 1 ( t u ) d u = exp ( λ n t ) . F S n ( t ) F X n ( t ) . 0 s exp ( λ n y ) f S n 1 ( t ) ( y ) d y s t exp ( λ n u ) f S n 1 ( t u ) d u .
Hence, for all 0 s t , we get
s log f S n ( t ) ( s ) f ( S n ) ( t ) ( s ) = s log 0 s exp ( λ n y ) f S n 1 ( t ) ( y ) d y s t exp ( λ n u ) f S n 1 ( t u ) d u = exp ( λ n s ) f S n 1 ( t ) ( s ) 0 s exp ( λ n y ) f S n 1 ( t ) ( y ) d y + exp ( λ n s ) f S n 1 ( t s ) s t exp ( λ n y ) f S n 1 ( t y ) d y ,
which is non-negative.Thus, the proof of theorem is completed. □
By considering a cold standby system composed of a single component with a general continues lifetime distribution equipped with one additional component with exponential distribution lifetime, it is realized by Theorem 2 that the idle time of the cold standby system is smaller, with respect to the likelihood ratio order, than the sum of the inactivity times of both components measured at a specified time t at which the system and its components are inactive and not functioning. The following technical lemma is useful and will be applied in the sequel.
Lemma 1. 
Suppose that τ 1 , τ 2 , , τ m are m points of time with mean τ ¯ , and that X 1 , X 2 , , X m are m non-negative rvs then m τ ¯ ( S m ) ( m τ ¯ ) = s t S m ( τ ) , where = s t means equality in distribution.
Theorem 3. 
Let X 1 , X 2 , X m be independent non-negative rvs, such that X 1 ( t 1 ) , X 2 ( t 2 ) , , X m ( t m ) and also X 1 ( τ 1 ) , X 2 ( τ 2 ) , , X n ( τ n ) , where m > n , are also independent where t 1 , t 2 , , t m are m fixed time points and so are τ 1 , τ 2 , , τ n . Let X i I L R , i = 1 , 2 , , n . If
(i) 
m t ¯ n τ ¯ where t m n τ ¯ in which τ ¯ = i = 1 n τ i n and t ¯ = i = 1 m t i m ;
(ii) 
X m and X n have identical distributions;
(iii) 
For and t i 0 , i = 1 , 2 , , m , i = 1 m 1 X i ( t i ) l r i = 1 n X i ,
then:
( i = 1 n X i ) ( n τ ¯ ) l r i = 1 m X i ( t i ) m t ¯ + n τ ¯ .
Proof. 
We first prove that S n ( n τ ¯ ) : = ( i = 1 n X i ) ( n τ ¯ ) l r i = 1 m X i ( t i ) : = S m , t . The result is then proved following what we discuss here. From Theorem 1.C.8 in Shaked and Shanthikumar (2007), if ψ is a decreasing function then X l r Y implies ψ ( X ) l r ψ ( Y ) . Thus, if ψ ( x ) = m t ¯ x , since S n ( n τ ¯ ) l r S m , t , thus it follows that m t ¯ S n ( n τ ¯ ) l r m t ¯ S m , t . Using Lemma 1, it is realized that m t ¯ S n ( n τ ¯ ) = s t m t ¯ n τ ¯ + ( S n ) ( n τ ¯ ) ) and, in addition, m t ¯ S m , t = s t S m ( t ) . Hence, it follows that ( S n ) ( n τ ¯ ) l r S m ( t ) m t ¯ + n τ ¯ . Thus it is suffiecient to prove that f S m , t ( s ) f S n ( n τ ¯ ) ( s ) is increasing in 0 < s n τ ¯ . We assume that I [ x A ] is the indicator function of the set [ x A ] , which is equal with one if x A and it is equal with 0 if x A c , where A c is the complement of the set A. Let us write for every s ( 0 , n τ ¯ ] ,
f S m , t ( s ) f S n ( n τ ¯ ) ( s ) = F S n ( n τ ¯ ) 0 + f X m ( t m ) ( s y ) f S m 1 , t ( y ) d y 0 + f X n ( s y ) f S n 1 ( y ) d y = F S n ( n τ ¯ ) F X m ( t m ) . 0 + f X m ( s y ) I [ s y t m ] f S m 1 , t ( y ) I [ y > 0 ] d y 0 + f X n ( s y ) f S n 1 ( y ) d y = F S n ( n τ ¯ ) F X m ( t m ) . ( s t m ) 0 + f X m ( s y ) f S m 1 , t ( y ) d y 0 + f X n ( s y ) f S n 1 ( y ) d y = F S n ( n τ ¯ ) F X m ( t m ) . 0 + f X m ( s y ) f S m 1 , t ( y ) d y 0 + f X n ( s y ) f S n 1 ( y ) d y ,
where a b stands for the maximum of a and b, and the last identity follows from the fact that for all s ( 0 , n t ¯ ] , from assumption (i), one has s t m s n t ¯ 0 , thus ( s t m ) 0 = 0 . Therefore, for every s ( 0 , n t ¯ ] since X m and X n are identical in distribution (assumption (ii)), thus
f S m , t ( s ) f S n ( n τ ¯ ) ( s ) = F S n ( n τ ¯ ) F X m ( t m ) . 0 + f X m ( s y ) f X n ( s y ) . f S m 1 , t ( y ) f S n 1 ( y ) f X n ( s y ) f S n 1 ( y ) 0 + f X n ( s y ) f S n 1 ( y ) d y d y = F S n ( n τ ¯ ) F X m ( t m ) 0 + f S m 1 , t ( y ) f S n 1 ( y ) f X n | S n = s ( s y | s ) d y = F S n ( n τ ¯ ) F X m ( t m ) 0 + Ψ ( y ) f S n 1 | S n = s ( y | s ) d y = F S n ( n τ ¯ ) F X m ( t m ) E Ψ ( S n 1 ) S n = s ,
where Ψ ( y ) = f S m 1 , t ( y ) f S n 1 ( y ) . From assumption, X i I L R for all i = 1 , 2 , , n , thus since the convolution of log-concave densities is log-concave, S n 1 I L R . From Theorem 1.C.53 of Shaked and Shanthikumar (2007), we conclude that
[ S n 1 | S n = s 1 ] l r [ S n 1 | S n = s 2 ] , f o r a l l s 1 s 2 R + ,
and since l r implies s t , thus one has
[ S n 1 | S n = s 1 ] s t [ S n 1 | S n = s 2 ] , f o r a l l s 1 s 2 R + .
Furthermore, from assumption (iii) the function Ψ ( y ) is increasing in y > 0 . From (12) and (13), it follows that f S m , t ( s ) f S n ( n τ ¯ ) ( s ) is increasing in s > 0 , which validates the proof. □
The following lemma is useful in proving next result.
Lemma 2. 
Let X 1 , X 2 , , X m be m dependent rvs which are non0negative and, further, let X i ( τ i ) , i = 1 , 2 , , m be independent. Then,
i = 1 m X i ( τ i ) = s t ( i = 1 m X i X 1 τ 1 , , X m τ m ) ,
in which τ 1 , , τ m are m points of time such that i = 1 m F X i ( τ i ) > 0 .
Proof. 
It suffices to prove that S m ( τ ) : = i = 1 m X i ( τ i ) and ( S m X i τ i , i = 1 , , m ) have a common moment generating function. Denote X = ( X 1 , , X m ) and let ( X | X i τ i , i = 1 , , m ) have conditional pdf f ( X | X i τ i , i = 1 , , m ) . Since X i ’s are independent, thus, for all x = ( x 1 , , x m ) R m we have
f ( X | X i τ i , i = 1 , , m ) ( x 1 , , x m ) = f X ( x ) . I [ x 1 τ 1 , , x m τ m ] P ( X 1 τ 1 , , X m τ m ) = i = 1 m f X i ( x i ) F X i ( τ i ) I [ x 1 τ 1 , , x m τ m ] .
Now, let us write
M ( S m X i τ i , i = 1 , , m ) ( t ) = E ( exp ( t S m ) | X i τ i , i = 1 , , m ) = E ( i = 1 m exp ( t X i ) X i τ i , i = 1 , , m ) = 0 + 0 + i = 1 m exp ( t x i ) f ( X | X i τ i , i = 1 , , m ) ( x 1 , , x m ) d x m d x 1 = 0 τ 1 0 τ m i = 1 m exp ( t x i ) f X i ( x i ) F X i ( τ i ) = i = 1 m 0 τ i exp ( t x i ) f X i ( x i ) F X i ( τ i ) d x i = i = 1 m E ( exp ( t X i ( τ i ) ) ) = M S m ( τ ) ( t ) , f o r a l l t R ,
where the last identity follows from the assumption that X 1 ( τ 1 ) , , X m ( τ m ) are independent. The proof is completed. □
The following result presents sufficient condition for the usual stochastic ordering between idle time of an inactive standby system of size two and the sum of the idle times of inactive components. It is worth mentioning that as the standby systems of size two are very important as an effective redundancy method in engineering reliability systems the previous results are also of particular interest when n = 2 .
Theorem 4. 
Let X 1 and X 2 be two independent rvs such that X 1 ( τ 1 ) and X 2 ( τ n ) are also independent for τ 1 τ 2 as two points of time. Suppose that h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) , for all s [ τ 1 , τ 1 + τ 2 ] . Then,
( X 1 + X 2 ) ( τ 1 + τ 2 ) s t X 1 ( τ 1 ) + X 2 ( τ 2 ) .
Proof. 
In a similar manner as in the proof of Theorem 3, it is sufficient to show that ( S 2 ) ( τ 1 + τ 2 ) s t S 2 , τ . From Lemma 2, when m = 2 , since X 1 and X 2 and also X 1 ( τ 1 ) and X 2 ( τ 2 ) are independent, thus we have S 2 , τ = s t ( S 2 X 1 τ 1 , X 2 τ 2 ) . Thus we prove that
( S 2 ) ( τ 1 + τ 2 ) s t ( S 2 X 1 τ 1 , X 2 τ 2 ) .
By routine calculation, it is evidently observed that (14) is satisfied if, and only if,
P ( S 2 s S 2 τ 1 + τ 2 ) P ( S 2 s X 1 τ 1 , X 2 τ 2 ) , f o r a l l s ( 0 , τ 1 + τ 2 ]
which holds if, and only if,
P ( X 1 τ 1 , X 2 τ 2 S 2 τ 1 + τ 2 ) P ( X 1 τ 1 , X 2 τ 2 S 2 s ) , f o r a l l s ( 0 , τ 1 + τ 2 ] .
The inequality given in (15) holds true for s ( 0 , τ 1 ] as it can be obviously seen that
P ( X 1 τ 1 , X 2 τ 2 S 2 τ 1 + τ 2 ) = P ( X 1 τ 1 , X 2 τ 2 ) P ( S 2 τ 1 + τ 2 ) P ( X 1 τ 1 , X 2 τ 2 ) P ( S 2 s ) = P ( X 1 τ 1 , X 2 τ 2 S 2 s ) .
Thus, we only need to prove that the inequality given in (15) is satisfied for s ( τ 1 , τ 1 + τ 2 ] . Note that
0 τ 2 f X 2 ( x 2 ) I [ x 2 s x 1 ] F S 2 ( s ) d x 2 = P ( X 2 ( s x 1 ) τ 2 ) F X 2 ( s x 1 ) = F X 2 ( ( s x 1 ) τ 2 ) ,
where a b = min { a , b } . Thus, we can get
P ( X 1 τ 1 , X 2 τ 2 S 2 s ) = 0 τ 1 0 τ 2 f X 1 ( x 1 ) f X 2 ( x 2 ) I [ x 1 + x 2 s ] F X 1 + X 2 ( s ) d x 2 d x 1 = 0 τ 1 f X 1 ( x 1 ) 0 τ 2 f X 2 ( x 2 ) I [ x 2 s x 1 ] F X 1 + X 2 ( s ) d x 2 d x 1 = 0 τ 1 f X 1 ( x 1 ) F X 2 ( ( s x 1 ) τ 2 ) F X 1 + X 2 ( s ) d x 1 .
Therefore, to prove (14), it is sufficient to show that for all s ( τ 1 , τ 1 + τ 2 ] ,
0 τ 1 f X 1 ( x 1 ) F X 2 ( ( s x 1 ) τ 2 ) F S 2 ( s ) d x 1 0 τ 1 f X 1 ( x 1 ) F X 2 ( ( τ 1 + τ 2 x 1 ) τ 2 ) F S 2 ( τ 1 + τ 2 ) d x 1 .
Since, for all x 1 τ 1 we have ( τ 1 + τ 2 x 1 ) τ 2 = τ 2 , thus it suffices to prove that
0 τ 1 f X 1 ( x 1 ) F X 2 ( ( s x 1 ) τ 2 ) F S 2 ( s ) d x 1 0 τ 1 f X 1 ( x 1 ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) d x 1 ,
holds for all s ( τ 1 , τ 1 + τ 2 ] . That is, it is enough to defenestrate that for all s ( τ 1 , τ 1 + τ 2 ] ,
0 τ 1 f X 1 ( x 1 ) Φ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 ,
where
Φ ( x 1 , s , τ 1 , τ 2 ) = F X 2 ( ( s x 1 ) τ 2 ) F S 2 ( s ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) .
Let us assume that τ 1 s < τ 2 . Then, we can show that
0 τ 1 f X 1 ( x ) Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 , f o r a l l s [ τ 1 , τ 2 ) .
Since s < τ 2 , thus, s x 1 τ 2 x 1 τ 2 , for all x 1 ( 0 , τ 1 ) . Hence, ( s x 1 ) τ 2 = s x 1 . Therefore,
Ψ ( x 1 , s , τ 1 , τ 2 ) = F X 2 ( s x 1 ) F S 2 ( s ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) F X 2 ( s τ 1 ) F S 2 ( s ) F X 2 ( τ 2 ) F S 2 ( τ 1 + τ 2 ) ,
which is non-negative if F X 2 ( s τ 1 ) F S 2 ( s ) is decreasing in s [ τ 1 , τ 2 ) . This is also satisfied if the assumption “ h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) , for all s [ τ 1 , τ 1 + τ 2 ] ” holds. Now, assume that τ 2 s < τ 1 + τ 2 . Then,
0 s τ 2 Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 s τ 2 F X 2 ( τ 2 ) f X 1 ( x 1 ) 1 F S 2 ( s ) 1 F S 2 ( τ 1 + τ 2 ) d x 1 0 .
In a similar manner to the case when τ 1 s 2 < τ 2 , now we can also established that
s τ 2 τ 1 Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 .
As a result, we have 0 τ 1 Ψ ( x 1 , s , τ 1 , τ 2 ) d x 1 0 , for all s [ τ 2 , τ 1 + τ 2 ] . The proof of the theorem is now completed. □
In the context of the conditions of Theorem 4, one may question whether the assumption “ h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) , for all s [ τ 1 , τ 1 + τ 2 ] ” is attainable. The following remark clarifies the issue.
Remark 1. 
Suppose that X 1 and X 2 represent, respectively, the lifetime of a component and the lifetime of the standby unit which are assumed to be independent. Note that for all x < 0 , f X i ( x ) = F X i ( x ) = 0 , i = 1 , 2 . We can write
h ˜ X 1 + X 2 ( s ) : = f X 1 + X 2 ( s ) F X 1 + X 2 ( s ) = 0 + f X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 0 + F X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 = 0 s f X 2 ( s x 1 ) F X 2 ( s x 1 ) F X 2 ( s x 1 ) f X 1 ( x 1 ) 0 + F X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 d x 1 = 0 s h ˜ X 2 ( s x 1 ) f ( x 1 | s ) d x 1 = E [ h ˜ X 2 ( s X s ) ] ,
where X s is a non-negative RV with pdf f ( · | s ) , which is given by
f ( x 1 | s ) = F X 2 ( s x 1 ) f X 1 ( x 1 ) 0 + F X 2 ( s x 1 ) f X 1 ( x 1 ) d x 1 .
Note that E ( X s * ) s . Now, consider an s 0 > 0 such that s 0 < s < τ 1 + τ 2 , for which τ 1 = E ( X s 0 * ) E ( X s * ) . We suppose that X 2 has a decreasing convex reversed hazard rate function. On using Jensen’s inequality, for all s < τ 1 + τ 2
h ˜ X 1 + X 2 ( s ) = E [ h ˜ X 2 ( s X s ) ] h ˜ X 2 ( s E ( X s ) ) h ˜ X 2 ( s τ 1 ) .
Now, Theorem 4 is applicable as the sufficient condition of this theorem is satisfied.
We give the next example to fulfill the conditions in Theorem 4 in the case of heterogenous exponential components.
Example 3. 
Suppose that X 1 and X 2 have exponential distribution with parameters λ 1 and λ 2 , respectively. It can be checked that the reversed hazard rate function of exponential distribution is decreasing and convex. Thus, h ˜ X 2 ( x ) = λ 2 exp ( λ 2 x ) 1 is a decreasing function in x which is further convex in x. The RV X s , as introduced in Remark 1 with pdf (16), has pdf
f ( x 1 | s ) = exp ( λ 1 x ) exp ( λ 2 s + ( λ 2 λ 1 ) x ) 1 λ 1 ( 1 exp ( λ 1 s ) ) + 1 λ 2 λ 1 ( exp ( λ 2 s ) exp ( λ 1 s ) ) , 0 x s .
It is straightforward that, if X 2 D R H R , then F X 2 ( s x 1 ) is T P 2 in ( x 1 , s ) R + × R + . As a result, from (16), f * ( x 1 | s ) is also T P 2 in ( x 1 , s ) R + × R + , that is X s 1 * l r X s 2 * for every 0 < s 1 s 2 . Since l r implies s t , thus one can conclude that X s 1 * s t X s 2 * , for all 0 < s 1 s 2 . Therefore, E ( X s 1 * ) E ( X s 2 * ) , for all s 1 s 2 R + . For example if λ 1 = 2 and λ 2 = 3 , then after some calculation
E ( X s ) = exp ( 3 s ) + ( 3 6 s ) exp ( s ) 4 2 exp ( 3 s ) 6 exp ( s ) + 4 ,
which is an increasing function. Hence, is one chooses τ 1 = E ( X 0 * ) = 0 , following the discussions in Remark 1 and since for all s > τ 1 , E ( X s * ) E ( X τ 1 * ) 0 , the assumption “ h ˜ X 2 ( s τ 1 ) h ˜ X 1 + X 2 ( s ) , for all s [ τ 1 , τ 1 + τ 2 ] ”in Theorem 4 is fulfilled on that account and, consequently, ( X 1 + X 2 ) ( τ 1 + τ 2 ) s t X 1 ( τ 1 ) + X 2 ( τ 2 ) , or more accurately, ( X 1 + X 2 ) ( τ 2 ) s t X 2 ( τ 2 ) .

3. Concluding Remarks

In this study, we have presented some results to obtain upper and lower stochastic bounds for the idle time of standby systems after their failure in the context of random lifetimes. These bounds are in fact some functions of the idle times of the components of the standby system. Thus, we can evaluate whether it is reasonable to equip a component with redundant standby units to minimize the idle time of a standby system. We used two informative and commonly applied stochastic orderings, namely the likelihood ratio ordering and the usual stochastic ordering. The problem of maintaining systems and replacing them with new systems and the same problem of tuning their components plays an important role in reliability engineering. This is because there are some systems (e.g., systems that gradually fail under certain degradation processes) that need to be in operation uniformly and it is very beneficial to have less idle time. The results obtained in this work may be useful in identifying situations where the idle time of inactive standby systems and the idle time (or a function thereof) of components in the system have a stochastic ordering property. Since the number of standby units can play a key role in reducing or even increasing costs and preventing further losses from early component failures, it becomes increasingly important to identify whether a standby system is highly survivable or equivalently has lower inactivity compared to components that failed earlier.
In the future of this study, we will consider two standby systems with different component lifetimes and possibly different numbers of components, and investigate some stochastic comparisons between the idle time of one system and the sum of the idle times of the components in the other system. We will also look for conditions for stochastic comparisons between the idle times of two standby systems.

Acknowledgments

The authors acknowledge financial support from the Researchers Supporting Project number (RSP2023R464), King Saud University, Riyadh, Saudi Arabia.

References

  1. Ahmad, I. A. , Kayid, M. and Pellerey, F. (2005). Further results involving the MIT order and the IMIT class. Probability in the Engineering and Informational Sciences, 19(3), 377–395. [CrossRef]
  2. Amini-Seresht, E. , Kelkinnama, M. and Zhang, Y. (2021). On the residual and past lifetimes of coherent systems under random monitoring. Probability in the Engineering and Informational Sciences, 35(3), 465–480. [CrossRef]
  3. Bayramoglu, I. and Ozkut, M. (2016). Mean residual life and inactivity time of a coherent system subjected to Marshall–Olkin type shocks. Journal of Computational and Applied Mathematics, 298, 190–200. [CrossRef]
  4. Block, H. W. Savits, T. H., and Singh, H. (1998). The reversed hazard rate function. Probability in the Engineering and informational Sciences, 12(1), 69-90. [CrossRef]
  5. Danjuma, M. U. , Yusuf, B. and Yusuf, I. (2022). Reliability, availability, maintainability, and dependability analysis of cold standby series-parallel system. Journal of Computational and Cognitive Engineering, 1(4), 193–200. [CrossRef]
  6. Finkelstein, M. S. (2002). On the reversed hazard rate. Reliability Engineering and System Safety, 78(1), 71-75. [CrossRef]
  7. Guo, Z. Zhang, J. and Yan, R. (2022). On inactivity times of failed components of coherent system under double monitoring. Probability in the Engineering and Informational Sciences, 36(3), 923–940. [CrossRef]
  8. Karlin, S. (1968). Total positivity (Vol. 1). Stanford University Press.
  9. Kayid, M. and Izadkhah, S. (2014). Mean inactivity time function, associated orderings, and classes of life distributions. IEEE Transactions on Reliability, 63(2), 593–602. [CrossRef]
  10. Kayid, M. , Izadkhah, S. and Abouammoh, A. M. (2018). Average inactivity time model, associated orderings and reliability properties. Physica A: Statistical Mechanics and its Applications, 492, 1389–1398. [CrossRef]
  11. Kayid, M. and Shrahili, M. (2023). Rényi Entropy for Past Lifetime Distributions with Application in Inactive Coherent Systems. Symmetry, 15(7), 1310. [CrossRef]
  12. Kayid, M. and Alshehri, M. A. Stochastic Comparisons of Lifetimes of Used Standby Systems. Mathematics 2023, 11, 3042. [Google Scholar] [CrossRef]
  13. Khan, R. A. , Bhattacharyya, D. and Mitra, M. (2021). On some properties of the mean inactivity time function. Statistics and Probability Letters, 170, 108993. [CrossRef]
  14. Lai, C. D. and Xie, M. (2006). Stochastic ageing and dependence for reliability. Springer Science and Business Media.
  15. Lin, Z. , Tao, L., Wang, S., Chen, C., Wang, J. and Ge, D. (2023). Reliability analysis of cold-standby systems using a self-stratifying subset simulation method. Journal of Statistical Computation and Simulation, 1-19. [CrossRef]
  16. Malhotra, R. , Alamri, F. S. and Khalifa, H. A. E. W. (2023). Novel Analysis between Two-Unit Hot and Cold Standby Redundant Systems with Varied Demand. Symmetry, 15(6), 1220. [CrossRef]
  17. Navarro, J. , Longobardi, M. and Pellerey, F. (2017). Comparison results for inactivity times of k-out-of-n and general coherent systems with dependent components. Test, 26, 822–846. [CrossRef]
  18. Navarro, J. and Calì, C. (2019). Inactivity times of coherent systems with dependent components under periodical inspections. Applied Stochastic Models in Business and Industry, 35(3), 871–892. [CrossRef]
  19. Ramezani Dobani, E. , Juybari, M. N. and Abouei Ardakan, M. (2022). System reliability-redundancy optimization with cold-standby strategy by fitness-distance balance stochastic fractal search algorithm. Journal of Statistical Computation and Simulation, 92(10), 2156–2183. [CrossRef]
  20. Salehi, E. and Tavangar, M. (2019). Stochastic comparisons on conditional residual lifetime and inactivity time of coherent systems with exchangeable components. Statistics and Probability Letters, 145, 327–337. [CrossRef]
  21. Shaked, M. and Shanthikumar, J. G. (Eds.). (2007). Stochastic orders. New York, NY: Springer New York.
  22. Toomaj, A. and Di Crescenzo, A. (2020). Generalized entropies, variance and applications. Entropy, 22(6), 709. 6). [CrossRef]
  23. Wang, J. and Ye, J. (2022). A new repair model and its optimization for cold standby system. Operational Research, 1-18. [CrossRef]
  24. Zhang, Z. and Balakrishnan, N. (2016). Representations of the inactivity time for coherent systems with heterogeneous components and some ordered properties. Metrika, 79, 113–126. [CrossRef]
Figure 1. Plot of the reliability function of ( X 1 + X 2 ) ( t ) (solid line) and the reliability function of X 1 ( t ) + X 2 ( t ) t (dot-dashed line) for t = 1 and for x ( 0 , 1 ) .
Figure 1. Plot of the reliability function of ( X 1 + X 2 ) ( t ) (solid line) and the reliability function of X 1 ( t ) + X 2 ( t ) t (dot-dashed line) for t = 1 and for x ( 0 , 1 ) .
Preprints 81058 g001
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated