Next Article in Journal
An Extended EDAS Method with a Single-Valued Complex Neutrosophic Set and Its Application in Green Supplier Selection
Next Article in Special Issue
Renewal Redundant Systems Under the Marshall–Olkin Failure Model. A Probability Analysis
Previous Article in Journal
A Spectral Conjugate Gradient Method with Descent Property
Previous Article in Special Issue
Analysis of Queueing System MMPP/M/K/K with Delayed Feedback
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Reliability of a Double Redundant Renewable System with a Generally Distributed Life and Repair Times

1
Department of Applied Mathematics and Computer Modelling, Faculty of Automation and Computer Science, Gubkin Russian State University of Oil and Gas, 119991 Moscow, Russia
2
Department of Information Technologies, Faculty of Mathematics and Natural Sciences, Peoples’ Friendship University of Russia (RUDN University), 117198 Moscow, Russia
3
Insitute for Stochastics, Johannes Kepler University Linz, 4030 Linz, Austria
4
Laboratory N17, Trapeznikov Institute of Control Sciences of RAS, 117997 Moscow, Russia
5
Department of Informatics and Networks, Faculty of Informatics, University of Debrecen, 4032 Debrecen, Hungary
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(2), 278; https://doi.org/10.3390/math8020278
Submission received: 3 February 2020 / Revised: 13 February 2020 / Accepted: 14 February 2020 / Published: 19 February 2020

Abstract

:
The paper provides reliability analysis of a cold double redundant renewable system assuming that both life-time and repair time distributions are arbitrary. The proposed approach is based on the theory of decomposable semi-regenerative processes. We derive the Laplace–Stieltjes transform of two main reliability measures like the distribution of the time between failures and the time to the first failure. The transforms are used to calculate corresponding mean times. It is further derived in closed form the time-dependent and time stationary state probabilities in terms of the Laplace transforms. Numerical results illustrate the effect of the type of distributions as well as their parameters on the derived reliability and probabilistic measures.

1. Introduction

The use of parallel or redundant units is an often recommended way of increasing the system reliability. In the last few decades, many authors have studied the redundant systems under different sets of assumptions about the system’s attributes and level of generality, the distribution of life, and repair times when one or more units are standby. In this paper, we formulate the model where both of distributions are assumed to be arbitrary. Such models are interesting both from theoretical and practical points of view. Theoretically, these studies are related to the creation and development of new mathematical methods such as regenerative methods, especially methods of the Decomposable Semi-Regenerative Processes (DSRP), and Markovization methods via introduction of the supplementary variables. In practical terms, the tasks under consideration form a basis for analyzing the reliability of different complex systems with generally distributed times.
Smith’s idea about regenerative stochastic processes [1] found many generalizations and applications. This approach still helps to solve many applied problems since it reduces the complexity of the task. Instead of a whole time period, the process can be analyzed within a separate regenerative period of time. However, if the process describing the system behavior is complicated enough in order to be exhaustively analyzed on the regenerative period, even in this case, different generalizations of the regenerative idea are possible. One possible generalization is to combine Smith’s idea with a semi-Markov approach [2], which seems quite appropriate for real models. The result of such combination is a semi-regenerative process. In Rykov and Yastrbrnrtsky [3], it appears under the name “Regenerative processes with several types of regeneration points”. Klimov [4] considered it as a “semi-Markov process with additional trajectories”. In accordance with Jakod [5] and Nummeline [6], in this paper, we will call such process a semi-regenerative process (SRP).
The next possible generalization is to construct within the basic regeneration cycle other regeneration points called embedded regeneration points. Sometimes, in a particular model, one can find some embedded regeneration points and to represent the process distribution in a separate regeneration cycle in terms of its distribution in embedded regeneration cycles of the second level. Initially, such processes appeared in [7,8] under the name “Regenerative processes with embedded regeneration cycles” or “Decomposable Semi-Regenerative Processes” (DSRP). Regenerative processes with embedded regeneration cycles are widely used applications in operations research. In [7], regenerative processes have been applied to study priority queueing systems. In [9,10], the one-server queueing system with infinite queue, recurrent input flow, and general service time distribution ( G I | G I | 1 , —system in Kendall’s notation [11]) has been studied in terms of these processes (see also [12]). In paper [13], the authors investigated a model of a polling system by means of the DSRP. Another approach related to the study of complex systems (proposed in Belyaev [14]) contains the introduction of so-called supplementary variables. According to this method, the original model can be described by a continuous-time Markov chain (Markovization method). The implementation of this method to study reliability models is proposed by Rykov [15], Mazumdar [16], and Mine and Asakura [17].
The redundancy of some technical system means the duplication of critical components resulting in increasing reliability of the system. The double redundant systems are well known and were studied and applied under different assumptions like repair maintenance, preventive maintenance policy, exponential distributions for life and repair times, and so on; see, e.g., Gaver [18], Gnedenko et al. [19], Mine and Asakura [20], and Srinivasan [21]. In this paper, we study a homogeneous cold double redundant system with arbitrary life- and repair time distributions. In such a system, the cold standby redundancy means that the redundant component does not fail in a standby mode. The closed form solutions for the main reliability characteristics have been derived in terms of an integral transformation like a Laplace transform. The proposed analysis is based on the DSRP, the stochastic equations for the corresponding random variables (RVs), and the theory of regenerative processes [1].
The rest of the paper is organized as follows. In Section 2, the problem set, some assumptions, and notations are introduced. In Section 3, the Laplace–Stieltjes transforms (LSTs) of the regeneration period (the system life cycle), and the Laplace transforms (LTs) of the times to the first failure and between system failures are calculated. In Section 4 and Section 5, the time-dependent system state probabilities (TDSSPs) and stationary system state probabilities (SSSPs) are calculated. Finally, using some numerical examples, we demonstrate the effect of type of distributions and their parameter on the reliability and probabilistic measures of the system in Section 6. The paper ends with a conclusion.

2. The Problem Set: Assumptions and Notations

