Next Article in Journal
A Review: Construction of Statistical Distributions
Previous Article in Journal
On Double Cyclic Codes over Finite Chain Rings for DNA Computing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Finite-Time Dissipative Fault Estimate and Event-Triggered Fault-Tolerant Synchronization Control for Discrete Semi-Markov Jumping Neural Networks

1
School of Mathematics and Statistics Science, Ludong University, Yantai 264025, China
2
School of Chemistry and Chemical Engineering, Ludong University, Yantai 264025, China
*
Author to whom correspondence should be addressed.
Entropy 2025, 27(12), 1186; https://doi.org/10.3390/e27121186
Submission received: 14 October 2025 / Revised: 19 November 2025 / Accepted: 19 November 2025 / Published: 22 November 2025

Abstract

This paper studies discrete-time semi-Markov neural networks (NNs) and proposes a finite-time γ -dissipative fault estimate (FE) and fault-tolerant synchronization control (FTSC) with the event-triggered method. Based on the intermediate variable introduced, an FE scheme is presented to obtain estimate information of faults, states, and intermediate variables. According to the event-triggered condition designed, an FTSC protocol is proposed so that the error system between master system and slave system is stochasticslly synchronized within finite time and meets γ -dissipativity. An example shows the validity of this proposed scheme.

1. Introduction

Neural networks (NNs) that mimic animal NN behavior are an algorithm to process distributed parallel information. Because of the complexity of NNs, the relationships between internal nodes are adjusted to deal with information in network. Regardless of the type of NNs, they have some common characteristics, such as massively parallel processing, distributed storage, and topology elasticity [1,2].
In contrast to pure Markov processes, only the transition time and probability of semi-Markov processes are determined by the time required for the system to reach its present state. Markov theory is named after Russian mathematician Andrei Markov, who pioneered the systematic study of how stochastic processes can be described mathematically. Semi-Markov processes were proposed by Paul Levy in 1954 to build more general models for probabilistic systems. This class of models are used to analyze complex dynamic systems and are often used in reliability calculation. For semi-Markov jump NNs, extended dissipativity was considered by considering partly unknown transition rates [3] or known transition rates [4], and state estimation [5,6] problem are studied by applying different methods, respectively.
Finite-time control [7], due to its characteristic, has been widely applied in various fields. Usually, the system state is required to run within a limited time interval and has good performance indicators within a given time [8,9,10]. For finite-time Markov problems in NNs, the H boundedness [11] was analyzed, synchronization [12] was shown, and l 2 l state estimation [13] based on unreliable communication links was obtained, respectively. For semi-Markov NN problems, finite-time synchronization control [14,15] was studied, and the L 2 L synchronization [16] was analyzed, respectively.
Because faults in modern industrial systems are inevitable, faults also happen in NNs. Faults happening may cause serious results. To deal with this problem, fault-tolerant control (FTC) [17] was proposed. The FTC problem [18] in NNs was studied based on ADP methods. The extended FE observer [19] was designed to propose an FTC method for discrete Markovian jump systems. A control protocol with actuator fail-resistant performance was adopted to ensure reliable leader–follower consensus [20]. To save more network resources, a new event-triggering method was proposed which was not constrained by actual system state and designed a reliable observer-based controller [21].
In particular, results [22,23] on semi-Markov NNs existed. Based on the semi-Markov jump model with actuator faults as random variables [22] in NNs, the criterion of passivity FTSC was analyzed. The improved mean-square exponential stability criterion [23] was derived, and then an FTC strategy was proposed by using several decoupling techniques.
Since faults were not considered in [14,15], which motivates our discussion, we discuss a finite-time γ -dissipative FE and event-triggered FTSC for semi-Markov NNs. The highlights of this paper are listed:
(1)
The error system between master system and slave system are obtained, and then an intermediate FE method is designed so that the state, fault, and intermediate variables are estimated, which provides information for FTSC protocol proposed. The intermediate observer can obtain better fault estimation results than the general observer [19].
(2)
Considering the event-triggered condition designed and estimate information, an FTSC protocol is presented to analyze stochastic FTSC with γ -dissipativity of error systems with finite time. This finite-time scheme can converge quickly and achieve FTSC more quickly than asymptotic stability schemes [19].
(3)
The proposed scheme not only estimates faults, but also proposes the FTSC protocol, which belongs to the active FTC category and is more suitable for practical engineering field.

2. Problem Statement

A NN as master system is that
x m ( k + 1 ) = A 1 ϱ ( k ) x m ( k ) + B ϱ ( k ) g ( x m ( k ) ) + C ϱ ( k ) g ( x m ( k d ( k ) ) ) ,
y m ( k ) = A 2 ϱ ( k ) x m ( k ) ,
in which x m ( k ) = [ x m 1 ( k ) , x m 2 ( k ) , , x m n ( k ) ] T denotes state of neuron’s state; y m ( k ) R y is measured output; g ( x m ( k ) ) = [ g 1 ( x m 1 ( k ) ) , g 2 ( x m 2 ( k ) ) , , g n ( x m n ( l ) ) ] T denotes neuron activation function; d ( k ) R d denotes time-varying delay satisfied 0 < d ̲ d ( k ) d ¯ and d ̲ , d ¯ are given; diagonal matrix A 1 ϱ ( k ) > 0 ; and matrix B ϱ ( k ) , C ϱ ( k ) , A 2 ϱ ( k ) are known. For k 0 , ϱ ( k ) is a discrete-time state semi-Markov process with values in N = { 1 , 2 , , N } with ϱ 0 , where P r { ϱ ( k + h ) = j | ϱ ( k ) = i } = r i j ( h ) h + o ( h ) if i j , P r { ϱ ( k + h ) = j | ϱ ( k ) = i } = 1 + r i i ( h ) h + o ( h ) if i = j , and lim h 0 ( o ( h ) / h ) = 0 , r i j ( h ) 0 is transition rate from mode i at k to mode j at k + h and r i i ( h ) = j N , j i r i j ( h ) . For simplicity, set ϱ ( k ) = i , then A 1 ϱ ( k ) = A 1 i > 0 , B ϱ ( k ) = B i , C ϱ ( k ) = C i , A 2 ϱ ( k ) = A 2 i ; the other symbols are similar expression.
A corresponding NN as slave system is that
x s ( k + 1 ) = A 1 i x s ( k ) + B i g ( x s ( k ) ) + C i g ( x s ( k d ( k ) ) ) + D i u s ( k ) + E i ω ( k ) + F i f ( k ) ,
y s ( k ) = A 2 i x s ( k ) ,
in which x s ( k ) , g ( x s ( k ) ) , and y s ( k ) are similar definitions in master systems, and u s ( k ) R u denotes the control input. ω ( k ) L [ 0 , ) denotes external disturbance and f ( k ) R f denotes the fault, which are different and ω ( k ) is bounded. D i , E i , and F i are known matrices.
Define x ( k ) = x s ( k ) x m ( k ) , y ( k ) = y s ( k ) y m ( k ) , then error system between NN (1) and (2) and NN (3) and (4) is
x ( k + 1 ) = A 1 i x ( k ) + B i g ( x ( k ) ) + C i g ( x ( k d ( k ) ) ) + D i u s ( k ) + E i ω ( k ) + F i f ( k ) ,
y ( k ) = A 2 i x ( k ) ,
where
g ( x ( k ) ) = g ( x s ( k ) ) g ( x m ( k ) ) , g ( x ( k d ( k ) ) ) = g ( x s ( k d ( k ) ) ) g ( x m ( k d ( k ) ) ) .
Assumption 1 
([24]). In NN (1) and (2) and NN (3) and (4), g l ( · ) is bounded and satisfies
φ ̲ l g l ( x ) g l ( y ) x y φ ¯ l ,
where l = 1 , , n , y x , g l ( · ) = 0 , φ ̲ l φ ¯ l are known real scalars.
Remark 1. 
Pointed out in [6], in practice, r i j ( h ) is usually partly measurable and bounded with r m i j r i j ( h ) r M i j . In this case, r i j ( h ) can be given as follows:
r i j ( h ) = k = 1 K ϕ k r i j , k , k = 1 K ϕ k = 1 , ϕ k 0 ,
where
r i j , k = r M i j + ( k 1 ) r m i j r M i j K 1 , i j r m i j ( k 1 ) r m i j r M i j K 1 , i = j .

