Next Article in Journal
An Enhanced Fuzzy Hybrid of Fireworks and Grey Wolf Metaheuristic Algorithms
Next Article in Special Issue
Fractional-Order Sequential Linear Differential Equations with Nabla Derivatives on Time Scales
Previous Article in Journal
Extensions of Some Statistical Concepts to the Complex Domain
Previous Article in Special Issue
On Using Relative Information to Estimate Traits in a Darwinian Evolution Population Dynamics
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

C0–Semigroups Approach to the Reliability Model Based on Robot-Safety System

by
Ehmet Kasim
*,† and
Aihemaitijiang Yumaier
College of Mathematics and Systems Science, Xinjiang University, Urumqi 830046, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Axioms 2024, 13(7), 423; https://doi.org/10.3390/axioms13070423
Submission received: 8 May 2024 / Revised: 6 June 2024 / Accepted: 13 June 2024 / Published: 24 June 2024
(This article belongs to the Special Issue Infinite Dynamical System and Differential Equations)

Abstract

:
This paper considers a system with one robot and n safety units (one of which works while the others remain on standby), which is described by an integro-deferential equation. The system can fail in the following three ways: fails with an incident, fails safely and fails due to the malfunction of the robot. Using the C 0 semigroups theory of linear operators, we first show that the system has a unique non-negative, time-dependent solution. Then, we obtain the exponential convergence of the time-dependent solution to its steady-state solution. In addition, we study the asymptotic behavior of some time-dependent reliability indices and present a numerical example demonstrating the effects of different parameters on the system.

1. Introduction

Robots are increasingly being used for a variety of tasks, including welding, forging, resource exploration and development, disaster relief and evacuation, complex surgery, bomb disposal, and machining. Because robots use electronic, electrical, mechanical, hydraulic, and pneumatic components, reliability issues are quite difficult to address due to the diversity of failure factors in robotic systems. However, the reliability of robots, as the main technical indicator for measuring the quality of industrial robots, is receiving unprecedented attention. The unreliable robot can bring a range of issues, including human damage. Thus, it is important to carefully consider the reliability of the robot. The robots must be both reliable and safe, so it is equipped with several safety devices. To analyze the reliability of a robot, we need to consider the relationship between the reliability and the safety device.
In reliability theory, there are many methods to analyze the reliability of engineering systems. In particular, the use of supplementary variables technique to establish models and analyze the reliability of robot systems has been widely studied. In 1955, Cox [1] first proposed the “supplementary variable technique (SVT)” and established the M/G/1 queuing system. Gaver [2] was the first to apply this technique for reliability models, and subsequently, other authors followed this line of research, such as Linton [3], Gupta and Gupta [4], Shi and Li [5], Chung [6], Oliveira et al. [7], Zhang and Wu [8], Shakuntla et al. [9], Singh et al. [10], Ke et al. [11], Shekhar et al. [12], Gao and Wang [13].
There is a considerable amount of research literature on robot-safety systems, yet the research on system reliability remained limited. Most articles focus on repeatability and accuracy [14,15]. Dillon and Yang [16] first studied a system with a robot and its safety device. The mathematical model was established by introducing SVT, and the steady-state solution (S-SS) was examined by the Laplace transforms. They then investigated a system with two robots and a safety device, one working and the other in storage [17]. Many researchers subsequently used the SVT to establish various robot-safety systems and studied the steady-state reliability indices of these systems, see [18,19,20,21] and references therein. All of these researchers studied the reliability models of robot-safety systems under the assumption that the dynamic solution converges to its S-SS. The S-SS is well known to depends on the time-dependent solution (T-DS), and the T-DS can clearly reflect the operating trend of the system. As a result, it is necessary to investigate the existence and uniqueness of T-DS, as well as their asymptotic behavior and the instantaneous reliability index. In 2001, Gupur first introduced the dynamic analysis for the study of reliability models by the C 0 –semigroups theory [22,23]. Guo and Xu [24] studied a system composed of one robot and one safety device, and determined the existence and uniqueness of the system’s T-DS as well as its asymptotic behavior. Chen and Xu [25] introduced the repair rate as a periodic function for the above system and analyzed the exponentially stability. Gupur [26] considered a human–machine system and demonstrated the well posedness of the system and the asymptotic behavior of the T-DS, proved the quasi-compactness of the C 0 –semigroup, determined that the C 0 –semigroup exponentially converges to a projection operator [27], and finally obtained an expression for the projection operator using the residual theorem [28]. Zhang [29] considered a system consisting two robots and one safety unit and investigated the exponential stability of the T-DS. Qiao and Ma [30] discussed the system composed of a safety component and two redundant robots. Zhou and Wei [31] have further investigated the system studied in [24].
Based on the above literature, we found that the results of dynamic analysis of robot-safety systems are few and limited to special cases, i.e., simple systems consisting of one robot or two robots and one safety device. Recent advances have allowed robot-safety systems to become more and more complex to improve their performances. However, these complex systems have strong applicability in engineering. Thus, the reliability of complex robot-safety systems has become a serious and urgent problem. In this paper, we consider a system with one robot and n safety units and perform dynamic analysis on the system.
The robot safety system, according to Cheng and Dhillon [32], is described by the following integro-differential equations:
d P 0 ( t ) d t = a 0 P 0 ( t ) + μ s P 1 ( t ) + k = n + 1 n + 3 0 P k ( y , t ) μ k ( y ) d y , d P j ( t ) d t = λ s P j 1 ( t ) a j P j ( t ) + μ s P j + 1 ( t ) , 1 j n 1 , d P n ( t ) d t = λ s P n 1 ( t ) a n P n ( t ) , P k ( y , t ) t + P k ( y , t ) y = μ k ( y ) P k ( y , t ) , P n + 1 ( 0 , t ) = λ s s P n ( t ) , P n + 2 ( 0 , t ) = λ s i P n ( t ) , P n + 3 ( 0 , t ) = λ r j = 0 n 1 P j ( t ) . P 0 ( 0 ) = 1 , P i ( 0 ) = 0 , 1 i n , P k ( y , 0 ) = 0 , n + 1 k n + 3 .
where a 0 = λ s + λ r , a j = λ s + λ r + μ s ( 1 j n 1 ) , a n = λ s s + λ s i + μ s , and ( y , t ) [ 0 , ) × [ 0 , ) .   P i ( t ) denotes the probability that the system is in state i ( 1 i n ) at time t; P k ( y , t ) d x denotes the probability that at time t, the system is in state k ( n + 1 k n + 3 ) and the elapsed repair time is in ( y , y + Δ y ) ;   λ s / λ r represents the robot/the safety unit’s failure rate; λ s s / λ s i represents the failure rate of the system failing safely/failing with an incident; the repair rate of the safety unit is denoted by μ s ; and μ k ( y ) ( n + 1 k n + 3 ) represents the system’s repair rate when it is in state k and satisfies
μ k ( y ) 0 , 0 μ k ( y ) d y = .
The organization of the remainder of this paper is outlined below. Section 2 introduces the transformation of the given system into an abstract Cauchy problem. Section 3 examines the system’s well posedness. Section 4 investigates the exponential convergence of the T-DS to its S-SS. Section 5 discusses the asymptotic behavior of instantaneous reliability indices. Section 6 uses numerical examples to illustrate the sensitivity of reliability indices to system parameter variations. Section 7 concludes with a summary of findings and suggestions for future research.

2. The Abstract Cauchy Problem

We begin by introducing the following notation:
Υ = Γ 0 0 Γ 1 0
where 0 is a zero matrix. Γ 0 = [ ( a i , j ) 0 ] is an n × n matrix whose elements are
( a i , j ) 0 = 1 , if 0 i = j n , 0 , other .
Γ 1 = [ ( a l , m ) 1 ] is a 3 × n matrix whose elements are
( a l , m ) 1 = λ s s , if l = 1 , m = n , λ s i , if l = 2 , m = n , λ r , if l = 3 , 1 m n 1 , 0 , other .
Take the following state space
X = P R n × L 1 [ 0 , ) 3 | P = i = 0 n | P i | + k = n + 1 n + 3 P k L 1 [ 0 , ) < .
Clearly, X is a Banach space. Following that, operators and their domains are defined as follows
A P = A 0 0 0 A 1 P , D ( A ) = P X d P k ( y ) d y L 1 [ 0 , ) , P k ( y ) ( n + 1 k n + 3 ) are   absolutely   continuous   and P ( 0 ) = Υ P ( y ) , U P = U 0 0 0 0 P , D ( U ) = X , E P = E 0 0 0 0 P + E 1 , D ( E ) = X ,
where
A 0 = a 0 0 0 0 0 a 1 0 0 0 0 a n 1 0 0 0 0 a n , A 1 = d d y μ n + 1 ( y ) 0 0 0 d d y μ n + 2 ( y ) 0 0 0 d d y μ n + 3 ( y ) , U 0 = 0 0 0 0 λ s 0 0 0 0 λ s 0 0 0 0 λ s 0 , E 0 = 0 μ s 0 0 0 0 0 μ s 0 0 0 0 0 0 μ s 0 0 0 0 0 , E 1 = k = n + 1 n + 3 0 P j ( y , t ) μ j ( y ) d y 0 0 .
Thus, the above system of Equation (1) can be rewritten as an abstract Cauchy problem in X :
d P ( t ) d t = ( A + U + E ) P ( t ) , t ( 0 , ) , P ( 0 ) = 1 , 0 , 0 , 0 T .