Consider a homogeneous cold double redundant renewable system with generally distributed life- and repair times, which, according to modified Kendall’s notations [11], will be denoted as < G I 2 / G I / 1 >. The system consists of two identical units which can be in two possible states: operational and failed. The system fails when both of units are in a failed state. For the renewable system, different strategies of its renovation are possible. In this paper, we consider a strategy when a new system cycle begins at the point in time when one unit starts working while the other unit failed and is being repaired.
Denote by A i ( i = 1 , 2 , ) , life times of the system units, by B i ( i = 1 , 2 , ) , its repair times, and suppose that all these random variables (RVs) are mutually independent and identically distributed. Thus, denote by A ( t ) = P [ A i t ] and B ( t ) = P [ B i t ] the corresponding cumulative distribution functions (CDFs). Denote also by A and B the RVs with the same CDFs as A i and B i , respectively. Suppose that the instantaneous failures and repairs are impossible and their mean times are finite:
A ( 0 ) = B ( 0 ) = 0 , a = 0 ( 1 A ( x ) ) d x < , b = 0 ( 1 B ( x ) ) d x < .
Denote by E the set of system states. We assume that E = { i = 0 , 1 , 2 } , where i stands for the number of failed units, and we introduce a random process J = { J ( t ) , t 0 } , where
J ( t ) = number   of   failed   units   at   time t .
A simple state transition diagram is illustrated in Figure 1.
Denote by F the time between system failures, i.e., the period of time the system begins to operate again up to the next system failure. We remind that the system is again in an operational state when operation of one unit and repair of another one begin simultaneously. Denote by F 1 the time to first system failure (the time from the epoch when both units are in operational state up to the system failure) (see Figure 2). The functions F ( t ) = P [ F t ] and F 1 ( t ) = P [ F 1 t ] are corresponding CDFs.
We are interesting in calculation of the reliability function
R ( t ) = P [ F 1 > t ] = 1 F 1 ( t ) ,
distribution of time to the first failure F 1 ( t ) , time-dependent system state probabilities (TDSSPs)
π j ( t ) = P [ J ( t ) = j ] , j = 0 , 1 , 2 ,
and stationary system state probabilities (SSSPs)
π j = lim t π j ( t ) lim t P [ J ( t ) = j ] , j = 0 , 1 , 2 ,
as well as the availability coefficient
K av . = π 0 + π 1 = 1 π 2 .
The following notations will be used next.
  • The Laplace–Stiltjes transforms (LSTs) of their CDFs are denoted as:
    a ˜ ( s ) = E e s A = 0 e s x d A ( x ) , b ˜ ( s ) = E e s B = 0 e s x d B ( x ) , f ˜ ( s ) = E e s F = 0 e s x d F ( x ) , f ˜ 1 ( s ) = E e s F ( 1 ) = 0 e s x d F 1 ( x ) .
  • In the case when the repair completion comes before the failure of other unit and when an operative unit fails before the repair completion of other unit, the distributions are equal, respectively,
    a B ( t ) = 0 t B ( x ) d A ( x ) = P [ B A t ] , b A ( t ) = 0 t A ( x ) d B ( x ) = P [ A B t ] .
    Applying the Laplace transform (LT) for a B ( t ) and b A ( t ) , we get
    a ˜ B ( s ) = 0 e s t d a B ( t ) = 0 e s x B ( x ) d A ( x ) , b ˜ A ( s ) = 0 e s t d b A ( t ) = 0 e s x A ( x ) d B ( x ) .
  • Their derivatives with sign minus in point zero are denoted by:
    a B = d d s a ˜ B ( s ) | s = 0 = 0 x B ( x ) d A ( x ) , b A = d d s b ˜ A ( s ) | s = 0 = 0 x A ( x ) d B ( x ) .
  • The probabilities P [ B A ] and P [ B A ] are associated with transformations through the following ratios:
    a ˜ B ( 0 ) = 0 B ( x ) d A ( x ) = P [ B A ] p , b ˜ A ( 0 ) = 0 A ( x ) d B ( x ) = P [ B > A ] q = 1 p .
  • Note the property of transformations (1)
    a ˜ 1 B ( s ) = a ˜ ( s ) a ˜ B ( s ) , b ˜ 1 A ( s ) = b ˜ ( s ) b ˜ A ( s ) .

3. Reliability Function