3. State Transformation

Firstly, to better estimate faults, we designed an intermediate observer for system (5) and (6).
An intermediate variable ξ ( k ) is introduced
ξ ( k ) = f ( k ) G i x ( k ) ,
with G i is a gain to be designed. So it is
ξ ( k + 1 ) = f ( k + 1 ) + G i A 1 i x ( k ) G i B i g ( x ( k ) ) G i C i g ( x ( k d ( k ) ) ) G i D i u s ( k ) G i E i ω ( k ) G i F i G i x ( k ) G i F i ξ ( k ) .
For the propose of FE, we designed an intermediate observer:
x ^ ( k + 1 ) = A 1 i x ^ ( k ) + B i g ( x ^ ( k ) ) + C i g ( x ^ ( k d ( k ) ) ) + D i u s ( k ) + F i f ^ ( k ) + H 1 i ( y ( k ) y ^ ( k ) ) ,
ξ ^ ( k + 1 ) = G i F i ξ ^ ( k ) G i D i u s ( k ) + ( G i A 1 i G i F i G i ) x ( k ) + H 2 i ( y ( k ) y ^ ( k ) ) ,
f ^ ( k ) = ξ ^ ( k ) + G i x ^ ( k ) ,
y ( k ) = y ( k ) y ^ ( k ) ,
where H 1 i , H 2 i are gains to be designed.
Set x ¯ ( k ) = x ( k ) x ^ ( k ) , ξ ¯ ( k ) = ξ ( k ) ξ ^ ( k ) , f ¯ ( k ) = f ( k ) f ^ ( k ) , we have
x ¯ ( k + 1 ) = ( A 1 i H 1 i A 2 i ) ( x ( k ) x ^ ( k ) ) + B i ( g ( x ( k ) ) g ( x ^ ( k ) ) ) + C i ( g ( x ( k d ( k ) ) ) g ( x ^ ( k d ( k ) ) ) ) + E i ω ( k ) + F i ( f ( k ) f ^ ( k ) ) = ( A 1 i H 1 i A 2 i ) x ¯ ( k ) + B i g ( x ¯ ( k ) ) + C i g ( x ¯ ( k d ( k ) ) ) + E i ω ( k ) + F i f ¯ ( k ) ,
ξ ¯ ( k + 1 ) = ( G i A 1 i G i F i G i H 2 i ) ( x ( k ) x ^ ( k ) ) G i B i ( g ( x ( k ) ) g ( x ^ ( k ) ) ) G i C i ( g ( x ( k d ( k ) ) ) g ( x ^ ( k d ( k ) ) ) ) G i E i ω ( k ) G i F i ( ξ ( k ) ξ ^ ( k ) ) + f ( k + 1 ) = f ( k + 1 ) + ( G i A 1 i G i F i G i H 2 i ) x ¯ ( k ) G i B i g ( x ¯ ( k ) ) G i C i ( g ( x ¯ ( k d ( k ) ) ) G i E i ω ( k ) G i F i ξ ¯ ( k ) ,
f ¯ ( k ) = ( ξ ( k ) ξ ^ ( k ) ) + G i ( x ( k ) x ^ ( k ) ) = ξ ¯ ( k ) + G i x ¯ ( k ) .
Replacing (16) with (14), it has
x ¯ ( k + 1 ) = ( A 1 i H 1 i A 2 i + F i G i ) x ¯ ( k ) + B i g ( x ¯ ( k ) ) + C i g ( x ¯ ( k d ( k ) ) ) + E i ω ( k ) + F i ξ ¯ ( k ) .
Let G i = ρ F i T and define x ¯ ¯ ( k ) = x ¯ T ( k ) ξ ¯ T ( k ) T , then
x ¯ ¯ ( k + 1 ) = ( A ¯ 1 i H i A ¯ 2 i 0 ) x ¯ ¯ ( k ) + B ¯ i g ( I 10 x ¯ ¯ ( k ) ) + C ¯ i g ( I 10 x ¯ ¯ ( k d ( k ) ) ) + E ¯ i ω ¯ ( k ) ,
where
A ¯ 1 i = A 1 i + ρ F i F i T F i ρ F i T ( A 1 i ρ F i F i T ) ρ F i T F i , H i = H 1 i H 2 i , I 10 = I 0 T , A ¯ 2 i 0 = A 2 i T 0 T , B ¯ i = B i ρ F i T B i , E ¯ i = E i 0 ρ F i T E i I , C ¯ i = C i ρ F i T C i , ω ¯ ( k ) = ω k f ( k + 1 ) .
Remark 2. 
This paper’s FE design method is an extension of the design method in [25,26,27] to semi-Markov discrete NNs, which provides the basis for the γ-dissipative FTSC.
Remark 3. 
For the selection of G i , scalar ρ is chosen based on experience, and F i is parameter matrix of fault f ( k ) , which restricts the gain of intermediate variable ξ ( k ) and observer (10)–(13) and improves the estimate ability similarly to the literature [27]. The higher the scalar ρ, the faster the convergence rate, but it also easily cause overshoot phenomenon.
Next, to reduce the impact of faults, we proposed an event-triggered FTSC protocol.
An event generator is designed [28] to detect and manage the y ( k ) ’s transmission. We set an event-generating function
J ( k ) = ( y ( s l ) y ( k ) ) T ( y ( s l ) y ( k ) ) α y T ( k ) y ( k ) ,
in which α [ 0 , 1 ) , y ( k ) / y ( s l ) is the current/latest transmitted measurement. When J ( k ) > 0 , system signals are transmitted and the transmitted instants set is obtained based on s l + 1 = inf { k N | k > s l , J ( k ) > 0 , 0 < s 0 < s 1 < < s l < } , where { s 0 , s 1 , s 2 , } { k 0 , k 1 , k 2 , } . Any measurement output variables will be transmitted if J ( k ) > 0 . In [ s l , s l + 1 ) , considering the event-triggered scheme, then
( y ( s l ) y ( k ) ) T ( y ( s l ) y ( k ) ) α y T ( k ) y ( k ) .
Based on the above, we designed an FTSC protocol:
u s ( k ) = D i + S c 1 i A 2 i x ^ ( k ) D i + S c 1 i y ( s l ) S c 2 i f ^ ( k ) ,
where S c 1 i , S c 2 i are gains to be designed. We selected S c 2 i = D i + F i with D i + as pseudo-inverse of D i , then
u s ( k ) = D i + S c 1 i A 2 i x ^ ( k ) D i + S c 1 i y ¯ ( k ) D i + S c 1 i y ( k ) D i + F i f ^ ( k ) ,
in which y ¯ ( k ) = y ( k ) y ( s l ) , substituting (22) into (5) gives
x ( k + 1 ) = A 1 i x ( k ) + B i g ( x ( k ) ) + C i g ( x ( k d ( k ) ) ) S c 1 i A 2 i x ¯ ( k ) S c 1 i y ¯ ( k ) + E i ω ( k ) + F i ξ ¯ ( k ) + F i G i x ¯ ( k ) = A 1 i x ( k ) + B i g ( x ( k ) ) + C i g ( x ( k d ( k ) ) ) + ( F ¯ i S c 1 i A ¯ 2 i 0 ) x ¯ ¯ ( k ) S c 1 i y ¯ ( k ) + E i 0 ω ¯ ( k ) ,
where F ¯ = ρ F i F i T F i , E i 0 = E i 0 .
Considering (16), set y ( k ) = x ¯ ( k ) f ¯ ( k ) , it can have
y ( k ) = A ¯ 2 i x ¯ ¯ ( k ) .
For (18) and (24), set X ( k ) = x ¯ ¯ ( k ) x ( k ) , Y ( k ) = y ( k ) x ( k ) , so it has
X ( k + 1 ) = A ¯ ¯ 1 i X ( k ) + B ¯ ¯ i g ( I ¯ X ( k ) ) ¯ + C ¯ ¯ i g ( I ¯ ¯ X ( k d ( k ) ) ) S ¯ ¯ c 1 i y ¯ ( k ) + E ¯ ¯ i ω ¯ ( k ) ,
Y ( k ) = A ¯ ¯ 2 i X ( k ) ,
where
A ¯ ¯ 1 i = A ¯ 1 i H i A ¯ 2 i 0 0 F ¯ i S c 1 i A ¯ 2 i 0 A 1 i , B ¯ ¯ i = B ¯ i T B i T T , C ¯ ¯ i = C ¯ i T C i T T , S ¯ ¯ c 1 i = 0 S c 1 i , E ¯ ¯ i = E i E i 0 , A ¯ 2 i = I 0 ρ F i T I , A ¯ ¯ 2 i = A ¯ 2 i 0 0 I , I ¯ ¯ = I 10 I .
For system (25) and (26), definitions and lemmas are used in Section 4 and Section 5.
Definition 1 
([29]). Considering NN (1) and (2) and NN (3) and (4) with given constants 0 < ρ 1 < ρ 2 and matrix R > 0 , (10)–(13) is an intermediate FE observer to obtain estimates of x ( k ) and f ( k ) in system (5) and (6), and (21) is an event-triggered FTSC protocol to compensate the effect of faults so that system (25) and (26) is stochastically synchronized within finite time with ω ¯ ( k ) = 0 if
E { X T ( 0 ) R X ( 0 ) } ρ 1 E { X T ( k ) R X ( k ) } < ρ 2 .
Definition 2 
([30]). For given real matrices U 1 i = U 1 i T , U 2 i , and U 3 i = U 3 i T and constant γ > 0 , system (25) and (26) is strictly ( U 1 i , U 2 i , U 3 i ) -γ-dissipative when X ( V ( 0 ) ) = 0 if
E { k = 0 S 1 [ Y T ( k ) U 1 i Y ( k ) + 2 Y T ( k ) U 2 i ω ¯ ( k ) + ω ¯ T ( k ) U 3 i ω ¯ ( k ) ] } γ E { k = 0 S 1 ω ¯ T ( k ) ω ¯ ( k ) } .
Remark 4. 
For the strict ( U 1 i , U 2 i , U 3 i ) -γ-dissipativity, this performance is equivalent to the other performance if U 1 i , U 2 i , U 3 i and γ take the particular matrices or constant; that is, setting U 1 i = 0 , U 2 i = I , U 3 i = 0 , and γ = 0 , this performance becomes strict passivity; let U 1 i = I , U 2 i = 0 , U 3 i = γ ¯ 2 I , γ = 0 , this performance is standard H performance index γ ¯ ; when U 1 i = I , U 2 i = 0 , U 3 i = β 2 I , γ = 0 , this performance is the standard H performance index β. Additionally, the dissipation theory unifies traditional H performance and H performance.
Remark 5. 
If system (25) and (26) is strictly ( U 1 i , U 2 i , U 3 i ) -γ-dissipative, it must be ( U 1 i , U 2 i , U 3 i ) -dissipative. Specifically, system (25) and (26) becomes ( U 1 i , U 2 i , U 3 i ) -dissipative if γ = 0 .
Lemma 1 
([31]). For any vectors Ξ, Υ, and matrix Θ with appropriate dimension, the following inequality holds:
2 Ξ T Υ Ξ T Θ Ξ + Υ T Θ 1 Υ .
Lemma 2 
([32]). Considering scalar d ̲ and matrix R 4 i = R 4 i T > 0 given, the following inequality holds:
d ̲ t = k d ̲ k 1 η T ( t ) R 4 i η ( t ) X T ( k ) R 4 i X ( k ) + 2 X T ( k ) R 4 i X ( k d ̲ ) X T ( k d ̲ ) R 4 i X ( k d ̲ ) .
Lemma 3 
([33]). Considering matrices P ˇ j = P ˇ j T > 0 , Π and scalar κ > 0 given, the following inequality holds:
Π T P ˇ j 1 Π κ 2 P ˇ j κ Π κ Π T .
Subsequently, main result of this paper is shown; i.e., the stochastical finite-time fault-tolerant synchronization with strict ( U 1 i , U 2 i , U 3 i ) - γ -dissipativity of system (25) and (26) is analyzed and their existent conditions are shown. Then, gains of the FE and FTSC schemes designed are given.

4. γ -Dissipative Finite-Time FTSC Analyse

This section analyse the stochastical FTSC with strict ( U 1 i , U 2 i , U 3 i ) - γ -dissipativity of system (25) and (26) within finite time and show the existent condition.
Theorem 1. 
For given scalars γ > 0 , 0 < ρ 1 < ρ 2 , ρ, d ̲ , d ¯ and matrix R > 0 , system (25) and (26) achieves stochastical fault-tolerant synchronization within finite time with strict ( U 1 i , U 2 i , U 3 i ) -γ-dissipativity if there exist matrices P i = P i T > 0 , R 1 i = R 1 i T > 0 , R 2 i = R 2 i T > 0 , R 3 i = R 3 i T > 0 , R 4 i = R 4 i T > 0 , U 1 i = U 1 i T , U 3 i = U 3 i T , diagonal matrices θ 1 i > 0 , θ 2 i > 0 , matrices T 12 i , T 13 i , T 23 i , T 24 i , T 3 i , U 2 i , scalars λ ¯ , λ ̲ such that
Σ 11 Σ 12 Σ 13 Σ 14 Σ 15 A ¯ ¯ 1 i T 0 Σ 22 Σ 23 0 0 0 Σ 27 Σ 33 0 Σ 35 Σ 36 0 Σ 44 Σ 45 Σ 46 0 Σ 55 0 0 Σ 66 0 Σ 77 < 0 ,
λ ̲ R P i < 0 ,
P i λ ¯ R < 0 ,
λ ¯ ρ 1 ρ 2 λ ̲ < 0 ,
where
Σ 11 = P i + R 1 i + R 2 i R 4 i I ¯ ¯ T φ 1 θ 1 i I ¯ ¯ + α A 02 i T A 02 i A ¯ ¯ 2 i T U 1 i A ¯ ¯ 2 i , Σ 12 = R 4 i 0 0 , Σ 13 = I ¯ ¯ T φ 2 2 θ 1 i 0 , Σ 14 = 0 A ¯ ¯ 2 i T U 2 i , Σ 15 = A ¯ ¯ 1 i T T 3 i T 3 i , Σ 23 = 0 31 Σ 231 , 0 31 = 0 0 0 T , Σ 22 = Σ 221 T 13 i T T 23 i 0 Σ 222 T 23 i T T 24 i Σ 223 , Σ 27 = T 12 i T T 13 i T 0 0 T 23 i T T 24 i T T , Σ 221 = R 1 i R 4 i + T 12 i + T 12 i T , Σ 223 = R 2 i T 24 i T 24 i T , Σ 222 = T 13 i T 13 i T + T 23 i + T 23 i T I ¯ ¯ T φ 1 θ 2 i I ¯ ¯ , Σ 231 = 0 ( I ¯ ¯ T φ 2 2 θ 2 i ) T 0 T , Σ 33 = d i a g { θ 1 i , θ 2 i } , Σ 36 = B ¯ ¯ i C ¯ ¯ i T , Σ 35 = T 3 i T B ¯ ¯ i T 3 i T C ¯ ¯ i T , Σ 44 = d i a g { I , ( U 3 i γ I ) } , Σ 45 = T 3 i T S ¯ ¯ c 1 i T 3 i T E ¯ ¯ i T , Σ 46 = S ¯ ¯ c 1 i E ¯ ¯ i T , Σ 66 = P ˇ j 1 , Σ 55 = ( d ¯ d ̲ ) R 3 i + d ̲ 2 R 4 i T 3 i T 3 i T , Σ 77 = d i a g { 1 d ¯ d ̲ R 3 i , 1 d ¯ d ̲ R 3 i } , P ˇ j = j = 1 N r i j ( h ) P j , P i = R 1 2 P i R 1 2 , λ ̲ = inf { λ min ( P i ) } , λ ¯ = sup { λ max ( P i ) } , φ 1 = d i a g { φ ¯ 1 φ ̲ 1 , φ ¯ 2 φ ̲ 2 , , φ ¯ n φ ̲ n } , φ 2 = d i a g { φ ¯ 1 + φ ̲ 1 , φ ¯ 2 + φ ̲ 2 , , φ ¯ n + φ ̲ n } .
Proof. 
See Appendix A. □

5. Gain Design

In this section, the gain design problem of observer (10)–(13) and controller (21) is presented.
Theorem 2. 
For given scalars γ > 0 , 0 < ρ 1 < ρ 2 , ρ, d ̲ , d ¯ and matrices R 1 , R 2 > 0 , system (25) and (26) is stochastically fault-tolerant synchronized within finite time and satisfies (28) if there exist matrices P 1 i = P 1 i T > 0 , P 2 i = P 2 i T > 0 , R 11 i = R 11 i T > 0 , R 12 i = R 12 i T > 0 , R 21 i = R 21 i T > 0 , R 22 i = R 22 i T > 0 , R 31 i = R 31 i T > 0 , R 32 i = R 32 i T > 0 , R 41 i = R 41 i T > 0 , R 42 i = R 42 i T > 0 , U 11 i = U 11 i T , U 13 i = U 13 i T , U 3 i = U 3 i T , diagonal matrices θ 1 i > 0 , θ 2 i > 0 , matrices U 12 i , T 121 i , T 122 i , T 123 i , T 124 i , T 131 i , T 132 i , T 133 i , T 134 i , T 231 i , T 232 i , T 233 i , T 234 i , T 241 i , T 242 i , T 243 i , T 244 i , T 31 i , T 32 i , U 21 i , U 22 i , H i , S c 1 i , scalars λ ¯ , λ ̲ so that
Ξ 11 Ξ 12 Ξ 13 Ξ 14 Ξ 22 Ξ 23 Ξ 24 Ξ 33 Ξ 34 Ξ 44 < 0 ,
λ ̲ d i a g { R 1 , R 2 } d i a g { P 1 i , P 2 i } < 0 ,
d i a g { P 1 i , P 2 i } λ ¯ d i a g { R 1 , R 2 } < 0 ,
λ ¯ ρ 1 ρ 2 λ ̲ < 0 ,
where
Ξ 11 = Ξ 111 Ξ 112 Ξ 113 , Ξ 22 = Ξ 221 Ξ 222 0 Ξ 223 Ξ 224 Ξ 225 , Ξ 111 = P 1 i + R 11 i + R 21 i R 41 i I 10 T φ 1 θ 1 i I 10 A 2 i T U 11 i A 2 i , Ξ 12 = Ξ 121 0 0 , Ξ 112 = I 10 T φ 1 θ 1 i A 2 i T U 12 i , Ξ 113 = P 2 i + R 12 i + R 22 i R 42 i φ 1 θ 1 i U 13 i + α A 2 i T A 2 i , Ξ 221 = Ξ 2211 Ξ 2212 Ξ 2213 , Ξ 223 = Ξ 2231 Ξ 2232 Ξ 2233 , Ξ 222 = T 131 i T T 121 i T 133 i T T 122 i T 132 i T T 123 i T 134 i T T 124 i , Ξ 2211 = R 11 i R 41 i + T 121 i T + T 121 i , Ξ 2213 = R 12 i R 42 i + T 124 i T + T 124 i , Ξ 2212 = T 122 i + T 123 i T , Ξ 121 = d i a g { R 41 i , R 42 i } , Ξ 224 = T 241 i T T 231 i T 243 i T T 232 i T 242 i T T 233 i T 244 i T T 234 i , Ξ 2231 = T 131 i T 131 i T + T 231 i + T 131 i T I 10 T φ 1 θ 2 i I 10 , Ξ 2232 = T 132 i T 133 i T + T 232 i + T 133 i T I 10 T φ 1 θ 2 i , Ξ 2233 = T 134 i T 134 i T + T 234 i + T 234 i T φ 1 θ 2 i , Ξ 225 = Ξ 2251 T 242 i T 242 i T T 244 i T T 244 i R 22 i , Ξ 2251 = T 241 i T T 241 i R 21 i , Ξ 13 = Ξ 131 0 0 Ξ 132 , Ξ 23 = 0 0 Ξ 231 0 , Ξ 231 = 0 Ξ 2311 T 0 , Ξ 33 = d i a g { θ 1 i , θ 2 i , I , ( U 3 i γ I ) } , Ξ 14 = Ξ 141 X 142 0 0 , Ξ 131 = I 10 T 1 2 φ 2 θ 1 i 1 2 φ 2 θ 1 i , Ξ 132 = A ¯ 2 i T U 21 i U 22 i , Ξ 141 = Ξ 1411 F ¯ i T 32 i A ¯ 2 i 0 S c 1 i T 0 A 1 i T 32 i T 32 i , Ξ 142 = Ξ 1421 F ¯ i T 32 i A ¯ 2 i 0 S c 1 i T 0 A 1 i T 32 i , Ξ 1411 = A ¯ 1 i T T 31 i T 13 i A ¯ 2 i 0 H i T , Ξ 1421 = A ¯ 1 i T T 31 i A ¯ 2 i 0 H i T , Ξ 24 = 0 0 Ξ 241 Ξ 242 , Ξ 34 = Ξ 341 Ξ 341 0 0 , Ξ 341 = B ¯ i T 31 i B i T T 32 i C ¯ i T 31 i C i T T 32 i 0 S c 1 i T E ¯ i T 31 i E i 0 T T 32 i , Ξ 2311 = 1 2 I 10 T φ 2 θ 2 i 1 2 φ 2 θ 2 i , Ξ 241 = T 121 i T 122 i T 123 i T 124 i T 131 i T 132 i T 133 i T 134 i 0 0 0 0 , Ξ 242 = 0 0 0 0 T 231 i T 232 i T 233 i T 234 i T 241 i T 242 i T 243 i T 244 i 0 0 0 0 , Ξ 44 = d i a g { Ξ 441 , Ξ 442 , Ξ 443 , Ξ 444 } , Ξ 443 = Ξ 444 , Ξ 441 = d i a g { Ξ 4411 , Ξ 4412 } , Ξ 4422 = P ˇ 2 j T 32 i T 32 i T , Ξ 4411 = ( d ¯ d ̲ ) R 31 i + d ̲ 2 R 41 i T 31 i T 31 i T , Ξ 4412 = ( d ¯ d ̲ ) R 32 i + d 1 2 R 42 i T 32 i T 32 i T , Ξ 442 = d i a g { Ξ 4421 , Ξ 4422 } , Ξ 4421 = P ˇ 1 j T 31 i T 31 i T , Ξ 443 = 1 d ¯ d ̲ d i a g { R 31 i , R 32 i } .
Then the gains H i and S c 1 i are shown as
H i = T 31 i T H i ,
S c 1 i = T 32 i T S c 1 i .
Proof. 
See Appendix B. □

6. An Example

This section presents an example to illustrate the effectiveness and applicability of this finite-time event-triggered γ -dissipative FE and FTSC schemes.
Assuming that the semi-Markov jump discrete-time NN considered has two modes:
Parameters in Mode 1:
A 11 = 0.5 0 0 0.5 , B 1 = 0.1 0 0 0.2 , E 1 = 0.1 0.2 , C 1 = 0.01 0 0 0.01 , D 1 = 0.2 0 0 0.2 , F 1 = 0.2 0.2 , A 21 = 0.1 0.1 ,
and parameters in Mode 2:
A 12 = 0.2 0 0 0.5 , B 2 = 0.2 0 0 0.1 , E 2 = 0.1 0.1 , C 2 = 0.02 0 0 0.02 , D 2 = 0.3 0 0 0.4 , F 2 = 0.2 0.2 , A 22 = 0.1 0.2 ,
and x ( k ) = x ( 1 , k ) x ( 2 , k ) , the activation function [13] is that g a = 1 2 ( | x a ( k ) + 1 | | x a ( k ) 1 | ) , a = 1 , 2 ; it is easy that φ 1 = d i a g { 0 , 0 } and φ 2 = d i a g { 0.5 , 0.5 } by using Assumption 1; d ( k ) = e k e k + 1 with d ̲ = 0.5 and d ¯ = 1 ; and fault f ( k ) is that f ( k ) = 1 , 60 < k 120 0 , o t h e r s . The transition rate matrix is chosen as in [6,13,34], which is 2.2 r 11 ( h ) 1.8 , 1.9 r 22 ( h ) 0.5 . We choose the corresponding event-trigger parameter as α = 0.7 and K = 2 in Remark 1. We consider ρ = 7.5 , γ = 2 , ρ 1 = 0.9 , ρ 2 = 2.6 , R 1 = I 3 , R 2 = I 2 , and ω ( k ) = 0.2 r a n d 0.1 . When x ( 0 ) = 0.5 1 1 T , fault f ( k ) and its estimation f ^ ( k ) are given in Figure 1, and the error state in (5) between system (1) and system (3) and its compensated error state are given in Figure 2 and Figure 3, which show that controller (19) is effective by the comparison.
Although this example is a numerical examples, it is easy to obtain that this developed scheme is effective through the above analysis and comparison, i.e., semi-Markov NN has some finite-time γ -dissipative FTSC ability based on an event-triggered method in this paper.
Remark 6. 
This paper designs an intermediate observer to estimate faults.
Based on the utilized information, an event-triggered FTSC protocol is proposed to achieve the FTSC with γ -dissipativity within finite time. The comparison of this scheme with the existing ones are given in Table 1.
By this comparison, it is easy to discover that semi-Markov jump discrete NNs in this paper are more consistent with the actual systems. The practicability of this proposed method is better, which is one of our future works.

7. Conclusions

This paper discusses discrete semi-Markov NNs and proposes the finite-time γ -dissipative FE and FTSC by applying an event-triggered theory. Based on the intermediate variable introduced, an FE scheme is designed to estimate the state, faults, and intermediate variables. Based on the estimate information and the event-triggered condition, an FTSC protocol is constructed to obtain the existence conditions of stochastical finite-time fault-tolerant synchronization with the γ -dissipativity of error system. The effectiveness of the proposed solution is proven by an example. In future researches, we will mainly study more appropriate FE and FTC design methods to reduce the conservatism and consider their application in engineering practice, such as robot systems, multi-agent systems, UAV swarms, high-speed train traction systems, and so on.

Author Contributions

X.Z.: Conceptualization, methodology, validation, formal analysis, writing, and review and editing. Y.W.: Formal analysis, validation, and editing. Y.C.: Conceptualization, methodology, investigation, resources, and review and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by National Natural Science Foundation of China under Grant 62403227, 12201280, and 62273172, and Natural Science Foundation of Shandong Province under Grant ZR2023MF065.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Acknowledgments

The authors would like to thank the reviewers for their valuable and helpful comments which have improved the presentation.

Conflicts of Interest

The authors declared that they have no conflicts of interest to this work, or any commercial or associative interest that represents a conflict of interest in connection with the work submitted.

Appendix A

Proof of Theorem 1. 
Define a Lyapunov functional:
V ( X ( k ) ) = X T ( k ) P i X ( k ) + t = k d ̲ k 1 X T ( t ) R 1 i X ( t ) + t = k d ¯ k 1 X T ( t ) R 2 i X ( t ) + j = d ¯ + 1 d ̲ t = k + j k 1 η T ( t ) R 3 i η ( t ) + d ̲ j = d ̲ 1 t = k + j k 1 η T ( t ) R 4 i η ( t ) ,
with η ( k ) = X ( k + 1 ) X ( k ) . When ω ¯ ( k ) = 0 , it has
E { Δ V ( X ( k ) ) } [ A ¯ ¯ 1 i X ( k ) + B ¯ ¯ i g ( I ¯ ¯ X ( k ) ) + C ¯ ¯ i g ( I ¯ ¯ X ( k d ( k ) ) ) S ¯ ¯ c 1 i y ¯ ( k ) ] T × P ˇ j [ A ¯ ¯ 1 i X ( k ) + B ¯ ¯ i g ( I ¯ ¯ X ( k ) ) + C ¯ ¯ i g ( I ¯ ¯ X ( k d ( k ) ) ) S ¯ ¯ c 1 i y ¯ ( k ) ] + X T ( k ) ( R 1 i + R 2 i ) X ( k ) X T ( k d ̲ ) R 1 i X ( k d ̲ ) X T ( k d ¯ ) R 1 i X ( k d ¯ ) + η T ( k ) [ ( d ¯ d ̲ ) R 3 i + d ̲ 2 R 4 i ] η ( k ) t = k d ¯ + 1 k d ̲ η T ( t ) R 3 i η ( t ) d ̲ t = k d ̲ k 1 η T ( t ) R 4 i η ( t ) .
We set ζ ( k ) = ζ 1 T ( k ) y ¯ T ( k ) η T ( k ) , then
2 ζ T T 1 i [ X ( k d ̲ ) X ( k d ( k ) ) t = k d ( k ) k d ̲ 1 η ( t ) ] = 0 ,
2 ζ T T 2 i [ X ( k d ( k ) ) X ( k d ¯ ) t = k d ¯ k d ( k ) 1 η ( t ) ] = 0 ,
where
ζ 1 ( k ) = [ X ( k ) X ( k d ̲ ) X ( k d ( k ) ) X ( k d ¯ ) g ( I ¯ ¯ X ( k ) ) g ( I ¯ ¯ X ( k d ( k ) ) ) ] .
Based on Lemma 1, one has
2 ζ T ( k ) T 1 i t = k d ( k ) k d ̲ 1 η ( t ) ( d ( k ) d ̲ ) ζ T ( k ) T 1 i R 3 i 1 T 1 i T ζ ( k ) + t = k d ( k ) k d ̲ 1 η T ( t ) R 3 i η ( t ) ,
and
2 ζ T ( k ) T 2 i t = k d ¯ k d ( k ) 1 η ( t ) ( d ¯ d ( k ) ) ζ T ( k ) T 2 i R 3 i 1 T 2 i T ζ ( k ) + t = k d ¯ k d ( k ) 1 η T ( t ) R 3 i η ( t ) .
From Lemma 2, it has
d ̲ t = k d ̲ k 1 η T ( t ) R 4 i η ( t ) X T ( k ) R 4 i X ( k ) + 2 X T ( k ) R 4 i X ( k d ̲ ) X T ( k d ̲ ) R 4 i X ( k d ̲ ) .
Considering Assumption 1, if diagonal matrix θ 1 i exists, one has
X T ( k ) I ¯ ¯ T φ 1 θ 1 i I ¯ ¯ X ( k ) + X T ( k ) I ¯ ¯ T φ 2 θ 1 i g ( I ¯ ¯ X ( k ) ) g T ( I ¯ ¯ X ( k ) ) θ 1 i g ( I ¯ ¯ X ( k ) ) 0 .
Similarly, it is easy to get
X T ( k d ( k ) ) I ¯ ¯ T φ 1 θ 2 i I ¯ ¯ X ( k d ( k ) ) + 2 X T ( k d ( k ) ) I ¯ ¯ T 1 2 φ 2 θ 2 i g ( I ¯ ¯ X ( k ) ) g T ( I ¯ ¯ X ( k d ( k ) ) ) θ 2 i g ( I ¯ ¯ X ( k d ( k ) ) ) 0 .
For
2 η T ( k ) T 3 i T [ A ¯ ¯ 1 i X ( k ) + B ¯ ¯ i g ( I ¯ ¯ X ( k ) ) + C ¯ ¯ i g ( I ¯ ¯ X ( k d ( k ) ) ) S ¯ ¯ c 1 i y ¯ ( k ) X ( k ) η ( k ) ] = 0 ,
then
2 X T ( k ) ( A ¯ ¯ 1 i T T 3 i T 3 i ) η ( k ) + 2 g T ( I ¯ ¯ X ( k ) ) B ¯ ¯ i T T 3 i η ( k ) + 2 g T ( I ¯ ¯ X ( k d ( k ) ) ) C ¯ ¯ i T T 3 i η ( k ) 2 y ¯ T ( k ) S ¯ ¯ c 1 i T T 3 i η ( k ) 2 η T ( k ) T 3 i η ( k ) = 0 .
Considering (18), we can have
α y T ( k ) y ( k ) y ¯ T ( k ) y ¯ ( k ) = α X T ( k ) A 02 i T A 02 i X ( k ) y ¯ T ( k ) y ¯ ( k ) > 0 ,
with A 02 i = 0 A 2 i .
Combined with (A1)–(A12), it has
E { Δ V ( X ( k ) ) } ζ T ( k ) Σ ¯ ζ ( k ) + ( d ¯ d ̲ ) ζ T ( k ) [ T 1 i R 3 i 1 T 1 i T + T 2 i R 3 i 1 T 2 i T ] ζ ( k ) < 0 ,
in which
Σ ¯ = Σ ¯ 1 Σ ¯ 2 Σ ¯ 3 Σ ¯ 4 Σ ¯ 5 Σ 55 , Σ ¯ 1 = Σ ¯ 11 Σ 12 Σ ¯ 13 Σ 22 Σ 23 Σ ¯ 33 , Σ ¯ 2 = Σ ¯ 21 0 Σ ¯ 22 , Σ ¯ 33 = B ¯ ¯ i T P ˇ j B ¯ ¯ i θ 1 i B ¯ ¯ i T P ˇ j C ¯ ¯ i C ¯ ¯ i T P ˇ j C ¯ ¯ i θ 2 i , Σ ¯ 11 = A ¯ ¯ 1 i T P ˇ j A ¯ ¯ 1 i P i + R 1 i + R 2 i R 4 i I ¯ ¯ T φ 1 θ 1 i I ¯ ¯ + α A 02 i T A 02 i , Σ ¯ 21 = A ¯ ¯ 1 i T P ˇ j S ¯ ¯ c 1 i , Σ ¯ 13 = I ¯ ¯ T φ 2 2 θ 1 i + A ¯ ¯ 1 i T P ˇ j B ¯ ¯ i A ¯ ¯ 1 i T P ˇ j C ¯ ¯ i , Σ ¯ 22 = ( B ¯ ¯ i T P ˇ j S ¯ ¯ c 1 i ) ( C ¯ ¯ i T P ˇ j S ¯ ¯ c 1 i ) , Σ ¯ 3 = ( A ¯ ¯ 1 i T T 3 i T 3 i ) T 0 Σ 341 , Σ ¯ 4 = S ¯ ¯ c 1 i T P ˇ j S ¯ ¯ c 1 i I , Σ ¯ 5 = S ¯ ¯ c 1 i T T 3 i T 3 i T .
We set P i = R 1 2 P i R 1 2 , then
E { V ( X ( k ) ) } < E { V ( X ( 0 ) ) } E { X T ( 0 ) P i X ( 0 ) } = E { X T ( 0 ) R 1 2 P i R 1 2 X ( 0 ) } sup λ max ( P i ) E { X T ( 0 ) R X ( 0 ) } .
Notice that E { X 0 T R X 0 } < ρ 1 , it has
E { V ( X ( k ) ) } < sup λ max ( P i ) ρ 1 .
Based on (30) and (31), we have
E { V ( X ( k ) ) } > E { X T ( k ) P i X ( k ) } = E { X T ( k ) R 1 2 P i R 1 2 X ( k ) } inf λ min ( P i ) E { X T ( k ) R X ( k ) } .
Based on (32), it has
E { X T ( k ) R X ( k ) } < sup λ max ( P i ) ρ 1 inf λ max ( P i ) < λ ¯ ρ 1 λ ̲ < ρ 2 .
So system (25) without ω ¯ ( k ) is stochastically fault-tolerant synchronized within finite time.
In the following, we analyse the strict ( U 1 i , U 2 i , U 3 i ) - γ -dissipativity of system (25) and (26) with ω ¯ 0 .
We define
J ( k ) = E { Δ V ( X ( k ) ) [ Y T ( k ) U 1 i Y ( k ) + 2 Y T ( k ) U 2 i ω ¯ ( k ) + ω ¯ T ( k ) ( U 3 i γ I ) ω ¯ ( k ) ] } ,
then
J ( k ) [ A ¯ ¯ 1 i X ( k ) + B ¯ ¯ i g ( I ¯ ¯ X ( k ) ) + C ¯ ¯ i g ( I ¯ ¯ X ( k d ( k ) ) ) S ¯ ¯ c 1 i y ¯ ( k ) + E i ω ¯ ( k ) ] T P ˇ j [ A ¯ ¯ 1 i X ( k ) + B ¯ ¯ i g ( I ¯ ¯ X ( k ) ) + C ¯ ¯ i g ( I ¯ ¯ X ( k d ( k ) ) ) S ¯ ¯ c 1 i y ¯ ( k ) + E i ω ¯ ( k ) ] + X T ( k ) ( R 1 i + R 2 i ) X T ( k ) X T ( k d ̲ ) R 1 i X ( k d ̲ ) X T ( k d ¯ ) R 1 i X ( k d ¯ ) + η T ( k ) [ d ¯ d ̲ ) R 3 i + d 1 2 R 4 i ] η ( k ) t = k d ¯ + 1 k d ̲ η T ( t ) R 3 i η ( t ) d ̲ t = k d ̲ k 1 η T ( t ) R 4 i η ( t ) [ Y T ( k ) U 1 i Y ( k ) + 2 Y T ( k ) U 2 i ω ¯ ( k ) + ω ¯ T ( k ) ( U 3 i γ I ) ω ¯ ( k ) ] .
When ω ¯ ( k ) 0 , it has
2 X T ( k ) ( A ¯ ¯ 1 i T T 3 i T 3 i ) η ( k ) + 2 g T ( I ¯ ¯ X ( k ) ) B ¯ ¯ i T T 3 i η ( k ) + 2 g T ( I ¯ ¯ X ( k d ( k ) ) ) C ¯ ¯ i T T 3 i η ( k ) 2 y ¯ T ( k ) S ¯ ¯ c 1 i T T 3 i η ( k ) + 2 ω ¯ T E ¯ ¯ i T T 3 i η ( k ) + 2 ω ¯ T E ¯ ¯ i T T 3 i η ( k ) 2 η T ( k ) T 3 i η ( k ) = 0 .
Based on (A3)–(A9) and (A20), we have
J ( k ) ζ T ( k ) Σ ¯ ζ ( k ) + ( d 2 d 1 ) ζ T ( k ) [ T 1 i R 3 i 1 T 1 i T + T 2 i R 3 i 1 T 2 i T ] ζ ( k ) + 2 X T ( k ) A 1 i T P ˇ j E ¯ ¯ i ω ¯ ( k ) + 2 y ¯ T S ¯ c 1 i T P ˇ j E ¯ ¯ i ω ¯ ( k ) + 2 g T ( I ¯ ¯ X ( k ) ) B i T P ˇ j E ¯ ¯ i ω ¯ ( k ) + 2 g T ( I ¯ ¯ X ( k d ( k ) ) ) B i T P ˇ j E ¯ ¯ i ω ¯ ( k ) + 2 ω ¯ T E ¯ ¯ i T T 3 i η ( k ) + ω ¯ T ( k ) E ¯ ¯ i T P ˇ j E ¯ ¯ i ω ¯ ( k ) [ Y T ( k ) U 1 i Y ( k ) + 2 Y T ( k ) U 2 i ω ¯ ( k ) + ω ¯ T ( k ) ( U 3 i γ I ) ω ¯ ( k ) ] .
Considering (29), J ( k ) < 0 holds. Thus
E { Δ V ( X ( k ) ) < [ Y T ( k ) U 1 i Y ( k ) + 2 Y T ( k ) U 2 i ω ¯ ( k ) + ω ¯ T ( k ) ( U 3 i γ I ) ω ¯ ( k ) ] .
Summing both side of (A22) from 0 to S 1 , then
E { V ( X ( k ) ) } < E { k = 0 S 1 [ Y T ( k ) U 1 i Y ( k ) + 2 Y T ( k ) U 2 i ω ¯ ( k ) + ω ¯ T ( k ) ( U 3 i γ I ) ω ¯ ( k ) ] } + E { V ( X ( 0 ) ) } .
Hence, system (25) and (26) is strictly ( U 1 i , U 2 i , U 3 i ) - γ -dissipative. That finishes the proof. □

Appendix B

Proof of Theorem 2. 
Because P j 1 in (29) is nonlinear, we multiply left by T 3 i T and right by T 3 i to (29), T 3 i T P ˇ j 1 T 3 i < P ˇ j T 3 i T 3 i T holds based on Lemma 3, where T 3 i = d i a g { I , I , I , I , I , T 3 i , I } . So it has
Σ 11 Σ 12 Σ 13 Σ 14 Σ 15 Σ ˜ 16 0 Σ 22 Σ 23 0 0 0 Σ 27 Σ 33 Σ 34 Σ 35 Σ ˜ 36 0 Σ 44 Σ 45 Σ ˜ 46 0 Σ 55 0 0 Σ ˜ 66 0 Σ 77 < 0 ,
where
Σ ˜ 16 = A ¯ ¯ 1 i T T 3 i , Σ ˜ 46 = T 3 i T S ¯ ¯ c 1 i T 3 i T E ¯ ¯ i T , Σ ˜ 36 = T 3 i T B ¯ ¯ i T 3 i T C ¯ ¯ i T , Σ ˜ 66 = P ˇ j T 3 i T 3 i T .
We define
P i = d i a g { P 1 i , P 2 i } , R = d i a g { R 1 , R 2 } , R 1 i = d i a g { R 11 i , R 12 i } , R 2 i = d i a g { R 21 i , R 22 i } , R 3 i = d i a g { R 31 i , R 32 i } , R 4 i = d i a g { R 41 i , R 42 i } ,
U 1 i = U 11 i U 12 i U 13 i , T 12 i = T 121 i T 122 i T 123 i T 124 i , T 3 i = T 31 i 0 0 T 32 i , U 2 i = U 21 i U 22 i , T 13 i = T 131 i T 132 i T 133 i T 134 i , T 23 i = T 231 i T 232 i T 233 i T 234 i , T 24 i = T 241 i T 242 i T 243 i T 244 i ,
and set H i T = H i T T 31 i , S c 1 i T = S c 1 i T T 32 i , then (33)–(38) hold based on (29)–(32). That finishes the proof. □

References

  1. Zhang, Z.M.; He, Y.; Wu, M.; Wang, Q.G. Exponential synchronization of neural networks with time-varying delays via dynamic intermittent output feedback control. IEEE Trans. Syst. Man Cybern. Syst. 2017, 99, 1–11. [Google Scholar] [CrossRef] [Scilit]
  2. Zhang, H.Y.; Qiu, Z.P.; Xiong, L.L.; Jiang, G.H. Stochastic stability analysis for neutral-type Markov jump neural networks with additive time-varying delays via a new reciprocally convex combination inequality. Int. J. Syst. Sci. 2017, 5, 970–988. [Google Scholar] [CrossRef] [Scilit]
  3. Chen, W.Z.; Dai, M.Z.; Guan, C.X.; Fei, Z.Y. Extended dissipativity of semi-Markov jump neural networks with partly unknown transition rates. Neurocomputing 2021, 423, 601–608. [Google Scholar] [CrossRef] [Scilit]
  4. Wang, Y.; Xia, J.W.; Huang, X.; Zhou, J.P.; Shen, H. Extended disspative synchronization for singularly perturbed semi-Markov jump neural networks with randomly occurring uncertainties. Neurocomputing 2019, 349, 281–289. [Google Scholar] [CrossRef] [Scilit]
  5. Shen, H.; Wang, Y.; Xia, J.W.; Cao, J.D.; Chen, X.Y. Non-fragile mixed passive and H state estimation for singularly perturbed neural networks with semi-Markov jumping parameters. J. Frankl. Inst. 2020, 357, 6352–6369. [Google Scholar] [CrossRef] [Scilit]
  6. Rakkiyappan, R.; Maheswari, K.; Velmurugan, G.; Park, J.H. Event-triggered H state estimation for semi-Markov jumping discrete-time neural networks with quantization. Neural Netw. 2018, 105, 236–248. [Google Scholar] [CrossRef] [Scilit]
  7. Kamenkov, G. On stability of motion over a finite interval of time [in Russian]. J. Appl. Math. Mech. 1953, 17, 529–540. [Google Scholar]
  8. Yang, P.; Ding, Y.; Shen, Z.W.; Feng, K.J. Integral non-singular terminal sliding mode consensus control for multi-agent systems with disturbance and actuator faults based on finite-time observer. Entropy 2022, 24, 1068. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  9. Ju, Y.Y.; Cheng, G.F.; Ding, Z.S. Stochastic H finite-time control for linear neutral semi-Markovian jumping systems under event-triggering scheme. J. Frankl. Inst. 2021, 358, 1529–1552. [Google Scholar] [CrossRef] [Scilit]
  10. Luo, M.H.; Mu, X.W.; Wu, X.H.; Hu, Z.H. Event-triggered non-fragile finite-time H control for semi-Markovian jump systems with actuator saturation. J. Frankl. Inst. 2020, 357, 10626–10647. [Google Scholar] [CrossRef] [Scilit]
  11. Sun, S.X.; Zhang, H.G.; Li, W.H.; Wang, Y.C. Time-varying delay-dependent finite-time boundedness with H performance for Markovian jump neural networks with state and input constraints. Neurocomputing 2021, 423, 419–426. [Google Scholar] [CrossRef] [Scilit]
  12. Shen, H.; Park, J.H.; Wu, Z.G. Finite-time synchronization control for uncertain Markov jump neural networks with input constraints. Nonlinear Dyn. 2014, 77, 1709–1720. [Google Scholar] [CrossRef] [Scilit]
  13. Li, F.; Shen, H.; Chen, M.S.; Kong, Q.K. Non-fragile finite-time l2l state estimation for discrete-time Markov jump neural networks with unreliable communication links. Appl. Math. Comput. 2015, 271, 467–481. [Google Scholar]
  14. Li, F.; Shen, H. Finite-time H synchronization control for semi-Markov jump delayed neural networks with randomly occurring uncertainties. Neurocomputing 2015, 166, 447–454. [Google Scholar] [CrossRef] [Scilit]
  15. Zhang, D.; Cheng, J.; Cao, J.D.; Zhang, D. Finite-time synchronization control for semi-Markov jump neural networks with mode-dependent stochastic parametric uncertainties. Appl. Math. Comput. 2019, 344-345, 230–242. [Google Scholar]
  16. Wang, J.; Ru, T.T.; Shen, H.; Cao, J.D.; Park, J.H. Finite-time L2-L synchronization for semi-Markov jump inertial neural networks using sampled data. IEEE Trans. Netw. Sci. Eng. 2021, 8, 163–173. [Google Scholar] [CrossRef] [Scilit]
  17. Niederlinski, A. A heuristic approach to the design of linear multivariable interacting control systems. Automatica 1971, 7, 691–701. [Google Scholar] [CrossRef] [Scilit]
  18. Liu, L.J.; Lv, J.L.; Lin, H.W.; Zhan, R.D.; Wu, L.M. ADP-based fault-tolerant control with stability guarantee for nonlinear systems. Entropy 2025, 27, 1028. [Google Scholar] [CrossRef] [Scilit]
  19. Zhu, X.D.; Li, W.Q.; Xia, Y.Q. Finite-time fault estimate and fault-tolerant control for discrete-time Markov jump systems with actuator and sensor faults. Int. J. Robust Nonlinear Control 2023, 33, 6233–6249. [Google Scholar] [CrossRef] [Scilit]
  20. Wang, Y.; Xia, J.W.; Wang, Z.; Zhou, J.P.; Shen, H. Reliable consensus control for semi-Markov jump multi-agent systems: A leader following strategy. J. Frankl. Inst. 2019, 356, 3612–3627. [Google Scholar] [CrossRef] [Scilit]
  21. Mu, X.W.; Li, X.; Fang, J.Y.; Wu, X.H. Reliable observer-based finite-time H control for networked nonlinear semi-Markovian jump systems with actuator fault and parameter uncertainties via dynamic event-triggered scheme. Inf. Sci. 2021, 546, 573–595. [Google Scholar] [CrossRef] [Scilit]
  22. Wang, J.; Shen, H. Passivity-based fault-tolerant synchronization control of chaotic neural networks against actuator faults using the semi-Markov jump model approach. Neurocomputing 2014, 143, 51–56. [Google Scholar] [CrossRef] [Scilit]
  23. Zhou, J.P.; Liu, Y.M.; Xia, J.W.; Wang, Z.; Arikd, S. Resilient fault-tolerant anti-synchronization for stochastic delayed reaction-diffusion neural networks with semi-Markov jump parameters. Neural Netw. 2020, 125, 194–204. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  24. Wang, Z.; Liu, Y.; Yu, L.; Liu, X. Exponential stability of delayed recurrent neural networks with Markovian jumping parameters. Phys. Lett. A 2006, 356, 346–352. [Google Scholar] [CrossRef] [Scilit]
  25. Zhu, J.; Yang, G.; Wang, H.; Wang, F. Fault estimation for a class of nonlinear systems based on intermediate estimator. IEEE Trans. Autom. Control 2016, 61, 2518–2524. [Google Scholar] [CrossRef] [Scilit]
  26. Zhu, J.; Yang, G. Robust distributed fault estimation for a network of dynamical systems. IEEE Trans. Control Netw. Syst. 2018, 5, 14–22. [Google Scholar] [CrossRef] [Scilit]
  27. Han, J.; Liu, X.H.; Gao, X.W.; Wei, X.J. Intermediate observer based robust distributed fault estimation for nonlinear multi-agent systems with directed graphs. IEEE Trans. Ind. Inform. 2020, 16, 7426–7436. [Google Scholar] [CrossRef] [Scilit]
  28. Liu, X.X.; Su, X.J.; Shi, P.; Nguang, S.K.; Shen, C. Fault detection filtering for nonlinear switched systems via event-triggered communication approach. Automatica 2019, 101, 365–376. [Google Scholar] [CrossRef] [Scilit]
  29. Zuo, Z.; Liu, Y.; Wang, Y.; Li, H. Finite–time stochastic stability and stabilisation of linear discrete-time Markovian jump systems with partly unknown transition probabilities. IET Control Theory Appl. 2012, 6, 1522–1526. [Google Scholar] [CrossRef] [Scilit]
  30. Shi, P.; Su, X.J.; Li, F.B. Dissipativity-based filtering for fuzzy switched systems with stochastic perturbation. IEEE Trans. Autom. Control 2016, 61, 1694–1699. [Google Scholar] [CrossRef] [Scilit]
  31. Wang, Y.; Xie, L.; Souza, C.E.D. Robust control of a class of uncertain nonlinear systems. Syst. Control Lett. 1992, 19, 139–149. [Google Scholar] [CrossRef] [Scilit]
  32. Gu, K.; Chen, J.; Kharitonov, V.L. Stability of Time-Delay Systems; Springer Science and Business Media: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
  33. Xiong, J.; Lam, J. Stabilization of networked control systems with a logic ZOH. IEEE Trans. Autom. Control 2009, 54, 358–363. [Google Scholar] [CrossRef] [Scilit]
  34. Li, F.B.; Wu, L.G.; Shi, P. Stochastic stability of semi-Markovian jump systems with mode-dependent delays. Int. J. Robust Nonlinear Control 2014, 24, 3317–3330. [Google Scholar] [CrossRef] [Scilit]
Figure 1. Fault f ( k ) and its estimation f ^ ( k ) .
Figure 1. Fault f ( k ) and its estimation f ^ ( k ) .
Entropy 27 01186 g001
Figure 2. Error state x ( 1 , k ) in system (5) and its compensated one.
Figure 2. Error state x ( 1 , k ) in system (5) and its compensated one.
Entropy 27 01186 g002
Figure 3. Error state x ( 2 , k ) in system (5) and its compensated one.
Figure 3. Error state x ( 2 , k ) in system (5) and its compensated one.
Entropy 27 01186 g003
Table 1. The comparison of this scheme with the existing ones.
Table 1. The comparison of this scheme with the existing ones.
ReferenceProblemsPerformance
[6]Event-triggered H state estimation H performance
[22]FTSCPassivity
[23]Resilient fault-tolerant anti-synchronizationNo
This paperFinite-time event-triggered FE, FTSC γ -dissipative
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

Zhu, X.; Wang, Y.; Chen, Y. Finite-Time Dissipative Fault Estimate and Event-Triggered Fault-Tolerant Synchronization Control for Discrete Semi-Markov Jumping Neural Networks. Entropy 2025, 27, 1186. https://doi.org/10.3390/e27121186

AMA Style

Zhu X, Wang Y, Chen Y. Finite-Time Dissipative Fault Estimate and Event-Triggered Fault-Tolerant Synchronization Control for Discrete Semi-Markov Jumping Neural Networks. Entropy. 2025; 27(12):1186. https://doi.org/10.3390/e27121186

Chicago/Turabian Style

Zhu, Xiaodan, Yanjun Wang, and Yu Chen. 2025. "Finite-Time Dissipative Fault Estimate and Event-Triggered Fault-Tolerant Synchronization Control for Discrete Semi-Markov Jumping Neural Networks" Entropy 27, no. 12: 1186. https://doi.org/10.3390/e27121186

APA Style

Zhu, X., Wang, Y., & Chen, Y. (2025). Finite-Time Dissipative Fault Estimate and Event-Triggered Fault-Tolerant Synchronization Control for Discrete Semi-Markov Jumping Neural Networks. Entropy, 27(12), 1186. https://doi.org/10.3390/e27121186

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