3. Well Posedness of (2)

We begin by demonstrating that A + U + E generates a positive contraction C 0 semigroup T ( t ) on X .
Theorem 1.
If μ k ¯ = sup x [ 0 , ) μ k ( x ) < for n + 1 k n + 3 , then A + U + E generates a positive contraction C 0 semigroup T ( t ) .
Proof. 
We will estimate ( γ I A ) 1 as a first step. To do this, consider ( γ I A ) P = Z , for Z X , that is,
( γ + a j ) P j = Z j , j = 0 , 1 , , n ,
d P k ( y ) d = ( γ + μ k ( y ) ) P k ( y ) Z k ( y ) , n + 1 k n + 3 ,
P n + 1 ( 0 ) = λ s s P n ,
P n + 2 ( 0 ) = λ s i P n ,
P n + 3 ( 0 ) = λ r j = 0 n 1 P j .
Solving (3) and (4), we have
P j = 1 γ + a j Z j , j = 0 , 1 , , n ,
P k ( y ) = P k ( 0 ) e 0 y ( γ + μ k ( τ ) ) d τ + e 0 y ( γ + μ k ( τ ) ) d τ 0 y Z k ( ξ ) e 0 ξ ( γ + μ k ( τ ) ) d τ d ξ , n + 1 k n + 3 .
For (5)–(7) together with (8) and (9), we can get that
P n + 1 ( 0 ) = λ r i P n = λ s s γ + a n Z n ,
P n + 2 ( 0 ) = λ r s P n = λ s i γ + a n Z n ,
P n + 3 ( 0 ) = λ r j = 0 n 1 P j = j = 0 n 1 λ r γ + a j Z j .
By using (9), the Fubini theorem and the following inequalities
e ξ y μ k ( τ ) d τ 1 , f o r y ξ 0 ; e 0 y μ k ( τ ) d τ 1 , f o r y [ 0 , ) ,
we deduce (without loss of generality, assume γ > 0 )
P k L 1 [ 0 , ) | P j ( 0 ) | 0 e γ y d y + 0 e γ y 0 y | Z k ( ξ ) | e ξ y ( γ + μ k ( τ ) ) d τ d ξ d y | P k ( 0 ) | 0 e γ y d y + 0 e γ y 0 y | Y k ( ξ ) | e γ y d ξ d y = 1 γ | P k ( 0 ) | + 0 | Z k ( ξ ) | e γ ξ ξ e γ y d y d ξ = 1 γ | P k ( 0 ) | + 1 γ Z k L 1 [ 0 , ) , n + 1 k n + 3 .
Combinging (13), (12), (11), (10) and (8), we deduce
P j = 0 n 1 γ + a j | Z j | + 1 γ k = n + 1 n + 3 | P k ( 0 ) | + 1 γ k = n + 1 n + 3 Z k L 1 [ 0 , ) = j = 0 n 1 γ + a j | Z j | + 1 γ λ s s γ + a n | Z n | + λ s i γ + a n | Z n | + j = 0 n 1 λ r γ + a j | Z j | + 1 γ k = n + 1 n + 3 Z k L 1 [ 0 , ) = γ + λ r γ ( γ + a 0 ) | Z 0 | + j = 1 n 1 γ + λ r γ ( γ + a j ) | Z j | + γ + λ s s + λ s i γ ( γ + a n ) | Z n | + 1 γ k = n + 1 n + 3 Z k L 1 [ 0 , ) < 1 γ j = 0 n | Z j | + k = n + 1 n + 3 Z k L 1 [ 0 , ) = 1 γ Z .
Equation (14) shows that
( γ I A ) 1 : X D ( A ) , ( γ I A ) 1 1 γ .
The second step will be to demonstrate that D ( A ) is dense in X . Let
L = P P ( y ) = ( P 0 , P 1 , , P n , P n + 1 ( y ) , P n + 2 ( y ) , P n + 3 ( y ) ) , P k ( y ) C 0 [ 0 , ) , n + 1 k n + 3 ,
then L ¯ = X . Take
S = P P ( y ) = ( P 0 , P 1 , , P n , P n + 1 ( y ) , P n + 2 ( y ) , P n + 3 ( y ) ) , P k ( y ) C 0 [ 0 , ) , α k > 0 , such   that P k ( y ) = 0 , for y [ 0 , α k ] , n + 1 k n + 3 ,
then S ¯ = L by Adams [33]. As a result, proving D ( A ) ¯ = X suffices to show that S D ( A ) ¯ . Hence, if S D ( A ) ¯ , then X = L ¯ = S ¯ ¯ = S ¯ D ( A ) ¯ ¯ = D ( A ) ¯ X gives X = D ( A ) ¯ .
Take any P S , such that, P k ( y ) = 0 , for all y [ 0 , α k ] , that is P k ( y ) = 0 , for all y [ 0 , ς ] ( n + 1 k n + 3 ) , here 0 < ς < min { α n + 1 , α n + 2 , α n + 3 } . Define
F ς ( y ) = F 0 , F 1 , , F n , F n + 1 ( x ) , F n + 2 ( x ) , F n + 3 ( x ) , F ς ( 0 ) = P 0 , P 1 , , P n , λ s s P n , λ s i P n j = 0 n 1 λ r P j ,
where
F k ς ( y ) = F k ς ( 0 ) ( 1 y ς ) 2 , y [ 0 , ς ) , P k ( y ) , y [ ς , ) . n + 1 k n + 3 .
Then, F ς D ( A ) . Moreover,
P F ς = k = n + 1 n + 3 0 ς | F k ς ( 0 ) | 1 y ς 2 d y = k = n + 1 n + 3 0 ς | F k ς ( 0 ) | ς 3 0 , a s ς 0 .
This implies S D ( A ) ¯ , thus, D ( A ) is dense in X .
We can conclude that A generates a C 0 semigroup based on the preceding two steps and the Hille–Yosida Theorem. Furthermore, we can deduce that A + U + E generates a C 0 semigroup T ( t ) using perturbation theory of C 0 semigroup (see Gupur et al. [34]).
In the final step, we show that A + U + E is a dispersive operator. Choosing, for P D ( A ) ,
Ψ ( y ) = [ P 0 ] + P 0 , [ P 1 ] + P 1 , , [ P n ] + P n , [ P n + 1 ( y ) ] + P n + 1 ( y ) , [ P n + 2 ( y ) ] + P n + 2 ( y ) , [ P n + 3 ( y ) ] + P n + 3 ( y ) ,
where
[ P i ] + = P i , if P j > 0 , 0 , if P j 0 , 0 j n , [ P k ( y ) ] + = P k ( y ) , if P k ( y ) > 0 , 0 , if P k ( y ) 0 , n + 1 k n + 3 .
Let W j = { y [ 0 , ) | P k ( y ) > 0 } and W ˜ k = { y [ 0 , ) | P k ( y ) 0 } , then we get
0 d P k ( y ) d y [ P k ( y ) ] + P k ( y ) d y = W k d P k ( y ) d y [ P k ( y ) ] + P k ( y ) d y + W ˜ k d P k ( y ) d y [ P k ( y ) ] + P k ( y ) d y = W k d [ P k ( y ) ] + d y d y = [ P k ( 0 ) ] + , n + 1 k n + 3 .
Using (15) for such Ψ and boundary conditions, we deduce
( A + U + E ) P , Ψ = a 0 P 0 + μ s P 1 + k = n + 1 n + 3 0 P k ( y ) μ k ( y ) d y [ P 0 ] + P 0 + j = 1 n 1 λ s P j 1 a j P j + μ s P j + 1 [ P j ] + P j + λ s P n 1 a n P n [ P n ] + P n + k = n + 1 n + 3 0 d P k ( y ) d y μ k ( y ) P k ( y ) [ P k ( y ) ] + P k ( y ) d y a 0 [ P 0 ] + + μ s [ P 1 ] + + [ P 0 ] + P 0 k = n + 1 n + 3 0 [ P k ( y ) ] + μ k ( y ) d y + j = 1 n 1 λ s [ P j 1 ] + j = 1 n 1 a j [ P j ] + + j = 1 n 1 μ s [ P j + 1 ] + + λ s [ P n 1 ] + a n [ P n ] + + λ s s [ P n ] + + λ s i [ P n ] + + λ r j = 0 n 1 [ P j ] + k = n + 1 n + 3 0 [ P k ( y ) ] + μ k ( y ) d y = [ P 0 ] + P 0 1 k = n + 1 n + 3 0 [ P k ( y ) ] + μ k ( y ) d y 0 .
The conclusion follows from (16).
Therefore, from above results together with Fillips theorem, we deduce that A + U + E generates a positive contraction C 0 semigroup, and it is just T ( t ) by the uniqueness theorem of the semigroup. □
The following is the dual space of X .
X * = { Q * R n × L [ 0 , ) 3 | | Q * | = sup sup 0 j n | Q j * | , sup n + 1 k n + 3 Q k * L [ 0 , ) < } ,
obviously, it is a Banach space.
Define
Y = P X P ( y ) = P 0 , P 1 , , P n , P n + 1 ( y ) , P n + 2 ( y ) , P n + 3 ( y ) P j 0 , for 0 j n ; P k ( y ) 0 , n + 1 k n + 3 , y [ 0 , ) X .
Then, by Theorem 1, it follows that T ( t ) Y Y . Choose Q * = P ( 1 , 1 , , 1 n , 1 , 1 , 1 ) , for P D ( A ) Y , thus, we have Q * X * and
( A + U + E ) P , Q * = a 0 P 0 + μ s P 1 + k = n + 1 n + 3 0 P k ( x ) μ k ( y ) d y + j = 1 n 1 λ s P j 1 a j P j + μ s P j + 1 P + λ s P n 1 a n P n P + k = n + 1 n + 3 0 d P k ( y ) d y μ k ( y ) P k ( y ) d y P = j = 0 n 1 λ s P j j = 0 n a j P j + j = 1 n μ s P j + 1 P k = n + 1 n + 3 0 d P k ( y ) d y d y P = [ j = 0 n 1 λ s P j ( λ s + λ r ) P 0 j = 1 n 1 ( λ s + λ r + μ s ) P j ( λ s s + λ s i + μ s ) P n + j = 1 n μ s P j + 1 ] P + λ s s P n + λ s i P n + λ r j = 0 n 1 P j P = 0 .
As a result, A + U + E is conservative with respect to the set
Λ ( P ) = Q * X * | P , Q * = P 2 = | Q * | 2 ,
and we can now deduce the following result from the Fattorini theorem [35] (p. 155).
Theorem 2.
T ( t ) is isometric for P ( 0 ) = ( 1 , 0 , 0 , 0 ) T , i.e., T ( t ) P ( 0 ) = P ( 0 ) , t [ 0 , ) .
This section’s main result is derived from Theorems 1 and 2.
Theorem 3.
Equation (2) has a unique positive T-DS P ( y , t ) satisfying
P ( · , t ) = 1 , t [ 0 , ) .
Proof. 
Since P ( 0 ) D ( A 2 ) Y , Theorem 1 and Theorem 1.81 in [34] show that the system (2) has a unique positive T-DS P ( x , t ) , i.e.,
P ( x , t ) = T ( t ) P ( 0 ) , t [ 0 , ) .
We can deduce
P ( · , t ) = P ( 0 ) = 1 , t [ 0 , ) .