Process J is a regenerative one. A trajectory of this process is illustrated in Figure 2.
Here, F stands for the time between system failures, i.e., the period of time the system begins to operate again (state 1) up to the next system failure (state 2). The variable G specifies the length of a regenerative cycle according to a defined renovation policy. The following lemma holds for the LSTs of the time F between failures and the time to the first failure F 1 .
Lemma 1.
The LST f ˜ ( s ) = E e s F of the time F between failures and the LST f ˜ 1 ( s ) = E e s F 1 of the time to the first failure F 1 are of the form:
f ˜ ( s ) = a ˜ ( s ) a ˜ B ( s ) 1 a ˜ B ( s ) , f ˜ 1 ( s ) = a ˜ ( s ) a ˜ ( s ) a ˜ B ( s ) 1 a ˜ B ( s ) .
Proof. 
The life time of the system F is a time between two successive failures. After a failure in state 0, the system goes to state 1 where there can be two events: either the recovery of a unit in state 1 in time B and subsequent transition again to state 0 or a failure of a second unit in time A will happen. After a failure in state 1, the system comes back to state 1 in time B. Hence, as it can be seen from Figure 2, the system lifetime F satisfies the following stochastic equation:
F = A + F if B < A , A if B > A .
The time to the first system failure F 1 satisfies
F 1 = A + F .
Applying LT to the Equation (5) and taking into account notations (1), one can obtain
f ˜ ( s ) = E e s F = 0 e s t d F ( t ) = = 0 e s x B ( x ) f ˜ ( s ) + ( 1 B ( x ) ) d A ( x ) = = f ˜ ( s ) a ˜ B ( s ) + a ˜ 1 B ( s ) .
Due to the last equation, one can find that the LST of the system lifetime f ˜ ( s ) is given by the first relation in of (4). The second equation of lemma directly follows from stochastic Equation (6). □
Remark 1.
Let φ ˜ i ( s ) , i = 0 , 1 , 2 , be the LST of the distribution of time to the first failure of the system, starting from state i at t = 0 . In previous statement f ˜ 1 ( s ) = φ ˜ 0 ( s ) . The following equations hold:
φ ˜ 0 ( s ) = q ˜ 0 , 1 ( s ) φ ˜ 1 ( s ) , φ ˜ 1 ( s ) = q ˜ 1 , 1 ( s ) φ ˜ 1 ( s ) + q ˜ 1 , 2 ( s ) .
Here, q ˜ i , j ( s ) stands for the LST of the transition time distribution q i , j ( t ) from state i to state j. Obviously, we have q ˜ 0 , 1 ( s ) = a ˜ ( s ) , q ˜ 1 , 1 ( s ) = a ˜ B ( s ) and q ˜ 1 , 2 ( s ) = a ˜ 1 B ( s ) . Expressing φ ˜ 0 ( s ) , we get the relation
φ ˜ 0 ( s ) = q ˜ 0 , 1 ( s ) q ˜ 1 , 2 ( s ) 1 q ˜ 1 , 1 ( s ) ,
which coincide with the relation (4) for the first time to failure.
The main result of this section is the following theorem:
Theorem 1.
The LT R ˜ 1 ( s ) of the system reliability function R 1 ( t ) = 1 F 1 ( t ) is
R ˜ 1 ( s ) = ( 1 a ˜ ( s ) ) ( 1 + a ˜ ( s ) a ˜ B ( s ) ) s ( 1 a ˜ B ( s ) ) .
Proof. 
Taking into account that the LT of any CDF connected with its LST through a relation
F ˜ 1 ( s ) = 0 e s t F 1 ( t ) d t = 1 s 0 e s t d F 1 ( t ) = 1 s f ˜ 1 ( s ) ,
the LT R ˜ 1 ( s ) of the reliability function R 1 ( t ) = 1 F 1 ( t ) can be derived using (4) in form
R ˜ 1 ( s ) = 1 s F ˜ 1 ( s ) = 1 s ( 1 f ˜ 1 ( s ) ) = 1 a ˜ B ( s ) a ˜ 2 ( s ) + a ˜ ( s ) a ˜ B ( s ) s ( 1 a ˜ B ( s ) ) = ( 1 a ˜ ( s ) ) ( 1 + a ˜ ( s ) a ˜ B ( s ) ) s ( 1 a ˜ B ( s ) ) ,
which ends the proof. □
Corollary 1.
The LT R ˜ ( s ) of the survival probability R ( t ) = 1 F ( t ) is of the form
R ˜ ( s ) = R ˜ ( s ) 1 + a ˜ ( s ) a ˜ B ( s ) = 1 a ˜ ( s ) s ( 1 a ˜ B ( s ) ) ,
which follows directly from (4) and (8).
Corollary 2.
The mean system life time between failures E [ F ] and mean time to the first failure E [ F 1 ] are of the form:
E [ F ] = a q , E [ F 1 ] = a + a q .
Proof. 
The first relation follows from the equality
E [ F ] = R ˜ ( 0 ) = lim s 0 1 a ˜ ( s ) s ( 1 a ˜ B ( s ) ) = a 1 a ˜ B ( 0 ) = a q ,
and the second one follows directly from the relation (6). □

4. Time Dependent System State Probabilities

4.1. Definition

For calculation of the time dependent system state probabilities (TDSSP), we use a renewal theory. In our case, the process J is a regenerative process with a delay (see Figure 2) and its regeneration times are
S 0 = 0 , S 1 = A 1 , S 2 = S 1 + G 1 , , S k + 1 = S k + G k , .
Here, regeneration cycles G i ( i = 1 , 2 , ) are the time intervals between two successive returns of the process J into state 1 after a system failure, when one of the system units begins to operate and another one is being repaired. Thus, if the system functioning begins when both units are in operational state, the first regeneration period differs from the others and has the duration A 1 . The state probabilities of the process J in any time t
π j ( t ) = P { J ( t ) = j } , j = 0 , 1 , 2
can be represented in terms of its distribution over separate regeneration period
π j ( 1 ) ( t ) = P [ J ( t ) = j , t < G ] , j = 0 , 1 , 2 ,
and the renewal function H ( t ) can be defined as follows:
π i ( t ) = π i ( 1 , 1 ) ( t ) + 0 t d H ( u ) π j ( 1 ) ( t u ) .
The distribution of the process J on this period is of the form
π j ( 1 , 1 ) ( t ) = P [ J ( t ) = j , t < A 1 ] = δ j 0 ( 1 A ( t ) ) .
In terms of the CDF G ( t ) = P [ G i t ] of RVs G i , a renewal function H ( t ) is determined as follows:
H ( t ) = k 1 P 1 i k G i t = k 1 G * k ( t ) .
On the basis of the foregoing, the next lemma can be proved. Consider, first of all, the regeneration cycle distribution.
Lemma 2.
The LST of the regeneration cycle is of the form:
g ˜ ( s ) = E [ e s G ] = b ˜ A ( s ) 1 a ˜ B ( s ) .
Proof. 
The regeneration cycle is a time between two successive visits of state 1 where two events can occur: either the recovery of a unit in state 1 in time B and subsequent transition to state 0 or a failure of a second unit in time A happens. Figure 2 shows that RV G satisfies the following stochastic equation due to independence of RVs A and B:
G = A + G if A > B , B if A B .
Applying LST to this stochastic equation, we obtain
g ˜ ( s ) = E e s G = 0 e s t d G ( t ) = 0 d A ( x ) B ( x ) e s x g ˜ ( s ) + y > x e s y d B ( y ) = = g ˜ ( s ) 0 e s x B ( x ) d A ( x ) + 0 e s y A ( y ) d B ( y ) = = g ˜ ( s ) a ˜ B ( s ) + b ˜ A ( s ) ,
which implies the expression (15) for the LST of the regeneration period. □
As a corollary, we obtain the mean length of the regeneration period.
Corollary 3.
The mean length of the regeneration period can be defined as:
E [ G ] = a B + b A q .
Proof. 
The proof is obtained by differentiation
E [ G ] = d d s g ˜ ( s ) | s = 0 = b ˜ A ( 0 ) ( 1 a ˜ B ( 0 ) ) + a ˜ B b ˜ A ( 0 ) ( 1 a ˜ B ( 0 ) ) 2 .
This expression leads to expression (18) due to properties of a ˜ B ( 0 ) and b ˜ A ( 0 ) . □
Lemma 3.
The LST of the system renewal function is given by:
h ˜ ( s ) = b ˜ A ( s ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) .
Proof. 
From the renewal theory, it is well known (and follows from (14)) that the LST of the renewal function H ( t ) is defined as h ˜ ( s ) = g ˜ ( s ) ( 1 g ˜ ( s ) ) 1 . Thus, substitution to this expression of (15) for g ˜ ( s ) leads to (19). □
Theorem 2.
The LTs π ˜ j ( s ) of the TDSSPs π j ( t ) ( j = 0 , 1 , 2 ) are of the form:
π ˜ j ( s ) = δ j 0 1 a ˜ ( s ) s + b ˜ a ( s ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) π ˜ j ( 1 ) ( s ) , j = 0 , 1 , 2 ,
where π ˜ j ( 1 ) ( s ) ( j = 0 , 1 , 2 ) are the LTs of the TDSSPs π j ( 1 ) ( t ) ( j = 0 , 1 , 2 ) in a separate regeneration period. These probabilities will be calculated in the next subsection.
Proof. 
The form of Equations (12) and (14) prompts to calculate the process state probabilities in terms of their LTs and the renewal function LST
π ˜ j ( s ) = 0 e s t π j ( t ) d t , h ˜ ( s ) = 0 e s t d H ( t ) .
Applying LT to Equation (12) and taking into account Equation (13), one can obtain
π ˜ j ( s ) = δ j 0 1 a ˜ ( s ) s + h ˜ ( s ) π ˜ j ( 1 ) ( s ) .
Substitution into this equality of the expression for h ˜ ( s ) (19) leads to (20) and completes the proof. □

4.2. The State Probabilities in a Separate Regeneration Period

Now, we calculate the TDSSPs in a separate regeneration period. The probability π 2 ( 1 ) ( t ) can be calculated very easily in the main level regeneration period.
Lemma 4.
The LT of the second TDSSP π 2 ( 1 ) ( t ) in the main regeneration period is given by
π ˜ 2 ( 1 ) ( s ) = a ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) s ( 1 a ˜ B ( s ) ) .
Proof. 
Due to representation of the regeneration period by Formula (16), the event { J ( t ) = 2 , t < G } occurs if and only if either the event { A 1 t B 1 } occurs or the events { t > u = A 1 > B 1 } and { J ( t u ) = 2 , t u < G } occur. Thus, as it is shown in Figure 2, for the probability π 2 ( 1 ) ( t ) , it holds that
π 2 ( 1 ) ( t ) = P [ J ( t ) = 2 , t < G ] = P [ A t < B ] + 0 t d A ( u ) B ( u ) π 2 ( 1 ) ( t u ) .
From this equation for the LST, it follows
π ˜ 2 ( 1 ) ( s ) = 0 e s t A ( t ) ( 1 B ( t ) ) d t + a ˜ B ( s ) π 2 ( 1 ) ( s )
and
π ˜ 2 ( 1 ) ( s ) = 1 1 a ˜ B ( s ) 0 e s t A ( t ) ( 1 B ( t ) ) d t .
Calculating LTs of the integral in these expressions using partial integration, we obtain
π ˜ 2 ( 1 ) ( s ) = 1 1 a ˜ B ( s ) 0 e s t A ( t ) ( 1 B ( t ) ) d t = = 1 s ( 1 a ˜ B ( s ) ) e s t A ( t ) ( 1 B ( t ) ) d t | 0 + + 1 s ( 1 a ˜ B ( s ) ) 0 e s t [ d A ( t ) ( 1 B ( t ) ) A ( t ) d B ( t ) ] = = a ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) s ( 1 a ˜ B ( s ) )
that completes the proof. □
Since the calculation of the probabilities π j ( 1 ) ( j = 0 , 1 ) is not a trivial task, we intend to apply the theory of DSRP [3,8,12]. According to this theory, the further analysis can be described as follows. As it was shown in the Equation (12), the process distribution can be represented in terms of its distribution in embedded regeneration cycles and embedded renewal function. This approach is useful if the behavior of the process is too complex in order to derive a state distribution directly, but the embedded regeneration epochs are available. At known regeneration epochs S k ( 1 ) , the distribution in the basic regeneration period (regeneration period of the first level) π i ( 1 ) ( t ) similar to the Equation (12) can be represented in terms of distributions in embedded regeneration cycles (regeneration cycles of the second level) π j ( 2 ) ( t ) and embedded renewal function H ( 1 ) ( t ) in the following way:
π j ( 1 ) ( t ) = π j ( 2 ) ( t ) + 0 d H ( 1 ) ( u ) π j ( 2 ) ( t u ) , j = 0 , 1 ,
where
π j ( 2 ) ( t ) = P { J ( t ) = j , t < G ( 2 ) } , j = 0 , 1
is the process state distribution in a separate regeneration period of the second level. In this case as embedded regeneration epochs, we choose the random number ν = min { n : A n < B n } of time epochs
S 1 ( 1 ) = A 1 1 { A 1 > B 1 } , S 2 ( 1 ) = S 1 ( 1 ) + A 2 1 { A 1 > B 1 , A 2 > B 2 } ,
up to time, when the event { A n B n } occurs for the first time. It means that the time interval G ( 1 ) between embedded regeneration epochs has a distribution G ( 1 ) ( t ) = A ( t ) and these epochs in the time interval F are determined by Equation (5). According to the theory of DSRP, the embedded renewal function H ( 1 ) ( t ) satisfies the equation
H ( 1 ) ( t ) = A ( t ) + 0 t d H ( 1 ) ( u ) A ( t u ) F ( t ) ,
where F ( t ) is a CDF of the time between system failures determined by its LST (4).
Similar to the basic case, the solution of Equations (23) and (24) can be represented in terms of their LTs and LSTs:
π ˜ j ( 2 ) ( s ) = 0 e s t π j ( 2 ) ( t ) d t , h ˜ ( 1 ) ( s ) = 0 e s t d H ( 1 ) ( t ) .
The next lemma specifies connections between process distributions in the first and in the second level regeneration cycles in terms of their LTs.
Lemma 5.
The TDSSPs in the first and in the second level regeneration cycles in terms of the LTs satisfy the relation
π ˜ j ( 1 ) ( s ) = π ˜ j ( 2 ) ( s ) a ˜ B ( s ) 1 a ˜ B ( s ) j = 0 , 1 .
Proof. 
Applying LT to Equation (23), we get
π ˜ j ( 1 ) ( s ) = ( 1 + h ˜ ( 1 ) ( s ) ) π ˜ j ( 2 ) ( s ) ,
where, due to (24), the LST h ˜ ( 1 ) ( s ) of the embedded renewal function H ( 1 ) ( t ) is of the form
h ˜ ( 1 ) ( s ) = a ˜ ( s ) + h ˜ ( 1 ) ( s ) a ˜ ( s ) f ˜ ( s ) ,
which leads in turn to
h ˜ ( 1 ) ( s ) = a ˜ ( s ) f ˜ ( s ) 1 a ˜ ( s ) .
Substitution of this relation to the Equation (26) and taking into account expressions for f ˜ ( s ) from (4) implies the result (22) that completes the proof. □
We have to calculate now only π ˜ j ( 2 ) ( s ) ( j = 0 , 1 ) .
Lemma 6.
In notations (4), the LTs of the second level system state probabilities are:
π ˜ 0 ( 2 ) ( s ) = 1 s ( a ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) ) ; π ˜ 1 ( 2 ) ( s ) = 1 s [ 1 ( a ˜ ( s ) + b ˜ ( s ) ) + ( a ˜ B ( s ) + b ˜ A ( s ) ) ] .
Proof. 
First, consider appropriate expressions for π ˜ j ( 2 ) ( t ) ( j = 0 , 1 ) . From Figure 2, it follows that
  • The event { J ( t ) = 0 , t < G ( 1 ) } occurs if and only if { B t < A } ;
  • The event { J ( t ) = 1 , t < G ( 1 ) } occurs if and only if { t < B A } or { t < A B } ;