4. Asymptotic Behavior of the T-DS of (2)

Analysis show that, similar to the proof of Theorem 1, operator A generates a positive contraction C 0 semigroup T 0 ( t ) . Therefore, we will demonstrate quasi-compactness of T ( t ) by showing that T 0 ( t ) is a quasi-compact operator.
Lemma 1.
If P ( y , t ) = ( T 0 ( t ) υ ) ( y ) is a solution of the system
d P ( t ) d t = A P ( t ) , t [ 0 , ) , P ( 0 ) = υ D ( A ) .
Then,
P ( y , t ) = υ 0 e a 0 t υ 1 e a 1 t υ n e a n t P n + 1 ( 0 , t y ) e 0 y μ n + 1 ( σ ) d σ P n + 2 ( 0 , t y ) e 0 y μ n + 2 ( σ ) d σ P n + 3 ( 0 , t y ) e 0 y μ n + 3 ( σ ) d σ as y < t , υ 0 e a 0 t υ 1 e a 1 t υ n e a n t υ n + 1 ( y t ) e y t y μ n + 1 ( σ ) d σ υ n + 2 ( y t ) e y t y μ n + 2 ( σ ) d σ υ n + 3 ( y t ) e y t y μ n + 3 ( σ ) d σ as y > t ,
where P j ( 0 , t y ) are given by ( 4 ) .
Proof. 
Because P ( y , t ) = ( T 0 ( t ) υ ) ( y ) is a solution of ( 17 ) , it satisfies
d P j ( t ) d t = a j P 0 ( t ) , 0 j n ,
P k ( y , t ) t + P j ( y , t ) y = μ k ( y ) P k ( y , t ) , n + 1 k n + 3 ,
P n + 1 ( 0 , t ) = λ r i P n ( t ) ,
P n + 2 ( 0 , t ) = λ r s P n ( t ) ,
P n + 3 ( 0 , t ) = λ r j = 0 n 1 P j ( t ) ,
P j ( 0 ) = υ j , 0 j n , P k ( y , 0 ) = υ k ( y ) , n + 1 k n + 3 .
Take z = y t and Π k ( t ) = P k ( z + t , t ) , n + 1 k n + 3 , then from (19), we get
d Π k ( t ) d t = μ k ( z + t ) Π k ( t ) , n + 1 k n + 3 .
If z < 0 ( i . e . , y < t ) , then using Π k ( z ) = P k ( 0 , z ) = P k ( 0 , t y ) , n + 1 k n + 3 and integrating (24) from z to t separately, we deduce
P k ( y , t ) = Π k ( t ) = Π k ( z ) e z t μ k ( z + σ ) d σ = y = z + σ P k ( 0 , t y ) e 0 z + t μ k ( y ) d y = P k ( 0 , t y ) e 0 y μ k ( σ ) d τ , n + 1 k n + 3 .
Soving ( 18 ) and applying ( 23 ) gives
P j ( t ) = υ j e a j t , 0 j n .
If z > 0 ( i . e . , y > t ) , using the relations Π k ( 0 ) = P k ( z , 0 ) = υ k ( t y ) , n + 1 k n + 3 and integrating (19) from 0 to t, as well as a similar argument to ( 25 ) , we obtain
P k ( y , t ) = Π k ( t ) = Π k ( 0 ) e 0 t μ k ( z + σ ) d σ = δ = z + σ υ k ( y t ) e z z + t μ k ( δ ) d δ = υ k ( y t ) e y t y μ k ( σ ) d σ , n + 1 k n + 3 .
Equations (25)–(27) complete the proof. □
Define
S ( t ) P ( y ) = 0 , y [ 0 , t ) , T 0 ( t ) P ( y ) , y [ t , ) , V ( t ) P ( y ) = T 0 ( t ) P ( y ) , y [ 0 , t ) , 0 , y [ t , ) .
Clearly,
T 0 ( t ) P ( y ) = S ( t ) P ( y ) + V ( t ) P ( y ) , P X .
From Theorem 1.35 in [34], we can conclude the following Lemma.
Lemma 2.
If and only if the following two conditions are satisfied, a bounded and closed subset S X is relatively compact.
( 1 ) k = n + 1 n + 3 lim τ 0 0 | ψ k ( y + τ ) ψ k ( x ) | d x = 0 , u n i f o r m l y   f o r ψ = ( ψ 0 , ψ 1 , , ψ n , ψ n + 1 , ψ n + 2 , ψ n + 3 ) S . ( 2 ) k = n + 1 n + 3 lim τ τ | ψ k ( y ) | d y = 0 , u n i f o r m l y   f o r ψ = ( ψ 0 , ψ 1 , , ψ n , ψ n + 1 , ψ n + 2 , ψ n + 3 ) S .
Theorem 4.
V ( t ) is a compact operator on X .
Proof. 
We only need to prove condition (1) in Lemma 2 by definition of V ( t ) . Take P ( y , t ) = T 0 ( t ) υ ( y ) , y [ 0 , t ) , for bounded υ X , then P ( y , t ) is a solution of (17). Hence, from Lemma 1, we deduce, for y [ 0 , t ) , τ ( 0 , t ] , y + τ [ 0 , t )
k = n + 1 n + 3 0 t | P k ( y + τ , t ) P k ( y , t ) | d y = k = n + 1 n + 3 0 t P k ( 0 , t y τ ) e 0 y + τ μ k ( σ ) d σ P k ( 0 , t y ) e 0 y μ k ( σ ) d σ d y = k = n + 1 n + 3 0 t P k ( 0 , t y τ ) e 0 y + τ μ k ( σ ) d σ P k ( 0 , t y τ ) e 0 y μ k ( σ ) d σ + P k ( 0 , t y τ ) e 0 y μ k ( σ ) d σ P k ( 0 , t y ) e 0 y μ k ( σ ) d σ d y k = n + 1 n + 3 0 t | P k ( 0 , t y τ ) | e 0 y + τ μ k ( σ ) d σ e 0 y μ k ( σ ) d σ d y + k = n + 1 n + 3 0 t | P k ( 0 , t y τ ) P k ( 0 , t y ) | e 0 y μ k ( σ ) d σ d y .
The procedure is to estimate each term of (28). Applying the boundary conditions, we get
| P n + 1 ( 0 , t y τ ) | = λ s s | υ n e a n ( t y τ ) | λ s s | υ n | λ s s υ X ,
| P n + 2 ( 0 , t y τ ) | = λ s i | υ n e a n ( t y τ ) | λ r s | υ n | λ s i υ X ,
| P n + 3 ( 0 , t y τ ) | λ r j = 0 n 1 υ j e a j ( t y τ ) λ r j = 0 n 1 | υ j | λ r υ X .
We can estimate the first term of (28) using (29)–(31).
k = n + 1 n + 3 0 t | P k ( 0 , t y τ ) | e 0 y + τ μ k ( σ ) d σ e 0 y μ k ( σ ) d σ d y λ s s + λ s i + λ r υ X k = n + 1 n + 3 0 t e 0 y + τ μ k ( σ ) d σ e 0 y μ k ( σ ) d σ d y 0 , as τ 0 , uniformly for υ .
Now, we will estimate the second term in (28). Using Lemma 1 and boundary conditions, we calculate
| P n + 1 ( 0 , t y τ ) P n + 1 ( 0 , t y ) | | λ s s ( υ n e a n ( t y τ ) υ n e a n ( t y ) ) | λ s s υ X | e a n ( t y τ ) e a n ( t y ) | 0 as τ 0 , uniformly for υ ,
| P n + 2 ( 0 , t y τ ) P n + 2 ( 0 , t y ) | | λ s i ( υ n e a n ( t y τ ) υ n e a n ( t y ) ) | λ s i υ X | e a n ( t y τ ) e a n ( t y ) | 0 as τ 0 , uniformly for υ ,
| P n + 3 ( 0 , t y τ ) P n + 3 ( 0 , t y ) | λ r j = 0 n 1 υ j ( e a j ( t y τ ) e a j ( t y ) ) λ r υ X j = 0 n 1 e a j ( t y τ ) e a j ( t y ) 0 as τ 0 , uniformly for υ .
From (33)–(35), we deduce
k = n + 1 n + 3 0 t | P k ( 0 , t y τ ) P j ( 0 , t y ) | e 0 y μ k ( σ ) d σ 0 , as τ 0 , uniformly for υ .
Combining (32) with (36), we obtain, for y [ 0 , t ) , τ ( 0 , t ] , y + τ [ 0 , t )
k = n + 1 n + 3 0 t | P k ( y + τ , t ) P k ( y , t ) | d y 0 , as τ 0 , uniformly for υ .
The same conclusion can be drawn for τ [ t , 0 ) , y + τ [ 0 , t ) . This finishes the proof. □
Theorem 5.
If 0 < μ k ̲ μ k ( y ) μ k ¯ < , for n + 1 k n + 3 , then S ( t ) satisfies
S ( t ) υ X e min { a 0 , a n , μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } t υ X .
Proof. 
For any υ X , we estimate
| | S ( t ) υ ( · ) | | X = j = 0 n | P j ( t ) | + k = n + 1 n + 3 t | P k ( y , t ) | d y j = 0 n | υ j | e a j t + k = n + 1 n + 3 0 | υ k ( y t ) | e y t y μ k ( σ ) d σ d y e min { a 0 , a n } t j = 0 n | υ j | + e min { μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } t k = n + 1 n + 3 υ k L 1 [ 0 , ) e min { a 0 , a n , μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } t υ X .
Theorems 4 and 5 give
T 0 ( t ) V ( t ) = S ( t ) e min { a 0 , a n , μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } t 0 , t .
Hence, we can obtain the following result by Definition 1.85 in [34].
Theorem 6.
If 0 < μ k ̲ μ k ( y ) μ k ¯ < , for n + 1 k n + 3 , then T 0 ( t ) is a quasi-compact operator on X .
We get the following result by combining Theorem 6 and Proposition [36] (p. 215), as well as the compactness of the U and E on X .
Corollary 1.
If 0 < μ k ̲ μ k ( y ) μ k ¯ < , for n + 1 k n + 3 , then T ( t ) is a quasi-compact operator on X .
Lemma 3.
0 σ p ( A + U + E ) , and geometric multiplicity of 0 is one.
Proof. 
Take ( A + U + E ) P = 0 . Hence,
a 0 P 0 = μ 1 P 1 + k = n + 1 n + 3 0 P k ( y ) μ k ( y ) d y ,
a j P j = λ s P j 1 + μ s P j + 1 , 1 j n 1 ,
a n P n = λ s P n 1 ,
d P k ( y ) y = μ k ( y ) P k ( y ) , n + 1 k n + 3 ,
P n + 1 ( 0 ) = λ s s P n ,
P n + 2 ( 0 ) = λ s i P n ,
P n + 3 ( 0 ) = λ r j = 0 n 1 P j .
Solving (41), we have
P k ( y ) = P k ( 0 ) e 0 y μ k ( σ ) d σ , n + 1 k n + 3 .
If we take
b n = a n , b l = a l λ s μ s b l + 1 , l = 1 , 2 , , n 1 .
Then, from (38)–(40) we can show that
P n = λ s P n 1 a n = λ s b n P n 1 , a n 1 P n 1 = λ s P n 2 + μ n P n = λ s P n 2 + λ s μ s b n P n 1 P n 1 = λ s P n 2 a n 1 λ s μ s b n = λ s b n 1 P n 2 , a n 2 P n 2 = λ s P n 3 + μ s P n 1 = λ s P n 3 + λ s μ s P n 2 b n 1 P n 2 = λ s P n 3 a n 2 λ s μ s b n 1 = λ s b n 2 P n 3 , a 2 P 2 = λ s P 1 + μ s P 3 = λ s P 1 + λ s μ s b 3 P 2 P 2 = λ s a 2 λ s μ s b 3 P 1 = λ s b 2 P 1 , a 1 P 1 = λ s P 0 + μ s P 2 = λ s P 0 + λ s μ 2 b 2 P 1 P 1 = λ s a 1 λ s μ 2 b 2 P 0 = λ s b 1 P 0 , P n = λ s b n λ s b n 1 P n 2 = = λ s n l = 1 n b l P 0 .
Thus,
P j = λ s j l = 1 j b l P 0 , j = 1 , 2 , , n .
Combining (42)–(44) and (45) with (46), we estimate
P = j = 0 n | P j | + k = n + 1 n + 3 0 | P k ( 0 ) | e 0 y μ k ( τ ) d τ d y 1 + j = 1 n λ s j l = 1 j b j 1 | P 0 | + k = n + 1 n + 3 | P k ( 0 ) | 0 e 0 y μ k ( τ ) d τ d y = 1 + j = 1 n λ s j l = 1 j b j 1 | P 0 | + λ s s λ s n l = 1 n b l 1 0 e 0 y μ n + 1 ( τ ) d τ d y | P 0 | + λ s i λ s n l = 1 n b l 1 0 e 0 y μ n + 2 ( τ ) d τ d x | P 0 | + λ r 1 + λ s n j = 0 n 1 l = 1 j b l 1 0 e 0 y μ n + 3 ( τ ) d τ d y | P 0 | < .
Equation (47) show that 0 σ p ( A + U + E ) , i.e., the point spectrum of A + U + E , and from (46), it can be seen that the geometric multiplicity of 0 is one. □
Lemma 4.
The adjoint operator of A + U + E is given by
( A + U + E ) * Q * = ( M + N + L ) Q * ,
where
M = M 0 0 ( n + 1 ) × 3 0 3 × ( n + 1 ) M 1 , N = 0 ( n + 1 ) × ( n + 1 ) 0 ( n + 1 ) × 3 N 0 0 3 × 3 , L = 0 ( n + 1 ) × ( n + 1 ) L 0 0 3 × ( n + 1 ) 0 3 × 3 ,
and
M 0 = a 0 λ s 0 0 0 μ s a 1 λ s 0 0 0 μ s a 2 0 0 0 0 0 a n 1 λ s 0 0 0 μ s a n , M 1 = d d y μ n + 1 ( y ) 0 0 0 d d y μ n + 2 ( y ) 0 0 0 d d y μ n + 3 ( y ) , N 0 = μ n + 1 ( y ) 0 0 μ n + 2 ( y ) 0 0 μ n + 3 ( y ) 0 0 , L 0 = λ r λ r 0 2 × ( n + 1 ) λ r λ s s       λ s i 0 , 0 m × n d e n o t e s   t h e m × n z e r o   m a t r i x .
D ( ( A + U + E ) * ) = d Q k * ( y ) d y exists and Q k * ( ) = α , n + 1 k n + 3 ,
and the constant α in D ( ( A + U + E ) * ) is independent of j.
Proof. 
For Q * D ( ( A + U + E ) * ) , we have
( A + U + E ) P , Q * = Q 0 * a 0 P 0 + μ s P 1 + k = n + 1 n + 3 0 P k ( y ) μ k ( y ) d y + j = 1 n 1 Q j * λ s P j 1 a j P j + μ s P j + 1 + Q n * λ s P n 1 a n P n + k = n + 1 n + 3 0 Q k * ( y ) d P k ( y ) d y μ k ( y ) P k ( y ) d y = P 0 a 0 Q 0 * + λ s Q 1 * + j = 1 n 1 P j μ j Q j 1 * a j Q j * + λ s Q j + 1 * + P n μ s Q n 1 * a n Q n * + λ s s P n Q n + 1 * ( 0 ) + λ s i P n Q n + 2 * ( 0 ) + λ r j = 0 n 1 P j Q n + 3 * ( 0 ) + k = n + 1 n + 3 0 P k ( y ) d Q k * ( y ) d y μ k ( y ) Q k * ( y ) + μ k ( y ) Q 0 * d y = P 0 a 0 Q 0 * + λ s Q 1 * + λ r Q n + 3 * ( 0 ) + j = 1 n 1 μ j Q j 1 * a j Q j * + λ s Q j + 1 * + λ r Q n + 3 * ( 0 ) + P n μ s Q n 1 * a n Q n * + λ s s Q n + 1 * ( 0 ) + λ s i Q n + 2 * ( 0 ) + k = n + 1 n + 3 0 P k ( y ) d Q k * ( y ) d y μ k ( y ) Q k * ( y ) + μ k ( y ) Q 0 * d y = P , ( M + N + L ) Q * .
Lemma 5.
0 σ p ( ( A + U + E ) * ) and geometric multiplicity of 0 is one.
Proof. 
Consider ( A + U + E ) * Q * = 0 , i.e.,
a 0 Q 0 * + λ s Q 1 * + λ r Q n + 3 * ( 0 ) = 0 ,
μ j Q j 1 * a j Q j * + λ s Q j + 1 * + λ r Q n + 3 * ( 0 ) = 0 , 1 j n 1 ,
μ n Q n 1 * a n Q n * + λ s s Q n + 1 * ( 0 ) + λ s i Q n + 2 * ( 0 ) = 0 ,
d Q k * ( y ) d y = μ k ( y ) Q k * ( y ) μ k ( y ) Q 0 * , k = n + 1 , n + 2 , n + 3 .
Q k * ( ) = α , n + 1 k n + 3 .
Solving ( 51 ) , we deduce
Q k * ( y ) = b k e 0 y μ k ( τ ) d τ e 0 y μ k ( τ ) d τ 0 y Q 0 * μ k ( ξ ) e 0 ξ μ k ( τ ) d τ d ξ , n + 1 k n + 3 .
Multiplying e 0 y μ ( τ ) ) d τ to the both side of (53), we have
b k = 0 μ k ( ξ ) Q 0 * e 0 ξ μ k ( τ ) d τ d ξ , n + 1 k n + 3 .
Substituting ( 54 ) into ( 53 ) , we get
Q k * ( y ) = Q 0 * e 0 y μ k ( τ ) d τ y μ k ( ξ ) e 0 ξ μ k ( τ ) d τ d ξ = Q 0 * e 0 y μ k ( τ ) d τ e 0 ξ μ k ( τ ) d τ | y = Q 0 * , n + 1 k n + 3 .
Substituting ( 55 ) into ( 48 ) ( 50 ) , we have
Q j * = Q 0 * , 1 j n .
Equations (55)–(56) give
| | | Q * | | | = max max 1 j n | Q j * | , max n + 1 k n + 3 Q k * L [ 0 , ) = | Q 0 * | < ,
which imply 0 σ p ( ( A + U + E ) * ) . Furthermore, from (55) and (56), it is easy to verify that the geometric multiplicity of 0 is one. □
By using Lemmas 3 and 5 and Theorem 3, we can deduce that the algebraic multiplicity of 0 is one and the spectral bound s ( A + U + E ) = 0 . Finally, the conditions of Theorem 1.90 in [34] are fulfilled. Therefore, we get the following result.
Theorem 7.
If 0 < μ k ̲ μ k ( y ) μ k ¯ < , for n + 1 k n + 3 , then there exist a spectral projection P with rank one such that
T ( t ) P K e ϱ t ,
where P = 1 2 π i Γ ( η I A U E ) 1 d z and Γ is a circle with a radius of sufficiently small and a center of 0 .
It is evident that η σ ( A + U + E ) | R e η = 0 = 0 by Theorem 3, Corollary 1 and Lemma 3. In other words, the resolvent set of A + U + E includes all points on the imaginary axis except zero.
Remark 1.
Based on the analysis above, we can conclude that the system’s T-DS strongly converges to its S-SS, i.e., lim t P ( y , t ) = ζ P ( y ) , where P ( y ) is the eigenvector corresponding to 0.
In the following, we investigate exponential convergence of system’s T-DS. For this goal, we first determine the explicit expression of P by the growth bound of T ( t ) .
Lemma 6.
For any η ρ ( A + U + E ) , we get
( η I A U E ) 1 y 0 y 1 y n y n + 1 y n + 2 y n + 3 = b 0 b 1 b n b n + 1 b n + 2 b n + 3 , b X ,
where
y j = | G i ( η ) | | G ( η ) | , j = 0 , 1 , 2 , , n , y n + 1 ( y ) = λ s s | G n ( η ) | | G ( η ) | e 0 y ( η + μ n + 1 ( ξ ) ) d ξ + e 0 y ( η + μ j ( ξ ) ) d ξ 0 y b n + 1 ( τ ) e 0 y ( η + μ n + 1 ( ξ ) ) d ξ d τ , y n + 2 ( y ) = λ s i | G n ( η ) | | G ( η ) | e 0 y ( η + μ n + 2 ( ξ ) ) d ξ + e 0 y ( η + μ n + 2 ( ξ ) ) d ξ 0 y b n + 2 ( τ ) e 0 y ( η + μ n + 2 ( ξ ) ) d ξ d τ , y n + 3 ( y ) = λ r j = 0 n 1 | G j ( η ) | | G ( η ) | e 0 y ( η + μ n + 3 ( ξ ) ) d ξ + e 0 x ( η + μ n + 3 ( ξ ) ) d ξ 0 y b n + 3 ( τ ) e 0 y ( η + μ n + 3 ( ξ ) ) d ξ d τ ,
G ( η ) = η + a 0 λ r β n + 3 μ s λ r β n + 3 λ r β n + 3 λ r β n + 3 λ s s β n + 1 λ s i β n + 2 λ s η + a 1 μ s 0 0 0 λ s η + a 2 0 0 0 0 0 η + a n 1 μ s 0 0 0 λ s η + a n , β k = 0 μ k ( τ ) e 0 y ( η + μ k ( τ ) ) d τ d y , n + 1 k n + 3 ,
and | G ( η ) | denotes the determinant of G ( η ) , and G i ( η ) is the same matrix G ( η ) such that ith column is replaced with constants.
Proof. 
Consider the equation ( η I A U E ) y = b , for b X . Hence,
( η + a 0 ) y 0 μ s y 1 k = n + 1 n + 3 0 y k ( y ) μ k ( y ) d y = b 0 ,
λ s y j 1 + ( η + a j ) y j μ s y j + 1 = b j , 1 j n 1 ,
λ s y n 1 + ( η + a n ) y n = b n ,
d y k ( y ) y = ( η + μ k ( y ) ) y k ( y ) + b k ( y ) , n + 1 k n + 3 ,
y n + 1 ( 0 ) = λ s s y n ,
y n + 2 ( 0 ) = λ s i y n ,
y n + 3 ( 0 ) = λ r j = 0 n 1 y j .
Solving (60) and using (61)–(63), we have
y n + 1 ( y ) = λ s s y n e 0 y ( η + μ n + 1 ( ξ ) ) d ξ + e 0 y ( η + μ n + 1 ( ξ ) ) d ξ 0 y b n + 1 ( τ ) e 0 y ( η + μ n + 1 ( ξ ) ) d ξ d τ ,
y n + 2 ( y ) = λ s i y n e 0 y ( η + μ n + 2 ( ξ ) ) d ξ + e 0 y ( η + μ n + 2 ( ξ ) ) d ξ 0 y b n + 2 ( τ ) e 0 y ( η + μ n + 2 ( ξ ) ) d ξ d τ ,
y n + 3 ( y ) = λ r j = 0 n 1 y j e 0 y ( η + μ n + 3 ( ξ ) ) d ξ + e 0 y ( η + μ n + 3 ( ξ ) ) d ξ 0 y b n + 3 ( τ ) e 0 y ( η + μ n + 3 ( ξ ) ) d ξ d τ .
Substituting (64)–(66) into (57)–(59), we get
η + a 0 λ r 0 μ n + 3 ( y ) e 0 y ( η + μ n + 3 ( ξ ) ) d ξ d y y 0 μ s + λ r 0 μ n + 3 ( y ) e 0 y ( η + μ n + 3 ( ξ ) ) d ξ d y y 1 λ r 0 μ n + 3 ( y ) e 0 y ( η + μ n + 3 ( ξ ) ) d ξ d y j = 2 n 1 y j λ s s 0 μ n + 1 ( y ) e 0 y ( η + μ n + 1 ( ξ ) ) d ξ d y + λ s i 0 μ n + 2 ( y ) e 0 y ( η + μ n + 2 ( ξ ) ) d ξ d y y n = k = n + 1 n + 3 0 μ k ( y ) e 0 y ( η + μ k ( ξ ) ) d ξ 0 y b k ( τ ) e 0 y ( η + μ k ( ξ ) ) d ξ d τ d y + b 0 ,
λ s y j 1 + ( η + a j ) y j μ s y j + 1 = b j , j = 1 , 2 , , n 1 ,
λ s y n 1 + ( η + a n ) y n = b n .
Equations (67)–(69) give
G ( η ) y ¯ = b ¯ ,
where
y ¯ = y 0 , y 1 , , y n 1 , y n T , b ¯ = k = n + 1 n + 3 B k ( η ) + b 0 , b 1 , b 2 , , b n 1 , b n T , B k = 0 μ k ( ξ ) e 0 y ( η + μ k ( ξ ) ) d ξ 0 y b k ( τ ) e 0 y ( η + μ k ( ξ ) ) d ξ d τ d y .
Using Cramer’s rule, we derive
y j = | G j ( η ) | | G ( η ) | , j = 0 , 1 , 2 , , n .
Substituting ( 70 ) into ( 64 ) , ( 65 ) , and ( 66 ) separately, we get the rest of the Lemma’s results. □
In summary, we present the following main results.
Theorem 8.
If  0 < μ k ̲ μ k ( y ) μ k ¯ < , for n + 1 k n + 3 , then
P ( · , t ) P ( · ) K e ϱ t , t > 0 .
that is, the system’s T-DS exponentially converges to its S-SS.
Proof. 
Obviously,
T 0 ( t ) V ( t ) = S ( t ) e min { a 0 , a n , μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } t lim t ln T 0 ( t ) V ( t ) t min { a 0 , a n , μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } .
Thus, the essential growth bound of T 0 ( t ) satisfies ω e s s ( T 0 ( t ) ) min { a 0 , a n , μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } by Proposition 2.10 in Engel and Nagel [37] (p. 258).
Since E and U are compact operators, by Proposition 2.12 in [37], we have
ω e s s ( A + U + E ) = ω e s s ( T ( t ) ) = ω e s s ( T 0 ( t ) ) min { a 0 , a n , μ n + 1 ̲ , μ n + 2 ̲ , μ n + 3 ̲ } .
Thus, 0 is a pole of ( η I A U E ) 1 of order 1 by Corollary 2.11 in [37]. Moreover, from Theorem 8, Lemma 6 and residue theorem, we have
P b 0 b 1 b n b n + 1 b n + 2 b n + 3 = lim η 0 η ( η I A U E ) 1 b 0 b 1 b n b n + 1 b n + 2 b n + 3 = lim η 0 η y 0 y 1 y n y n + 1 y n + 2 y n + 3 .
By calculating the above limit, we can now determine the projection operator. Let
α k = 0 e η y e 0 y μ k ( τ ) d τ d y , α ¯ k = 0 e 0 y μ k ( τ ) d τ d y , β k = 1 η 0 e η y e 0 y μ k ( τ ) d τ d y = 1 η α k , n + 1 k n + 3 .
Then, we can simplify | G ( η ) | as
| G ( η ) | = η 1 + λ r α n + 3 1 + λ r α n + 3 1 + λ r α n + 3 1 + λ r α n + 3 1 + λ s s α n + 1 + λ s i α n + 2 λ s η + a 1 μ s 0 0 0 λ s η + a 2 0 0 0 0 0 η + a n 1 μ s 0 0 0 λ s η + a n ,
and
lim η 0 η 1 | G ( η ) | = 1 1 + λ r α n + 3 ¯ 1 + λ r α n + 3 ¯ 1 + λ r α n + 3 ¯ 1 + λ r α n + 3 ¯ 1 + λ s s α n + 1 ¯ + λ s i α n + 2 ¯ λ s a 1 μ s 0 0 0 λ s a 2 0 0 0 0 0 a n 1 μ s 0 0 0 λ s a n 1 M .
By Lemma 6, the Fubini theorem and
0 μ k ( y ) e 0 y μ k ( τ ) d τ d y = 1 , n + 1 k n + 3 , 0 μ k ( ξ ) e 0 y μ k ( ξ ) d ξ 0 k b k ( τ ) e 0 y μ k ( ξ ) d ξ d τ d y = 0 b k ( y ) d y , n + 1 k n + 3 .
We obtain that
lim η 0 | G 0 ( η ) | = k = n + 1 n + 3 0 b k ( y ) d y + b 0 μ s λ r λ r λ r λ s s λ s i b 1 a 1 μ s 0 0 b 2 λ s a 2 0 0 b n 1 0 0 a n 1 μ s b n 0 0 λ s a n = k = n + 1 n + 3 0 b k ( y ) d y + j = 0 n b j 0 0 0 0 b 1 a 1 μ s 0 0 b 2 λ s a 2 0 0 b n 1 0 0 a n 1 μ s b n 0 0 λ s a n = a 1 μ s 0 0 λ s a 2 0 0 0 0 a n 1 μ s 0 0 λ s a n M 0 , lim η 0 | G 1 ( η ) | = a 0 λ r k = n + 1 n + 3 0 b k ( y ) d y + b 0 λ r λ r λ s s λ s i λ s b 1 μ s 0 0 0 b 2 a 2 0 0 0 b n 1 0 a n 1 μ s 0 b n 0 λ s a n = 0 k = n + 1 n + 3 0 b k ( y ) d y + j = 0 n b j 0 0 0 λ s b 1 μ s 0 0 0 b 2 a 2 0 0 0 b n 1 0 a n 1 μ s 0 b n 0 λ s a n = a 2 μ s 0 0 λ s a 3 0 0 0 0 a n 1 μ s 0 0 λ s a n M 1 ,
lim η 0 | G i ( η ) | = 0 0 0 0 k = n + 1 n + 3 0 b k ( y ) d y + j = 0 n b j 0 0 0 0 λ s a 1 μ s 0 b 1 0 0 0 0 0 λ s a 2 0 b 2 0 0 0 0 0 0 λ s 0 b 3 0 0 0 0 0 0 0 a i 1 b i 1 0 0 0 0 0 0 0 λ s b i μ s 0 0 0 0 0 0 0 b i + 1 a i + 1 0 0 0 0 0 0 0 b n 2 0 a n 2 μ s 0 0 0 0 0 b n 1 0 λ s a n 1 μ s 0 0 0 0 b n 0 0 λ s a n = ( λ s ) i × a i + 1 μ s 0 0 0 0 λ s a i + 2 μ s 0 0 0 0 λ s a i + 3 0 0 0 0 0 0 a n 2 μ s 0 0 0 0 λ s a n 1 μ s 0 0 0 0 λ s a n ( n i ) × ( n i ) M i , i = 2 , 3 , , n 1 , lim η 0 | G n ( η ) | = ( λ s ) n M n .
Finally, we derive
lim η 0 η y j = lim η 0 η | G j ( η ) | | G ( η ) | = M j M P i , j = 0 , 1 , 2 , , n ,
lim η 0 η y n + 1 ( y ) = λ s s e 0 y μ n + 1 ( ξ ) d ξ lim η 0 η y n = λ s s e 0 y μ n + 1 ( ξ ) d ξ M n M P n + 1 ( y ) ,
lim η 0 η y n + 2 ( y ) = λ s i e 0 y μ n + 2 ( ξ ) d ξ lim η 0 η y n = λ s i e 0 y μ n + 2 ( ξ ) d ξ M n M P n + 2 ( y ) ,
lim η 0 η y n + 3 ( y ) = λ r e 0 y ( η + μ n + 3 ( ξ ) ) d ξ j = 0 n 1 lim η 0 η y j = λ r e 0 y ( η + μ n + 3 ( ξ ) ) d ξ j = 0 n 1 M j M P n + 3 ( y ) .
Combining (71)–(74) with Lemma 6 we obtain
P P ( 0 ) = P ( y ) .
Thus, we conclude by (75), Theorems 3 and 7 that
P ( · , t ) P ( · )   T ( t ) P P ( 0 ) K e ϱ t P ( 0 ) = K e ϱ t , t 0 .