Hence, the appropriate probabilities are
π 0 ( 2 ) ( t ) = P [ B < t < A ] = B ( t ) ( 1 A ( t ) ) , π 1 ( 2 ) ( t ) = P [ t < B < A ] + P [ t < A < B ] = = t ( 1 A ( u ) ) d B ( u ) + t ( 1 B ( u ) ) d A ( u ) .
Calculating LTs of these expressions by partial integration in terms of notations (1) gives
π ˜ 0 ( 2 ) ( s ) = 0 e s t B ( t ) ( 1 A ( t ) ) d t = = 1 s 0 e s t [ d B ( t ) ( 1 A ( t ) ) B ( t ) d A ( t ) ] = = 1 s ( b ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) ) ; π ˜ 1 ( 2 ) ( s ) = 0 e s t t ( 1 A ( u ) ) d B ( u ) + ( 1 B ( u ) ) d A ( u ) = = 0 0 u e s t d t ( 1 A ( u ) ) d B ( u ) + ( 1 B ( u ) ) d A ( u ) = = 1 s 0 ( 1 e s u ) ( 1 A ( u ) ) d B ( u ) + ( 1 B ( u ) ) d A ( u ) = = 1 s [ 1 ( a ˜ ( s ) + b ˜ ( s ) ) + ( a ˜ B ( s ) + b ˜ A ( s ) ) ]
that ends the proof. □
By combining all obtained results for LTs of the TDSSPs, one can get the following statement.
Theorem 3.
The LTs of the TDSSPs are of the form:
π ˜ 0 ( s ) = 1 a ˜ ( s ) s + b ˜ A ( s ) s ( 1 a ˜ B ( s ) ) × b ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) ; π ˜ 1 ( s ) = b ˜ A ( s ) s ( 1 a ˜ B ( s ) ) × 1 ( a ˜ ( s ) + b ˜ ( s ) ) + ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) ; π 2 ( s ) = b ˜ A ( s ) s ( 1 a ˜ B ( s ) ) × a ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) .
Proof. 
For j = 0 , 1 , the proof is presented as a series of equalities:
π ˜ j ( s ) = δ j 0 1 a ˜ ( s ) s + h ˜ ( s ) π j ( 1 ) ( s ) = = δ j 0 1 a ˜ ( s ) s + g ˜ ( s ) 1 g ˜ ( s ) ( 1 + h ˜ j ( 1 ) ( s ) ) π j ( 2 ) ( s ) = = δ j 0 1 a ˜ ( s ) s + b ˜ A ( s ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) a ˜ ( s ) f ˜ ( s ) 1 a ˜ ( s ) π j ( 2 ) ( s ) = = δ j 0 1 a ˜ ( s ) s + b ˜ A ( s ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 1 a ˜ B ( s ) π j ( 2 ) ( s ) .
Substitution of expressions (27) for π ˜ j ( 2 ) ( s ) leads to the first two formulas from (29). For the last one, it holds that
π ˜ 2 ( s ) = h ˜ ( s ) π ˜ 2 ( 1 ) ( s ) = g ˜ ( s ) 1 g ˜ ( s ) π ˜ 2 ( 1 ) ( s ) = b ˜ A ( s ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) π ˜ 2 ( 1 ) ( s ) .
Substitution into this formula of expression (22) for π ˜ 2 ( 1 ) ( s ) leads to the last formula from (29). □

5. Stationary State Probabilities

To calculate the stationary state probabilities (SSSPs), we use a Tauber theorem. Due to (29), we get
π j = lim t π j ( t ) = lim s 0 s π ˜ j ( s ) .
By means of this formula, we can prove the next statement.
Theorem 4.
The system state stationary probabilities are:
π 0 = 1 b a B + b A , π 1 = a + b a B + b A 1 , π 2 = 1 a a B + b A .
Proof. 
According to the limit relation (30), we obtain
π 0 = lim s 0 1 a ˜ ( s ) + b ˜ A ( s ) 1 a ˜ B ( s ) × b ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) = = lim s 0 b ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) ; π 1 = lim s 0 b ˜ A ( s ) 1 a ˜ B ( s ) × 1 ( a ˜ ( s ) + b ˜ ( s ) ) + ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) ; = lim s 0 1 ( a ˜ ( s ) + b ˜ ( s ) ) + ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) ; π 2 = lim s 0 b ˜ A ( s ) 1 a ˜ B ( s ) × a ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) = = lim s 0 a ˜ ( s ) ( a ˜ B ( s ) + b ˜ A ( s ) ) 1 ( a ˜ B ( s ) + b ˜ A ( s ) ) .
Using L’Hopital’s rule, we get the next
π 0 = b ˜ ( 0 ) ( a ˜ B ( 0 ) + b ˜ A ( 0 ) ) ( a ˜ B ( 0 ) + b ˜ A ( 0 ) ) = 1 b a B + b A ; π 1 = ( a ˜ ( 0 ) + b ˜ ( 0 ) ) + ( a ˜ B ( 0 ) + b ˜ A ( 0 ) ) ( a ˜ B ( 0 ) + b ˜ A ( 0 ) ) = a + b a B + b A 1 ; π 2 = a ˜ ( 0 ) ( a ˜ B ( 0 ) + b ˜ A ( 0 ) ) ( a ˜ B ( 0 ) + b ˜ A ( 0 ) ) = 1 a a B + b A
that completes the proof. □
Example 1.
As an example, consider a Markov model < M 2 | M | 1 > , when
A ( t ) = 1 e α t , B ( t ) = 1 e β t .
For the SSSPs, we get in terms of parameter ρ = α β :
a B + b A = 1 α + 1 β 1 α + β = α 2 + α β + β 2 α β ( α + β )
Now, for π j ( j = 0 , 1 , 2 ) , it holds that
π 0 = 1 b a b + b A = 1 α ( α + β ) α 2 + α β + β 2 = 1 1 + ρ + ρ 2 ; π 1 = a + b a B + b A 1 = α β α 2 + α β + β 2 = ρ 1 + ρ + ρ 2 ; π 2 = 1 a a B + b A = α 2 α 2 + α β + β 2 = ρ 2 1 + ρ + ρ 2 .
This result coincides with those calculated by direct approach using Birth and Death process for the Markov case.

6. Numerical Analysis

In this section, we study the sensitivity of reliability function, TDSSPs and SSSPs to types of distribution functions and their parameters. The life- and repair-times will follow exponential, PH-type, Pareto and log-normal distributions. For valid comparison of the results, we choose the parameters of these distributions in such a way that the mean and the variance of the life and repair times always coincide with an exponential version, i.e., E [ A ] = a = 1 α and E [ B ] = b = 1 β . Now, we give a short description of the considered life-time distributions A ( t ) with appropriately selected parameters. The repair-time distributions B ( t ) are defined by analogy.
The PH-type distribution PH with representation ( η , M ) ,
A ( t ) = 1 η e M t 1 , E [ A ] = a = η M 1 1 = 1 α , V [ A ] = 2 η M 2 1 a 2 = 1 α 2 ,
where η = ( 0.7 , 0.1 , 0.2 ) and
M = 0.80 0.19 0.50 3.35 3.50 0.10 0.80 0.60 1.50 for a = 10 , M = 2.80 1.14 1.00 13.39 15.00 1.50 2.80 1.60 4.50 for a = 2 , M = 8.00 1.94 5.00 33.48 35.00 1.00 8.00 6.00 15.00 for a = 1 , M = 16.00 1.03 10.00 25.43 35.00 2.00 16.00 10.00 30.00 for a = 0.2 , M = 35.00 18.81 5.00 94.70 110.00 10.00 10.00 60.00 80.00 for b = 0.1 .
The Pareto distribution PAR with parameters ( k , t min ) ,
A ( t ) = 1 t min t k , t t min , k = 1 + 2 , t min = 2 α ( 1 + 2 ) .
The log-normal distribution LN with parameters ( μ , σ ) ,
A ( t ) = Φ ln ( x ) μ σ , μ = ln 1 α ln ( 2 ) 2 , σ = ln ( 2 ) .
Now, we fix the parameters of the repair-time distributions to guarantee that E [ B ] = b = 0.1 and V [ B ] = 0.01 . In Figure 3, we demonstrate the reliability R 1 ( t ) and survival R ( t ) functions obtained by numerical inversion with Euler algorithm of the corresponding LTs (8) and (9) in case A PH ( η 1 , M 1 ) and B PH ( η 2 , M 2 ) . Obviously, for a 1 , we observe that the functions exhibit a heavier tail. Note that these graphics are indistinguishable from those obtained for exponential distributions.
In case it is not feasible to evaluate Laplace–Stieltjes transforms in explicit form (4), different approaches can be used instead to recover the distribution function via moments. We have tried the maximum entropy solution and simple fitting by a mixture of exponential distributions. Both of these methods work and give reasonable approximations. For details about maximum entropy solution, the reader is referred to Falin et al. [22]. To illustrate this methodology, we limit ourselves to analyzing the length of the system life time between failures F, when the first, e.g., four moments E [ F k ] = ( 1 ) k d k d s k f ˜ ( s ) | s = 0 , 1 k m = 4 , are available,
E [ F ] = a q , E [ F 2 ] = 2 a · a B + q a ( 2 ) q 2 , E [ F 3 ] = 3 a ( q a B ( 2 ) + 2 a B 2 ) + q ( 3 a ( 2 ) a B + q a ( 3 ) ) q 3 , E [ F 4 ] = 4 a ( 6 a B 2 + 6 q a B a B ( 2 ) + q 2 a B ( 3 ) ) + q ( 12 a ( 2 ) a B 2 + 4 q a ( 3 ) a B + q ( 6 a ( 2 ) a B ( 2 ) + q a ( 4 ) ) ) q 4 ,
where a ( k ) = E [ A k ] , a B ( k ) = 0 x k B ( x ) d A ( x ) . From the maximum entropy formalism, it is known that the maximum entropy solution is of the form
f ^ ( t ) : = f ^ ( t ; m ) = e c 0 k = 1 m c k t k , t > 0
with c 0 = ln 0 1 e k = 1 m c k t k d t . The Lagrangian coefficients c k , 1 k m , can be calculated as a solution of the following minimization problem:
g ( c 1 , , c m ) = ln 0 e k = 1 m c k ( t k E [ F k ] ) d t .
To solve this problem and obtain optimal c k * , we use Nelder and Mead’s algorithm. This direct search method doesn’t use derivatives and hence can be used also in case of an almost singular Hessian of g ( c 1 , , c m ) .
In Figure 4, we plot the maximum entropy solution R ^ ( t ) for the function R ( t ) in the case when RV A und B either simultaneously A LN ( μ 1 , σ 1 ) and B LN ( μ 2 , σ 2 ) or A PH ( η 1 , M 1 ) and B PH ( η 2 , M 2 ) . We see that, in the log-normal case, the functions exhibit heavier tails by increasing of the mean value as. Figure 3a and Figure 4b can be used to compare the maximum entropy solution with a true function in the case of a PH-type distribution. We may notice no sufficient difference in graphics of functions.
Figure 5 and Figure 6 provide the TDSSPs for the PH-type distributed life- and repair-times for different values of a. It should be noticed that the state probability function π 0 ( t ) exhibits a concave structure with a corresponding minimum which is shifted to the left as a decreases. The function π 0 ( t ) in Figure 5a is shown only up to its minimum but further it increases as well and converges to a stationary value. In addition, we can see how fast the function π i ( t ) converges to a stationary value π i as a decreases. We strongly believe that the proposed above methodology of distribution recovery via moments will also be helpful for evaluation of the TDSSPs, when there are no closed forms of LSTs for life- and repair-time distributions.
The results of SSSP and mean lifetime calculation for different types of distribution pairs A ( t ) and B ( t ) are summarized in Table 1, Table 2, Table 3, Table 4 and Table 5. In all cases, the parameters were selected for mean and variance value constraints, i.e., a = E [ A ] = 1 α , b = E [ B ] = 1 β , V [ A ] = 1 α 2 and V [ A ] = 1 β 2 . In experiments demonstrated in Table 1, the life- and repair time distributions have the same distributions but with different parameters fitting to a = 1 and b = 0.1 . High mean values for the time to failure and the time between failures are a consequence of the Pareto distribution property that is defined for t t min .
The exponential and PH-type distributions generate almost indistinguishable results. We also notice that the distributions with heavier tails decrease the probability of two operational units.
Table 2, Table 3, Table 4 and Table 5 present calculations for the systems with different pairs of life- and repair times distributions. The results for exponential and PH-type life type distributions in Table 2 and Table 3 are very similar. In addition, there are no sufficient differences in obtained results between different repair time distributions.
As it is shown in Table 4 and Table 5, the heavy-tailed Pareto and log-normal life-time distributions are a cause for reduction of the system failure probability and increase the mean time to failure and the mean time between failures. Hence, we notice that reliability and probabilistic characteristics of the system are more sensitive to changing the form of distribution functions when they exhibit heavier tails.