5. Reliability Indices

Some reliability indices is discussed briefly in this section. For detailed discussion, we refer the reader to [34] (p. 256). From the Remark 1, we have
lim t P j ( t ) = P j , j = 0 , 1 , , n ,
lim t 0 P k ( y , t ) P k ( y ) d x = 0 , n + 1 k n + 3 .
Equation (77) implies
lim t 0 μ k ( y ) P k ( y , t ) μ k ( y ) P k ( y ) d x = 0 , n + 1 k n + 3 .
We know
A ( t ) = j = 0 n 1 P j ( t ) .
Which together with (46) and (76), we obtain
A = lim t A ( t ) = j = 0 n 1 P j = 1 + j = 1 n 1 k = 1 j b k 1 λ s j P 0 .
We have
m f = lim t m f ( t ) = λ r i = 0 n 1 P i + ( λ s s + λ s i ) P n = λ r A + ( λ s s + λ s i ) P n .
The system’s time-dependent renewal frequency indicates that the frequency of system’s state returns to the initial states, and we have
m r = lim t m r = lim t μ s P 1 ( t ) + k = n + 1 n + 3 0 μ k ( y ) P k ( t , y ) d y = μ s P 1 + k = n + 1 n + 3 0 μ k ( y ) P k ( y ) d y = λ s μ s b 1 P 0 + λ s s + λ s i λ s n j = 1 n b j 1 P 0 + λ r 1 + λ s n j = 0 n 1 k = 1 j b k 1 P 0 .
If we set μ k ( y ) = 0 , (for n + 1 k n + 3 ), then we get the new system shown below.
d P ˜ 0 ( t ) d t = a 0 P ˜ 0 ( t ) + μ s P ˜ 1 ( t ) , d P ˜ j ( t ) d t = a j P ˜ j ( t ) + μ s P ˜ j + 1 ( t ) + λ s P ˜ j 1 ( t ) , 1 j n 1 , d P ˜ n ( t ) d t = a n P ˜ n ( t ) + λ s P ˜ n 1 ( t ) , d P ˜ n + 1 ( t ) d t = λ s s P ˜ n ( t ) , d P ˜ n + 2 ( t ) d t = λ s i P ˜ n ( t ) , d P ˜ n + 3 ( t ) d t = λ r j = 0 n 1 P ˜ j ( t ) .
As a result, by a similar argument, the system’s time-dependent reliability converges to a constant number
lim t R ( t ) = lim t j = 0 n + 3 P ˜ j ( t ) = j = 0 n + 3 P ˜ j = R .
Remark 2.
It is clear from the above results that we can obtain the results in [32] by the normalizing condition j = 0 n P j ( t ) + k = n + 1 n + 3 0 P k ( y , t ) d y = 1 . Hence, our results generalize those in [32].

6. Numerical Results

This section provides numerical examples to investigate how changes in system parameters affect the reliability indices, using Matlab 2017a for calculations. To begin, we assume that n = 3 without losing generality and the system’s repair time is Gamma distributed with μ k ( y ) = μ k , ( n + 1 k n + 3 ) . The system parameters are fixed as
λ s = 0.001 , λ r = 0.0009 , λ s s = 0.0006 , λ s i = 0.0004 μ s = 0.007 , μ n + 1 = 0.0018 , μ n + 2 = 0.0012 , μ n + 3 = 0.003 .
For different values of β , the variations in the system’s time-dependent availability (Figure 1a), failure frequency (Figure 1b), and renewal frequency (Figure 1c) are plotted with respect to t in Figure 1. In each case, the A ( t ) and m f ( t ) decrease rapidly as time increases, eventually becoming constant at some value. As time passes, the m r ( t ) increases rapidly in the early stages, then becomes constant at some value after a long run.
Furthermore, we observe that as β increases, the system’s time-dependent availability, failure frequency, and renewal frequency decrease.
In the following, we further analyze the effect of different values of the failure and repair rates on the system’s reliability indices for β = 1 (i.e., the repair time is exponential distributed). Figure 2 shows that as time increases, these reliability indices converge to some fixed value. As expected, A ( t ) decreases with increasing λ s (Figure 2a) and λ r (Figure 2b). m f ( t ) decreases with increasing λ s , but its effect on the failure frequency is not evident (Figure 2c), and m f ( t ) increases as λ r (Figure 2d) increases. m r ( t ) increases with increasing λ s (Figure 2e) and decreases with increasing λ r (Figure 2f). Furthermore, changes in the system parameters λ s s and λ s i had almost no effect on the system reliability indices. In Table 1, we only list the effect of λ s s and λ s i on the time-dependent availability A ( t ) .
The behavior of the reliability indices for different repair rates is depicted in Figure 3, showing that these indices increase as μ s and μ n + 3 increase. From this figure, we conclude that the changes in parameter μ s have little effect on A ( t ) and m f ( t ) . Moreover, Table 2 reveals that the effect of the changes of the parameters μ n + 1 and μ n + 2 on A ( t ) are not significant. It is also observed that the changes in the parameter μ n + 1 and μ n + 2 on m f ( t ) and m r ( t ) are not significant. Furthermore, these indices approach a constant value that time goes to infinity.
Figure 4 illustrates the effect of λ r on system’s time-dependent reliability and MTTF. We note that R ( t ) decreases as λ r increases and vanishes as time goes to infinity (Figure 4a). The MTTF decreases as λ r increases (Figure 4b).
Finally, in Table 3, we show the effect of the number of safety units in the system on the system transient availability. The availability increases as the number of safety units increases. However, having too many safety units does not contribute as much to the availability of this system.