7. Conclusions

We provide probabilistic and reliability analysis of a cold double redundant renewable system with generally distributed life and repair times. We derive in closed-form the reliability function, the time-dependent as well as stationary system state distributions using LSTs and LTs. Numerical results illustrate sensitivity and effect of distribution functions and their parameters on reliability and probabilistic measures of the system. The presented system can be made preventive maintainable. We believe that the corresponding maintenance policy can be effective and leads to an increase in the system reliability.

Author Contributions

Conceptualization, V.R. and D.E.; methodology, V.R., D.E. and J.S.; software, D.E. and N.S.; validation, D.E. and N.S.; formal analysis, V.R., D.E. and N.S.; investigation, V.R. and D.E.; writing—original draft preparation, V.R. and D.E.; writing—review and editing, D.E. and N.S.; supervision, D.E.; project administration, D.E. and N.S. All authors have read and agreed to the published version of the manuscript.

Funding

The publication has been prepared with the support of the “RUDN University Program 5-100” (V.R. and D.E.: Mathematical model development, investigation, methodology, validation). The reported study was funded by RFBR, project number 17-01-00633 (V.R.: Conceptualization and formal analysis).

Acknowledgments

The authors acknowledge, with gratitude, the constructive comments and suggestions of anonymous referees and the Editor.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Smith, W.L. Regenerative Stochastic Processes. Proc. R. Soc. Ser. A 1955, 232. [Google Scholar] [CrossRef]
  2. Cinlar, E. On semi-Markov processes on arbitrary space. Proc. Camb. Philos. Math. Proc. Camb. Philos. Soc. 1969, 66, 381–392. [Google Scholar] [CrossRef]
  3. Rykov, V.; Yastrebetetsky, M. On regenerative processes with several types of regeneration states. Cybernetics 1971, 3, 82–86. [Google Scholar]
  4. Klimov, G.P. Probability Theory and Mathematical Statistics; Moscow State University: Moscow, Russia, 1983. [Google Scholar]
  5. Jacod, J. Theoreme de renouvelltment et classification pour les chaines semi-Markoviennes. Ann. Inst. Henri Poincare Sect. B 1971, 7, 83–129. [Google Scholar]
  6. Nummelin, E. Uniform and ratio-limit theorems for Markov-renewal and semi-regenerative processes on a general state space. Ann. Inst. Henri Poincare Sect. B 1978, 14, 119–143. [Google Scholar]
  7. Rykov, V.; Yastrebenetsky, M. Regenerative processes with embedded regeneration periods and their applications in priority queuing systems. Cybernetics 1975, 6, 954–960. [Google Scholar] [CrossRef]
  8. Rykov, V.; Jolkoff, S. Generalized regenerative processes with embedded regeneration periods and their applications. MOS Ser. Optim. 1981, 12, 575–591. [Google Scholar]
  9. Rykov, V. Investigation of the GI/GI/1/ system with the help of the regenerative method I. Izv. ANSSSR Technol. Cybern. 1983, 6, 13–20. [Google Scholar]
  10. Rykov, V. Investigation of the GI/GI/1/ system with the help of the regenerative method II. Investigation of main processes in the regeneration period. Izv. ANSSSR Technol. Cybern. 1984, 1, 126–132. [Google Scholar]
  11. Kendall, D.G. Stochastic processes occurring in the theory of queues and their analysis by the method of embedded Markov chains. Ann. Math. Stat. 1953, 24, 338–354. [Google Scholar] [CrossRef]
  12. Rykov, V. Decomposable Semi-Regenerative Processes and Their Applications; Lap Lambert Academic Publishing: Berlin, Germany, 2011. [Google Scholar]
  13. Rykov, V. To polling systems analysis. Autom. Remote Control 2009, 6, 90–118. [Google Scholar]
  14. Belyaev, Y.K. Linear Markov processes and their applications to reliability problems. In Proceedings of the VI Alunuon Workshop on Probability Theory and Mathematical Statistics, Vilnius, Lithuania, 12–18 August 1962; pp. 309–323. [Google Scholar]
  15. Rykov, V. On Reliability of Renewable Systems. In Reliability Engineering. Theory and Applications; CRC Press: Boca Raton, FL, USA, 2018; pp. 173–196. [Google Scholar]
  16. Mazumdar, M. Reliability of two-unit redundant repairable systems when failures are revealed by inspections. SIAM J. Appl. Math. 1979, 19, 637–647. [Google Scholar] [CrossRef]
  17. Mine, H.; Asakura, T. The effect of an age replacement to a standby redundant system. J. Appl. Prob. 1969, 6, 516–523. [Google Scholar] [CrossRef]
  18. Gaver, D.P. Time to failure and availability of paralleled redundant systems with repair. IEEE Trans. Reliab. 1963, 12, 30–38. [Google Scholar] [CrossRef]
  19. Gnedenko, B.V.; Belyaev, Y.K.; Solvyev, A.D. Mathematical Methods of Reliability Theory; Birnbaum, Z.W., Lukacs, E., Eds.; Academic Press: New York, NY, USA, 1969; pp. 329–331. [Google Scholar]
  20. Mine, H.; Asakura, T. A two-unit standby redundant system with repair and preventive maintenance. J. Appl. Prob. 1970, 7, 641–648. [Google Scholar]
  21. Srinivasan, V.S. The effect of standby redundancy in system’s failure with repair maintenance. Oper. Res. 1966, 14, 1024–1036. [Google Scholar] [CrossRef]
  22. Falin, G.I.; Martin Dìaz, M.; Artalejo, J.R. Information theoretic approximations for the M/ G/I retrial queue. Acta Inf. 1994, 31, 559–571. [Google Scholar] [CrossRef]