7. Conclusions

In this paper, a robot-safety system consisting of one robot and n safety units with perfect switching is studied. We converted the model into an abstract Cauchy problem in Banach space and did dynamic analysis by the operator semigroup theory of linear operators. We proved that the system has unique nonnegative T-DS and that T-DS exponentially converges to its S-SS. Furthermore, we discussed the asymptotic property of the system’s instantaneous reliability indices and showed that they all converge to some constant. In order to investigate the impact of parameter changes on system reliability indices, some numerical examples are also presented.
We concluded that the increase in the number of safety units for this system does not necessarily improve the system’s instantaneous availability from the above numerical results. Thus, in the future, we can further study the robot-safety system consisting of n robots and m standby safety units.

Author Contributions

Conceptualization, E.K. and A.Y.; methodology, E.K. and A.Y.; validation, E.K.; writing—original draft preparation, E.K.; writing—review and editing, E.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Natural Science Foundation of Xinjiang Uygur Autonomous Region, No. 2022D01C46.

Data Availability Statement

Data is contained within the article.

Acknowledgments

The authors would like to thank the editor and referees for their valuable comments.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Abbreviations

The following abbreviations are used in this manuscript:
SVTSupplementary variable technique
T-DSTime-dependent solution
S-SSSteady-state solutions

References

  1. Cox, D.R. The analysis of non-markovian stochastic processes by the inclusion of supplementary variables. Math. Proc. Camb. Phil. Soc. 1955, 51, 433–441. [Google Scholar] [CrossRef]
  2. Gaver, D.P. Time to failure and availability of parallel redundant systems with repair. IEEE Trans. Reliab. 1963, R-12, 30–38. [Google Scholar] [CrossRef]
  3. Linton, D.G. Some advancements in the analysis of two-unit parallel redundant systems. Microelectron. Reliab. 1976, 15, 39–46. [Google Scholar] [CrossRef]
  4. Gupta, P.P.; Gupta, R.K. Cost analysis of an electronic repairable redundant system with critical human errors. Microelectron. Reliab. 1986, 26, 417–421. [Google Scholar] [CrossRef]
  5. Shi, D.H.; Li, W. Availability analysis of a two-unit series system with shut-off rule and “first-fail, first-repaired”. Acta. Math. Appl. 1993, 9, 88–91. [Google Scholar] [CrossRef]
  6. Chung, W.K. Reliability of imperfect switching of cold stanby systems with multiple non-critical and critical errors. Microelectron. Reliab. 1995, 35, 1479–1482. [Google Scholar] [CrossRef]
  7. Oliveira, E.A.; Alvim, A.C.M.; Frutuoso e Melo, P.F. Unavailability analysis of safety systems under aging by supplementary variables with imperfect repair. Ann. Nucl. Energy 2005, 32, 241–252. [Google Scholar] [CrossRef]
  8. Zhang, Y.L.; Wu, S.M. Reliability analysis for a k/n(f) system with repairable repair-equipment. Appl. Math. Model. 2009, 33, 3052–3067. [Google Scholar] [CrossRef]
  9. Shakuntla, S.; Lal, A.K.; Bhatia, S.S.; Singh, J. Reliability analysis of polytube industry using supplementary variable technique. Appl. Math. Comput. 2011, 218, 3981–3992. [Google Scholar] [CrossRef]
  10. Singh, V.V.; Ram, M.; Rawal, D.K. Cost analysis of an engineering system involving subsystems in series configuration. IEEE. Autom. Sci. Eng. 2013, 10, 1124–1130. [Google Scholar] [CrossRef]
  11. Ke, J.C.; Liu, T.H.; Yang, D.Y. Modeling of machine interference problem with unreliable repairman and standbys imperfect switchover. Reliab. Eng. Syst. Saf. 2018, 174, 12–18. [Google Scholar] [CrossRef]
  12. Shekhar, C.; Kumar, A.; Varshney, S. Fault-tolerant redundant repairable system with different failures and delays. Eng. Comput. 2020, 37, 1043–1071. [Google Scholar] [CrossRef]
  13. Gao, S.; Wang, J. Reliability and availability analysis of a retrial system with mixed standbys and an unreliable repair facility. Reliab. Eng. Syst. Saf. 2021, 205, 107240. [Google Scholar] [CrossRef]
  14. Dhillon, B.; Fashandi, A.R.M. Robot systems reliability and safety: A review. J. Qual. Maint. Eng. 2002, 8, 170–212. [Google Scholar] [CrossRef]
  15. Kulić, D.; Croft, E.A. Real-time safety for human-robot interaction. Rob. Autom. Syst. 2006, 54, 1–12. [Google Scholar]
  16. Dhillon, B.; Yang, N.F. Availability analysis of a robot with safety system. Microelectron. Reliab. 1996, 36, 169–177. [Google Scholar] [CrossRef]
  17. Dhillon, B.S.; Yang, N.F. Formulas for analyzing a redundant robot configuration with a built-in safety system. Microelectron. Reliab. 1997, 37, 557–563. [Google Scholar] [CrossRef]
  18. Dhillon, B.S.; Fashandi, A.R.M. Robotic systems probabilistic analysis. Microelectron. Reliab. 1997, 37, 211–224. [Google Scholar] [CrossRef]
  19. Dhillon, B.S.; Li, Z.J. Stochastic analysis of a system with redundant robots, one built-in safety unit, and common-cause failures. J. Intell. Rob. Syst. 2006, 45, 137–155. [Google Scholar] [CrossRef]
  20. Jain, M.; Preeti. Performance analysis of a repairable robot safety system with standby, imperfect coverage and reboot delay. Int. J. Eng. Trans. C Aspects 2013, 26, 1077–1088. [Google Scholar] [CrossRef]
  21. Vanderperre, E.J.; Makhanov, S.S. Overall availability and risk analysis of a general robot csafety device system. Int. J. Syst. Sci. 2015, 46, 1889–1896. [Google Scholar] [CrossRef]
  22. Gupur, G. Well-posedness of the system consisting of two repairable units. Acta Anal. Funct. Appl. 2001, 3, 188–192. [Google Scholar]
  23. Gupur, G.; Li, X.Z. Semigroup method for a mathematical model in reliability analysis. J. Syst. Sci. Syst. Eng. 2001, 10, 137–147. [Google Scholar]
  24. Guo, W.H.; Xu, G.Q. Stability analysis of the system consising of a robot and its associated safety mechanism. Math. Pract. Theory 2003, 33, 116–122. [Google Scholar]
  25. Chen, Y.; Xu, G.Q. Analysis of exponential stability to the robot system with periodic repair function. Acta. Anal. Funct. Appl. 2010, 12, 170–179. [Google Scholar] [CrossRef]
  26. Gupur, G. Well-posedness of the model describing a repairable, standby, human & machine system. J. Syst. Sci. Complex. 2003, 16, 483–493. [Google Scholar]
  27. Gupur, G. Asymptotic property of the solution of a repairable, standby, human and machine system. Int. J. Pure Appl. Math. 2006, 28, 35–54. [Google Scholar]
  28. Aili, M.; Gupur, G. Further result on a repairable, standby human and machine system. Int. J. Pure Appl. Math. 2016, 101, 571–594. [Google Scholar]
  29. Zhang, X. Exponential stability analysis of a redundant robot configuration with a built-in safety systemfurther result on a repairable, standby human and machine system. J. Syst. Sci. Inf. 2019, 131, 289–293. [Google Scholar]
  30. Qiao, X.; Ma, D. Reliability and numerical analysis of a robot safety system. J Syst. Sci. Complex. 2019, 32, 1072–1092. [Google Scholar] [CrossRef]
  31. Li, Z.; Wei, L. Reliability and controllability of the system consisting of a robot and its associated safety mechanism. J. Math. Res. Appl. 2020, 40, 9. [Google Scholar]
  32. Dhillon, B.S.; Shen, C. Reliability and availability analysis of a robot-safety system. J. Qual. Maint. Eng. 2011, 17, 203–232. [Google Scholar]
  33. Adams, R.A. Sobolev Spaces; Academic Press: New York, NY, USA, 1975. [Google Scholar]
  34. Gupur, G. Functional Analysis Methods for Reliability Models; Springer: Basel, Switzerland, 2011. [Google Scholar]
  35. Fattorini, H.O. The Cauchy Problem; Cambridge University Press: Cambridge, UK, 1984. [Google Scholar]
  36. Nagel, R. One-Parameter Semigroups of Positive Operators (LNM 1184); Springer: Berlin/Heidelberg, Germany, 1986. [Google Scholar]
  37. Engel, K.J.; Nagel, R. One-Parameter Semigroups for Linear Evolution Equations; Springer: New York, NY, USA, 2000. [Google Scholar]