Figure 1. State transition diagram.
Figure 1. State transition diagram.
Mathematics 08 00278 g001
Figure 2. Trajectory of the process J.
Figure 2. Trajectory of the process J.
Mathematics 08 00278 g002
Figure 3. Functions R 1 ( t ) (a) and R ( t ) (b) for A PH ( η 1 , M 1 ) and B PH ( η 1 , M 1 ) versus a.
Figure 3. Functions R 1 ( t ) (a) and R ( t ) (b) for A PH ( η 1 , M 1 ) and B PH ( η 1 , M 1 ) versus a.
Mathematics 08 00278 g003
Figure 4. Functions R ^ ( t ) for LN (a) and PH (b) distributions versus a.
Figure 4. Functions R ^ ( t ) for LN (a) and PH (b) distributions versus a.
Mathematics 08 00278 g004
Figure 5. TDSSPs π i ( t ) , i = 0 , 1 , 2 for a = 10 (a) and for a = 2 (b).
Figure 5. TDSSPs π i ( t ) , i = 0 , 1 , 2 for a = 10 (a) and for a = 2 (b).
Mathematics 08 00278 g005
Figure 6. TDSSPs π i ( t ) , i = 0 , 1 , 2 for a = 1 (a) and for a = 0.2 (b).
Figure 6. TDSSPs π i ( t ) , i = 0 , 1 , 2 for a = 1 (a) and for a = 0.2 (b).
Mathematics 08 00278 g006
Table 1. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] versus A ( t ) and B ( t ) .
Table 1. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] versus A ( t ) and B ( t ) .
A ( t ) , B ( t ) π 0 π 1 π 2 E [ F ] E [ F 1 ]
E 0.90090.09000.009011.000012.0000
PH 0.90090.09010.009011.005112.0051
PAR 0.90010.09890.0010519.0910520.0910
LN 0.90030.09660.003139.597640.5976
Table 2. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A E ( α ) versus B ( t ) .
Table 2. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A E ( α ) versus B ( t ) .
B ( t ) π 0 π 1 π 2 E [ F ] E [ F 1 ]
PH 0.90090.09010.009011.000012.0000
PAR 0.90070.09190.007310.797211.7972
LN 0.90090.09030.008810.973911.9739
Table 3. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A PH ( η 1 , M 1 ) versus B ( t ) .
Table 3. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A PH ( η 1 , M 1 ) versus B ( t ) .
B ( t ) π 0 π 1 π 2 E [ F ] E [ F 1 ]
E 0.90090.09010.009011.005012.0050
PAR 0.90070.09190.007311.005012.0050
LN 0.90090.09030.008811.005012.0050
Table 4. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A PAR ( k , t min ) versus B ( t ) .
Table 4. π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A PAR ( k , t min ) versus B ( t ) .
B ( t ) π 0 π 1 π 2 E [ F ] E [ F 1 ]
E 0.90000.09930.00011297.17001298.1700
PH 0.90000.09990.00011299.50001300.5000
LN 0.90010.09940.0005452.3640453.3640
Table 5. Case 5: π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A LN ( μ , σ ) versus B ( t ) .
Table 5. Case 5: π i , i = 0 , 1 , 2 , E [ F ] and E [ F 1 ] , A LN ( μ , σ ) versus B ( t ) .
B ( t ) π 0 π 1 π 2 E [ F ] E [ F 1 ]
E 0.90030.09690.002835.401136.4011
PH 0.90030.09690.002835.398836.3988
PAR 0.90020.09730.002459.463160.4631

Share and Cite

MDPI and ACS Style

Rykov, V.; Efrosinin, D.; Stepanova, N.; Sztrik, J. On Reliability of a Double Redundant Renewable System with a Generally Distributed Life and Repair Times. Mathematics 2020, 8, 278. https://doi.org/10.3390/math8020278

AMA Style

Rykov V, Efrosinin D, Stepanova N, Sztrik J. On Reliability of a Double Redundant Renewable System with a Generally Distributed Life and Repair Times. Mathematics. 2020; 8(2):278. https://doi.org/10.3390/math8020278

Chicago/Turabian Style

Rykov, Vladimir, Dmitry Efrosinin, Natalia Stepanova, and Janos Sztrik. 2020. "On Reliability of a Double Redundant Renewable System with a Generally Distributed Life and Repair Times" Mathematics 8, no. 2: 278. https://doi.org/10.3390/math8020278

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