Figure 1. Time-dependent reliability indices for different β . (a) A(t) for for different β ; (b) m f ( t ) for different β ; (c) m f ( t ) for different β .
Figure 1. Time-dependent reliability indices for different β . (a) A(t) for for different β ; (b) m f ( t ) for different β ; (c) m f ( t ) for different β .
Axioms 13 00423 g001
Figure 2. Time-dependent reliability indices for different failure rates. (a) A(t) for for different λ s ; (b) A(t) for for different λ r ; (c) m f ( t ) for different λ s ; (d) m f ( t ) for different λ r ; (e) m r ( t ) for different λ s ; (f) m r ( t ) for different λ r .
Figure 2. Time-dependent reliability indices for different failure rates. (a) A(t) for for different λ s ; (b) A(t) for for different λ r ; (c) m f ( t ) for different λ s ; (d) m f ( t ) for different λ r ; (e) m r ( t ) for different λ s ; (f) m r ( t ) for different λ r .
Axioms 13 00423 g002
Figure 3. Time-dependent reliability indices for different repair rates. (a) A(t) for for different μ s ; (b) A(t) for for different μ n + 3 ; (c) m f ( t ) for different μ s ; (d) m f ( t ) for different μ n + 3 ; (e) m r ( t ) for different μ s ; (f) m r ( t ) for different μ n + 3 .
Figure 3. Time-dependent reliability indices for different repair rates. (a) A(t) for for different μ s ; (b) A(t) for for different μ n + 3 ; (c) m f ( t ) for different μ s ; (d) m f ( t ) for different μ n + 3 ; (e) m r ( t ) for different μ s ; (f) m r ( t ) for different μ n + 3 .
Axioms 13 00423 g003
Figure 4. Reliability and MTTF for different λ r . (a) R(t) for different λ r ; (b) Effect of λ r on MTTF.
Figure 4. Reliability and MTTF for different λ r . (a) R(t) for different λ r ; (b) Effect of λ r on MTTF.
Axioms 13 00423 g004
Table 1. Time-dependent system availability A ( t ) for different λ s s and λ s i .
Table 1. Time-dependent system availability A ( t ) for different λ s s and λ s i .
Time t λ ss λ si
0.00050.0010.00150.00030.00060.0009
5000.8009060.8008720.8008400.8009080.8008820.800858
10000.7724210.7723130.7722170.7724300.7723390.772254
20000.7677300.7675790.7674470.7677510.7675980.767456
30000.7676030.7674480.7673130.7676290.7674590.767301
40000.7675920.7674370.7673010.7676200.7674440.767282
50000.7675890.7674340.7672980.7676170.7674400.767276
Table 2. Time-dependent system availability A ( t ) with different μ n + 1 and μ n + 2 .
Table 2. Time-dependent system availability A ( t ) with different μ n + 1 and μ n + 2 .
Time t μ n + 1 μ n + 2
0.00180.00360.00720.00120.00240.0048
5000.8008990.8009210.8009490.8008970.8009290.800947
10000.7723990.7724900.7725640.7723850.7725190.772558
20000.7676980.7678540.7679380.7676600.7679140.767955
30000.7675710.7677360.7678200.7675170.7678130.767854
40000.7675590.7677260.7678100.7674980.7678100.767850
50000.7675570.7677240.7678070.7674920.7678100.767850
Table 3. Time-dependent system availability A ( t ) with different numbers of safety units.
Table 3. Time-dependent system availability A ( t ) with different numbers of safety units.
λ s = 0.001 , λ r = 0.0009 , λ ss = 0.0006 , λ si = 0.0004
μ s = 0.007 , μ n + 1 = 0.0018 , μ n + 2 = 0.0012 , μ n + 3 = 0.003
     n                                             A ( t )
    2                                            0.755816691376763
    3                                            0.767557102387178
    5                                            0.769204802928852
    8                                            0.769230719866391
    10                                            0.769230769237539
    20                                            0.769230770014985
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.

Share and Cite

MDPI and ACS Style

Kasim, E.; Yumaier, A. C0–Semigroups Approach to the Reliability Model Based on Robot-Safety System. Axioms 2024, 13, 423. https://doi.org/10.3390/axioms13070423

AMA Style

Kasim E, Yumaier A. C0–Semigroups Approach to the Reliability Model Based on Robot-Safety System. Axioms. 2024; 13(7):423. https://doi.org/10.3390/axioms13070423

Chicago/Turabian Style

Kasim, Ehmet, and Aihemaitijiang Yumaier. 2024. "C0–Semigroups Approach to the Reliability Model Based on Robot-Safety System" Axioms 13, no. 7: 423. https://doi.org/10.3390/axioms13070423

APA Style

Kasim, E., & Yumaier, A. (2024). C0–Semigroups Approach to the Reliability Model Based on Robot-Safety System. Axioms, 13(7), 423. https://doi.org/10.3390/axioms13070423

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