Next Article in Journal
Fractal Feature of Manufactured Sand Ultra-High-Performance Concrete (UHPC) Based on MIP
Previous Article in Journal
Quantum Dynamics in a Comb Geometry: Green Function Solutions with Nonlocal and Fractional Potentials
Previous Article in Special Issue
Hyperbolic Sine Function Control-Based Finite-Time Bipartite Synchronization of Fractional-Order Spatiotemporal Networks and Its Application in Image Encryption
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Nonfragile State Estimator Design for Memristor-Based Fractional-Order Neural Networks with Randomly Occurring Hybrid Time Delays and Stochastic Cyber-Attacks

1
School of Physics and Telecommunication Engineering, Zhoukou Normal University, Zhoukou 466001, China
2
School of Mechanical and Electrical Engineering, Zhoukou Normal University, Zhoukou 466001, China
3
School of Automation, Nanjing University of Science and Technology, Nanjing 210094, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2025, 9(7), 447; https://doi.org/10.3390/fractalfract9070447
Submission received: 26 May 2025 / Revised: 30 June 2025 / Accepted: 2 July 2025 / Published: 4 July 2025

Abstract

This paper addresses the design of nonfragile state estimators for memristor-based fractional-order neural networks that are subject to stochastic cyber-attacks and hybrid time delays. To mitigate the issue of limited bandwidth during signal transmission, quantitative processing is introduced to reduce network burden and prevent signal blocking. In real network environments, the outputs may be compromised by cyber-attacks, which can disrupt data transmission systems. To better reflect the actual conditions of fractional-order neural networks, a Bernoulli variable is utilized to describe the statistical properties. Additionally, novel conditions are presented to ensure the stochastic asymptotic stability of the augmented error system through a new fractional-order free-matrix-based integral inequality. Finally, the effectiveness of the proposed estimation methods is demonstrated through two numerical simulations.

1. Introduction

It is widely recognized that fractional-order calculus (FOC) can be considered an extension of traditional integer-order calculus. It is important to note that the previous outstanding results for FOC have primarily been involved in theoretical research [1,2]. Until 1960, FOC was gradually being applied to various fields, such as mechanics, science, and biology [3,4,5,6]. Owing to the properties of infinite memory and heredity, FOC can describe real phenomena more accurately than integer-order calculus [1,7]. In recent decades, the system models described by FOC have attracted considerable research attention, and a great many results of synchronization and stability analysis have become available [8,9]. In [10], the authors investigated the design of an adaptive sliding mode controller for fractional-order singular systems with parameter uncertainties, utilizing both state and output feedback. Furthermore, event-triggered synchronization control based on sampled data for fractional complex networks with time-varying delays has been investigated [11], and a more general class of network structures has been taken into consideration.
Over the past few decades, neural networks (NNs) have garnered significant attention due to their diverse applications in various real-world contexts, including target tracking, signal processing, pinning control, and other scientific domains [12,13,14]. For these applications, it is essential to first verify the stability of NNs. This verification is crucial, as most of these applications primarily depend on the dynamic behavior of equilibrium points [15]. Notably, fractional-order derivatives are well suited to describing various materials and dynamical processes due to their memory and hereditary properties. Consequently, fractional-order derivatives are frequently employed to characterize different types of systems across multiple fields. To enhance understanding of the dynamical behavior of neurons, fractional-order neural networks (FONNs), which integrate fractional calculus with NNs, have been proposed.
It is well known that the state information of neurons plays a crucial role in the extensive application of NNs. However, NNs are constructed using large-scale integrated circuits. Given the constraints of limited measurement resources, it is challenging to directly obtain the state information of all neurons [14]. Therefore, investigating the state estimation (SE) problem of NNs is essential for addressing various real-world applications. In neural network circuit systems, the limited switching speed of amplifiers and the restricted speed of signal transmission result in inevitable time delays within these systems. The issue of SE for delayed NNs was first introduced in [16]. It is noteworthy that Chua first proposed the concept of the memristor in 1971 [17], and the initial memristor component was fabricated by HP Labs (shown in Figure 1). Distinct from traditional resistors, memristors reduce energy consumption, enhance operational speeds, and decrease memory space requirements. Therefore, memristors are frequently utilized in various complex systems, particularly within NNs. In [18], the issue of state estimation for memristor-based FONNs with time delays is addressed. By employing fractional-order Lyapunov methods, the authors present stability conditions that guarantee asymptotic stability. However, the results are delay-independent and exhibit a higher degree of conservatism. In [19], the author addresses the issue of event-based SE for FONNs with external disturbances. A delay- and order-dependent condition is provided to ensure the existence of a fractional-order state estimator. However, this criterion does not actually depend on delay or order, indicating that the condition is excessively conservative.
On the other hand, the performance of the estimator may be adversely affected by fluctuations resulting from variable environments, leading to fragility of the estimator. Therefore, it is essential to design a robust nonfragile state estimator for memristor-based FONNs. Currently, numerous design studies have concentrated on nonfragile estimators in integer-order systems. However, there is a relative scarcity of research addressing the issue of nonfragile SE in fractional systems. The nonfragile SE problem for memristor-based FONNs was examined with and without time delays in [18]. It is noteworthy that the results derived in [18] are delay-independent, indicating that the conditions may be overly conservative. Additionally, quantitative processing is often employed to conserve network resources in practice due to finite bandwidth limitations. In [21], the authors explore the synchronization issue of memristor-based FONNs with time delays through quantized control. Despite this, there are few studies focused on designing a fractional-order nonfragile estimator for memristor-based FONNs, which serves as the motivation for our research.
Time delays (TDs) are commonly observed in most physical systems, particularly in neural network circuit systems, due to the switching speed limitations of amplifiers [22]. The presence of TDs can result from oscillations and instabilities within NNs. Therefore, it is essential to take TDs into consideration when examining the dynamical behavior of NNs. In real-world environments, time delays may occur probabilistically, called randomly occurring time-varying delays (ROTVDs). This phenomenon has garnered significant attention from researchers. For example, the authors address the issue of resilient proportional-integral observers for Markov memristor-based neural networks (NNs) with sensor saturation and ROTVDs in [23]. The problem of partial-neuron-based state estimation for delayed NNs is addressed in [24]. To the best of our knowledge, there is limited research on fractional-order systems with ROTVDs, particularly in the context of NNs. Motivated by these considerations, our objective is to investigate the design of nonfragile state estimators for a class of memristor-based FONNs that are subject to ROTVDs and stochastic cyber-attacks. The key advantages of our investigation are outlined as follows:
(1)
The issue of nonfragile state estimator design for memristor-based FONNs is investigated subject to hybrid ROTVDs and stochastic cyber-attacks.
(2)
The traditional Lyapunov–Krasovskii functions (LKFs), which include derivative terms, are not suitable for fractional-order systems. In this paper, we construct several novel LKFs which contain fractional integral terms and time delay information. This approach implies that the results presented in this paper exhibit reduced conservatism.
(3)
Combining fractional-order Lyapunov approaches and a novel free-matrix-based integral inequality, several delay- and order-dependent criteria are derived to guarantee the asymptotic stability of the augmented system.
(4)
Due to the finite bandwidth and complex environment, a kind of fractional-order quantized nonfragile state estimator is developed for memristor-based FONNs. Finally, some numerical examples are shown to validate the usefulness of the proposed estimation algorithm.

2. Problem Formulation and Preliminaries

Definition 1
([25]). For the function h ( t ) , the fractional integral operator is defined as
I β h ( t ) = 1 Γ ( β ) a t ( t x ) β 1 h ( x ) d x , β R +
where t a and the Gamma function Γ ( z ) = a e t t z 1 d t .
Definition 2
([25]). Caputo’s derivative for function h ( t ) is
D t β a C h ( t ) = 1 Γ ( l β ) a t ( t x ) l β 1 h ( l ) ( x ) d x ,
where t a , and β ( l 1 , l ) , h ( t ) C k ( [ a , ) , R ) .
Let us consider the following memristor-based FONN models with time-varying delays:
D t β t 0 C ζ i ( t ) = c i ( ζ i ( t ) ) ζ i ( t ) + j = 1 n a i j ( ζ j ( t ) ) f j ( ζ j ( t ) ) + ϱ ( t ) j = 1 n b i j ( ζ j ( t ) ) f j ( ζ j ( t ρ ( t ) ) ) + δ ( t ) j = 1 n e i j ( ζ j ( t ) ) t d ( t ) t f j ( ζ j ( s ) ) d s , ζ i ( t 0 ) = φ ˜ i ( t 0 ) , t 0 [ ρ ¯ , 0 ] , ρ ¯ = max ρ , d ,
where the system order 0 < β < 1 , ζ i ( t ) is the ith neuron state; f j ( · ) is the activation function; and ρ ( t ) and d ( t ) stand for the time-varying delays, and satisfy
0 ρ ( t ) ρ , 0 d ( t ) d , ρ ˙ ( t ) ρ ¯ < 1
in which ρ and d are known constants. c ( ζ ( t ) ) is the state feedback positive matrix, and the connection weights a i j ( ζ j ( t ) ) , b i j ( ζ j ( t ) ) and e i j ( ζ j ( t ) ) can be described as
c i ( ζ i ( t ) ) = 1 C ˜ i j = 1 n ( W i j a + W i j b + W i j e ) × sgn i j + 1 R i , a i j ( ζ j ( t ) ) = W i j a C ˜ i × sgn i j , b i j ( ζ j ( t ) ) = W i j b C ˜ i × sgn i j , e i j ( ζ j ( t ) ) = W i j e C ˜ i × sgn i j ,
in which W i j a , W i j b , W i j e are the memductances of memristors F a i j , F a i j satisfying W i j a = 1 F a i j , W i j b = 1 F b i j , W i j e = 1 F e i j , and C ˜ i represents the capacitor. sgn i j = 1 if i j ; otherwise, it is 1 . Based on the characteristics of d i ( ζ i ( t ) ) , a i j ( ζ j ( t ) ) , b i j ( ζ j ( t ) ) , e i j ( ζ j ( t ) ) , we can obtain
c i ( ζ i ( t ) ) = c i , | ζ i ( t ) | T i , c i , | ζ i ( t ) | > T i , a i j ( ζ j ( t ) ) = a i j , | ζ j ( t ) | T i , a i j , | ζ j ( t ) | > T i , b i j ( ζ j ( t ) ) = b i j , | ζ j ( t ) | T i , b i j , | ζ j ( t ) | > T i , e i j ( ζ j ( t ) ) = e i j , | ζ j ( t ) | T i , e i j , | ζ j ( t ) | > T i ,
For the sake of simplicity, the following can be denoted:
ζ ( t ) ζ 1 ( t ) , ζ 2 ( t ) , , ζ n ( t ) T , f ( ζ ( t ) ) f 1 ( ζ 1 ( t ) ) , f 2 ( ζ 2 ( t ) ) , , f n ( ζ n ( t ) ) T , C ( ζ ( t ) ) diag c 1 ( ζ 1 ( t ) ) , c 2 ( ζ 2 ( t ) ) , , c n ( ζ n ( t ) ) , A ( ζ ( t ) ) a i j ( ζ i ( t ) ) n × n , B ( ζ ( t ) ) b i j ( ζ i ( t ) ) n × n , E ( ζ ( t ) ) e i j ( ζ i ( t ) ) n × n .
Then, the compact form of (1) is as follows:
D t β t 0 C ζ ( t ) = C ( ζ ( t ) ) ζ ( t ) + A ( ζ ( t ) ) f ( ζ ( t ) ) + ϱ ( t ) B ( ζ ( t ) ) f ( ζ ( t ρ ( t ) ) ) + δ ( t ) E ( ζ ( t ) ) t d ( t ) t f ( ζ ( s ) ) d s .
Then, let
C ̲ = diag c ̲ 1 , c ̲ 2 , , c ̲ n , C ¯ = diag c ¯ 1 , c ¯ 2 , , c ¯ n , A ̲ = a ̲ i j n × n , A ¯ = a ¯ i j n × n , a ̲ i j = min a i j , a i j , a ¯ i j = max a i j , a i j , B ̲ = b ̲ i j n × n , B ¯ = b ¯ i j n × n , b ̲ i j = min b i j , b i j , b ¯ i j = max b i j , b i j , E ̲ = b ̲ i j n × n , E ¯ = b ¯ i j n × n , e ̲ i j = min e i j , e i j , e ¯ i j = max e i j , e i j , c ̲ i = min c i , c i , c ¯ i = max c i , c i .
Based on the description provided above, it can be derived that C ( ζ ( t ) ) [ C ̲ , C ¯ ] , A ( ζ ( t ) ) [ A ̲ , A ¯ ] , B ( ζ ( t ) ) [ B ̲ , B ¯ ] , E ( ζ ( t ) ) [ E ̲ , E ¯ ] .
For the convenience of analysis, we define
C C ¯ + C ̲ 2 = diag c ¯ 1 + c ̲ 1 2 , c ¯ 2 + c ̲ 2 2 , , c ¯ n + c ̲ n 2 , A A ¯ + A ̲ 2 = a ¯ i j + a ̲ i j 2 n × n , B B ¯ + B ̲ 2 = b ¯ i j + b ̲ i j 2 n × n .
Next, the memristive connection weights C ( ζ ( t ) ) , A ( ζ ( t ) ) , B ( ζ ( t ) ) and E ( ζ ( t ) ) can be rewritten as
C ( ζ ( t ) ) = C + Δ C ( t ) , A ( ζ ( t ) ) = A + Δ A ( t ) , B ( ζ ( t ) ) = B + Δ B ( t ) , E ( ζ ( t ) ) = E + Δ E ( t ) ,
in which Δ C ( t ) = i = 1 n i ϖ i c ( t ) i T , Δ A ( t ) = i , j = 1 n i ϖ i j a ( t ) j T , Δ B ( t ) = i , j = 1 n i ϖ i j b ( t ) j T , Δ E ( t ) = i , j = 1 n i ϖ i j e ( t ) j T . i R , in which the ith element is equal to 1, and the others are equal to 0; this implies that ϖ i c ( t ) , ϖ i j a ( t ) , ϖ i j b ( t ) , and ϖ i j e ( t ) are unknown, and satisfy | ϖ i c ( t ) | c ˜ i , | ϖ i j a ( t ) | a ˜ i j , | ϖ i j b ( t ) | b ˜ i j , | ϖ i j e ( t ) | e ˜ i j , c ˜ i = c ¯ i c ̲ i 2 , a ˜ i j = a ¯ i j a ̲ i j 2 , b ˜ i j = b ¯ i j b ̲ i j 2 , e ˜ i j = e ¯ i j e ̲ i j 2 .
According to the above analysis, the matrices Δ C ( t ) , Δ A ( t ) , Δ B ( t ) , and Δ E ( t ) can be descried as
Δ C ( t ) , Δ A ( t ) , Δ B ( t ) , Δ E ( t ) = H F ( t ) N ,
where H = H , H , H , H , N = diag N c , N a , N b , N e , F ( t ) = diag F c ( t ) , F a ( t ) , F b ( t ) , F e ( t ) , and
H = H 1 , H 2 , , H n , N c j = 1 T , 2 T , , j 1 T , j T , j + 1 T , , n T , H i = i , i , , i n , N a = N a 1 T , N a 2 T , , N a n T T , N b = N b 1 T , N b 2 T , , N b n T T , N e = N e 1 T , N e 2 T , , N e n T T , N a j = a ˜ j 1 1 T , a ˜ j 2 2 T , , a ˜ j n n T , N b j = b ˜ j 1 1 T , b ˜ j 2 2 T , , b ˜ j n n T , N e j = e ˜ j 1 1 T , e ˜ j 2 2 T , , e ˜ j n n T , F z ( t ) = diag F z 1 ( t ) , F z 2 ( t ) , , F z n ( t ) , F c j ( t ) = diag { 0 , , 0 j 1 , ϖ i c ( t ) c ˜ j 1 , 0 , , 0 n j } , F a j ( t ) = diag ϖ j 1 a ( t ) a ˜ j 1 1 , ϖ j 2 a ( t ) a ˜ j 2 1 , , ϖ j n a ( t ) a ˜ j n 1 , F b j ( t ) = diag ϖ j 1 b ( t ) b ˜ j 1 1 , ϖ j 2 b ( t ) b ˜ j 2 1 , , ϖ j n b ( t ) b ˜ j n 1 F e j ( t ) = diag ϖ j 1 e ( t ) e ˜ j 1 1 , ϖ j 2 e ( t ) e ˜ j 2 1 , , ϖ j n e ( t ) e ˜ j n 1 .
Then, the memristor-based FONN model (2) can be rewritten as
D t β t 0 C ζ ( t ) = ( C + Δ C ) ζ ( t ) + ( A + Δ A ) f ( ζ ( t ) ) + ϱ ( t ) ( B + Δ B ) f ( ζ ( t ρ ( t ) ) ) + δ ( t ) ( E + Δ E ) t d ( t ) t f ( ζ ( s ) ) d s , y ( t ) = D ζ ( t ) ,
where y ( t ) denotes the network measurement outputs and D R m × n represents known constant matrices with appropriate dimensions.
In (1), ϱ ( t ) , δ ( t ) are stochastic variables with Bernoulli distribution. In this paper, the random variables ϱ ( t ) , δ ( t ) are introduced to describe the phenomenon of ROTVDs.
ϱ ( t ) / δ ( t ) = 1 , time-varying delays occur 0 , time-varying delays disappear
which satisfies the following probability distribution:
Pr ϱ ( t ) = 1 = E ϱ ( t ) = ϱ ¯ , Pr ϱ ( t ) = 0 = 1 ϱ ¯ , Pr δ ( t ) = 1 = E δ ( t ) = δ ¯ , Pr δ ( t ) = 0 = 1 δ ¯ ,
where 0 ϱ ¯ 1 , 0 δ ¯ 1 .
Remark 1.
To more accurately reflect reality, two random variables, ϱ ( t ) and δ ( t ) , are utilized in system (1). As a switched system, studying the dynamic behaviors of memristor-based FONNs is challenging due to the state-dependent characteristics of memristive weights. Unlike the existing notable results [15,26,27], this paper transforms memristor-based FONNs (1) into a class of FONNs with parameter uncertainties using some switching functions.
Assumption 1.
For p 1 , p 2 R , the activation function f j ( · ) : R R satisfies the following sector-bounded condition:
f ( p 1 ) f ( p 2 ) F 1 ( p 1 p 2 ) T f ( p 1 ) f ( p 2 ) F 1 ( p 1 p 2 ) 0 ,
where F 1 , F 2 are constants.
In many practical applications, the estimator gain K may experience fluctuations, which may lead to fragility of the designed estimator. Therefore, in this paper, the following nonfragile estimator is constructed to reduce the influences of potential gain perturbations:
D t β t 0 C ζ ^ ( t ) = C ζ ^ ( t ) + A f ( ζ ^ ( t ) ) + ϱ ¯ B f ( ζ ^ ( t ρ ( t ) ) ) + δ ¯ E t d ( t ) t f ( ζ ^ ( s ) ) d s + ( K + Δ K ) ( y ˜ ( t ) y ^ ( t ) ) , y ^ ( t ) = D ζ ^ ( t ) ,
where ζ ^ ( t ) stands for the estimation of ζ ( t ) , and K is the estimator gain to be designed. Δ K signifies the fluctuation with H k F k ( t ) N k , F k T ( t ) F k ( t ) I . In addition, considering the effect of quantization in [28,29], we introduce the quantitative process to save bandwidth, and the logarithmic quantizer Q ( z ) = col Q 1 ( z 1 ) , Q 2 ( z 2 ) , , Q m ( z m ) is employed (shown in Figure 2). In this paper, Q ( z ) is defined as
Q l ( k l ) = v i μ 0 , v i μ 0 1 + ϵ < k l v i μ 0 1 ϵ , i = 0 , ± 1 , ± 2 , 0 ,   k l = 0 , Q l ( k l ) , k l < 0
where v ( 0 , 1 ) is the quantization density, μ 0 > 0 , and ϵ = 1 v 1 + v .
Analogous to the method in [30], Q ( k ) can be described as
y ¯ ( t ) Q ( k ) = ( I + Δ ι ) k ,
where ϵ Δ ι i ϵ .
Remark 2.
In a network control environment, due to the limitations of bandwidth or bit rate, signals need to be quantized before transmission. A quantizer can be regarded as a device that uses the values in a finite set to convert real-valued data into segmented continuous constant data.
Remark 3.
The flow diagram of memristor-based neural network state estimation is presented in Figure 3. As a circuit system, the synaptic voltage and temporal noise associated with transmitter release must be considered, particularly due to the random occurrence of time delays. In this paper, we utilize the network measurement outputs y ( t ) to estimate neural state information. The measurement outputs are transmitted to the network using a logarithmic quantizer. Given the complex network environment, cyber-attacks may occur. When a cyber-attack takes place, the actual data is combined with the attack signal and sent to the state estimator.
The actual input to the state estimator can be described as follows:
y ˜ ( t ) = ( 1 γ ( t ) ) y ¯ ( t ) + γ ( t ) g ( y ( t ) )
where g ( · ) represents cyber-attacks. γ ( t ) is used to describe the occurrence probability of stochastic cyber-attacks, and satisfies
Prob γ ( t ) = 1 = E γ ( t ) = γ ¯ .
Assumption 2.
The nonlinear function g ( y ( t ) ) satisfies the following condition:
g ( y ( t ) ) 2 G y ( t ) 2
where G is a constant matrix representing the upper bound of the nonlinearity.
Next, denote r ( t ) ζ ( t ) ζ ^ ( t ) , f ˜ ( r ( t ) ) f ( ζ ( t ) ) f ( ζ ^ ( t ) ) . Combining (2) and (5)∼(8), the error dynamic can be obtained:
D t β t 0 C r ( t ) = C + K ˜ D r ( t ) + A f ˜ ( r ( t ) ) + Δ A f ( ζ ( t ) ) + ϱ ¯ B f ˜ ( r ( t ρ ( t ) ) ) + ϱ ¯ Δ B f ( ζ ( t ρ ( t ) ) ) + δ ¯ E t d ( t ) t f ˜ ( r ( s ) ) d s + δ ¯ Δ E t d ( t ) t f ( ζ ( s ) ) d s + K ˜ D Δ C ( 1 γ ( t ) ) K ˜ I ˜ D ζ ( t ) γ ( t ) K ˜ g ( D ζ ( t ) ) + ς ( t ) ,
where
ς ( t ) = γ ˜ ( B + Δ B ) f ( ζ ( t ρ ( t ) ) ) + δ ˜ ( t ) ( E + Δ E ) t d ( t ) t f ( ζ ( s ) ) d s , ϱ ˜ ( t ) = ϱ ( t ) ϱ ¯ , δ ˜ ( t ) = δ ( t ) δ ¯ , K ˜ = K + Δ K , I ˜ = I + Δ ι .
Let ν ¯ ( t ) col ζ ( t ) , r ( t ) , φ f ( t ) col f ( t ) , f ˜ ( r ( t ) ) , φ f ( t ρ ( t ) ) col f ( t ρ ( t ) ) , f ˜ ( t ρ ( t ) ) . According to (4) and (10), the augmented system is obtained as
D t β t 0 C ν ¯ ( t ) = C ˜ + γ C ˜ k ν ¯ ( t ) + A ˜ φ f ( t ) + ϱ ¯ B ˜ φ f ( t ρ ( t ) ) γ ¯ K ˜ g ( D ¯ ν ¯ ( t ) ) + δ ¯ E ˜ t d ( t ) t φ f ( s ) d s + ς ˜ ( t ) ,
where
C ˜ = C + Δ C 0 ^ Δ C K ˜ D C + K ˜ D , A ˜ = A + Δ A 0 ^ Δ A A , D ¯ = D T 0 ^ T , B ˜ = B + Δ B 0 ^ Δ B B , E ˜ = E + Δ E 0 ^ Δ E E , B ˜ = B + Δ B 0 ^ B + Δ B 0 ^ , E ˜ = E + Δ E 0 ^ E + Δ E 0 ^ , C k ˜ = 0 ^ 0 ^ K ˜ I ˜ D 0 ^ , K ˜ = 0 ^ K ˜ , γ = 1 γ ¯ , ς ˜ ( t ) = γ ˜ ( t ) C ˜ k ν ¯ ( t ) γ ˜ ( t ) K ˜ g ( D ¯ ν ¯ ( t ) ) + ϱ ˜ ( t ) B ˜ φ f ( t ρ ( t ) ) + δ ˜ ( t ) E ˜ t d ( t ) t φ f ( s ) d s .
Lemma 1
([31]). For the continuous and differential function η ( t ) R n , the following inequation holds:
D t β t 0 C η T ( t ) P η ( t ) 2 η T ( t ) P t 0 C D t β ν ( t ) , β ( 0 , 1 ) .
Lemma 2
([32]). For any matrix O R n × n , a vector ψ : [ ρ , τ ] R + R n is differentiable. There exist matrices L 1 , L 2 R 2 n × n satisfying
I τ β ρ ψ T ( τ ) O ψ ( τ ) ζ T ( ρ , τ ) Sym ( Ω * ) ζ ( ρ , τ ) + ( τ ρ ) β Γ ( β + 1 ) ζ T ( ρ , τ ) Υ O ^ 1 Υ T ζ ( ρ , τ ) ,
where
ζ ( ρ , τ ) = [ x T ( ρ ) , x T ( τ ) , 2 ( τ ρ ) β I τ β ρ x T ( τ ) ] T , Ω * = N 1 w ¯ 1 T + N 2 w ¯ 2 T , N 1 = I 2 I 1 , ψ ( τ ) = D τ β ρ x ( τ ) , N 2 = 1 Γ ( β ) I 3 1 Γ ( 2 β ) I 2 + 1 Γ ( 2 β ) 2 Γ ( β ) Γ ( β + 1 ) I 1 , w ¯ 1 = I 2 I 1 , I 3 2 Γ ( β + 1 ) L 1 , w ¯ 2 = I 2 I 1 , I 3 2 Γ ( β + 1 ) L 2 , I j = 0 n ( j 1 ) n , I , 0 n × ( 3 j ) n T ( j = 1 , 2 , 3 ) , Υ = w ¯ 1 , w ¯ 2 , O ^ = diag O , 3 Γ 2 ( 2 β ) O .
Lemma 3
([33]). For any vector ζ ( t ) : d 1 , d 2 R n , a constant matrix M R n × n , M = M T > 0 , two scalars d 1 , d 2 ( 0 < d 1 < d 2 ) . Then, the following inequality is well defined:
( d 2 d 1 ) d 1 d 2 ζ T ( τ ) M ζ ( τ ) d τ > d 1 d 2 ζ ( τ ) d τ T M d 1 d 2 ζ ( τ ) d τ .
Definition 3
([34]). Consider the fractional-order nonlinear system D β t 0 C ν ( t ) = f ( t , ν ( t ) ) . For any scalars c > 0 , 0 < β < 1 , assume V ( t , ν ( t ) ) and the class- K functions b i ( i = 1 , 2 , 3 ) satisfy
b 1 ( ν ) V ( t , ν ( t ) ) b 2 ( ν ) , D β t 0 C V ( t , ν ( t ) ) b 3 ( ν ) + c t β .
Then, the fractional-order nonlinear system (11) is asymptotically stable.

3. Main Results

In this section, we derive several delay- and order-dependent criteria to ensure the asymptotical stability of the augmented system (11). Several novel Lyapunov–Krasovskii functionals are proposed that incorporate the bounded information of time-varying delays and the order of the system, aiming to reduce conservatism.
For convenience of expression, let
η ¯ ( t ) = η ¯ 1 T ( t ) , η ¯ 2 T ( t ) , , η ¯ n T ( t ) T , η ¯ i ( t ) = : ν ¯ i ( t ) I t β t ρ ϑ i ( t ) , ϑ ( t ) = ϑ 1 T ( t ) , ϑ 2 T ( t ) , , ϑ n T ( t ) T , ϑ i ( t ) = 1 Γ ( 1 β ) t 0 t ρ ( t τ ) β ν ¯ ˙ i ( τ ) d τ , ϑ ˜ ( t ) = : 2 ρ β I t β t ρ ν ¯ ( t ) 2 ρ β I t 2 β t ρ ϑ ( t ) , ϖ ( t ) col { ν ¯ ( t ) , ν ¯ ( t ρ ( t ) ) , ν ¯ ( t ρ ) , φ f ( t ) , φ f ( t ρ ( t ) ) , t d ( t ) t φ f ( s ) d s , g ( D ¯ ν ¯ ( t ) ) , I t β t ρ ϑ ( t ) , ϑ ˜ ( t ) , D t β t 0 ν ¯ ( t ) } , e i = 0 2 n × 2 ( j 1 ) n , I 2 n , 0 2 n × 2 ( 10 j ) n T , j = 1 , 2 , , 10 .
Theorem 1.
Let the estimator gain matrix K and Δ K be given; Assumption 1 holds. For the given positive scalars ρ, γ ¯ , ϱ ¯ and ρ ¯ , the augmented system (11) is stochastically asymptotically stable if there exist positive definite matrices P R 2 n × 2 n , Q 1 R 2 n × 2 n , Q 2 R 2 n × 2 n , O R 2 n × 2 n , M R 4 n × 4 n , and any matrices W 1 R 4 n × 2 n , W 2 R 4 n × 2 n and scalars κ 1 > 0 , κ 2 > 0 , such that
˜ = Ξ Γ ( β + 1 ) ρ β Y ˜ < 0 ^ ,
where
= Θ 1 + Θ 2 + Π 1 + Π 2 + Υ 1 + Υ 2 + Λ + Ψ + Sym 1 Ω 1 T + 2 Ω 2 T , Θ 1 = e 10 P e 1 T + e 1 P e 11 T , Θ 2 = e 1 Q 1 e 1 T e 3 Q 2 e 3 T ( 1 ρ ¯ ) e 2 ( Q 1 Q 2 ) e 2 T , Y ˜ = Y 0 0 3 Γ 2 ( 2 β ) Y , Θ 4 = e 1 e 4 M e 1 e 4 T ( 1 ρ ¯ ) e 2 e 5 M e 2 e 5 T , 1 = e 1 e 8 e 3 , 2 = e 8 Γ ( β ) e 1 e 8 Γ ( 2 β ) + 1 Γ ( 2 β ) 2 Γ ( β ) Γ ( β + 1 ) e 3 , Ω 1 = e 1 e 8 e 3 , e 9 2 Γ ( β + 1 ) e 3 W 1 , Ω 2 = e 1 e 8 e 3 , e 9 2 Γ ( β + 1 ) e 3 W 2 , Ψ = ρ β Γ ( β + 1 ) e 10 Y e 10 , Π 1 = κ 1 e 1 J 1 e 1 T + 2 κ 1 e 1 J 2 e 4 T κ 1 e 4 I e 4 T , Λ = Sym e 1 W 1 + e 10 W 2 , Π 2 = κ 2 e 2 J 1 e 2 T + 2 κ 2 e 2 J 2 e 5 T κ 2 e 5 I e 5 T , Ξ = Ω 1 , Ω 2 , Υ 1 = e 1 D ¯ T G T G D ¯ e 1 T e 7 I e 7 T , Υ 2 = d 2 e 4 R e 4 T e 6 R e 6 T , = e 10 T ( C ˜ + γ C ˜ k ) e 1 T + A ˜ e 4 T + ϱ ¯ B ˜ e 5 T + δ ¯ E ˜ e 6 T γ ¯ K ˜ e 7 T , J 1 = diag I F 1 T F 2 + F 2 T F 1 2 , J 2 = diag I F 1 T + F 2 T 2 .
Proof. 
Choose the following LKFs:
V ( t , ν ¯ ( t ) ) = h = 1 5 V h ( t , ν ¯ ( t ) ) ,
where
V 1 ( t , ν ¯ ( t ) ) = D t ( 1 β ) t 0 C ν ¯ ( t ) T P ν ¯ ( t ) , V 2 ( t , ν ¯ ( t ) ) = t ρ ( t ) t η 0 T ( τ ) M η 0 ( τ ) d τ , V 3 ( t , ν ¯ ( t ) ) = t ρ ( t ) t ν ¯ T ( τ ) Q 1 ν ¯ ( τ ) d τ + t ρ t ρ ( t ) ν ¯ T ( τ ) Q 2 ν ¯ ( τ ) d τ , V 4 ( t , ν ¯ ( t ) ) = 1 Γ ( β ) ρ 0 θ β 1 t + θ t V * ( τ ) d τ d θ , V 5 ( t , ν ¯ ( t ) ) = d d 0 t + θ t φ f ( τ ) T R φ f ( τ ) d τ d θ .
with η 0 ( t ) ν ¯ T ( t ) , φ f T ( t ) T , V * ( t ) = D t β t 0 C ν ¯ ( t ) T Y D t β t 0 C ν ¯ ( t ) .
Define the infinitesimal operator L of V ( t , ν ¯ ( t ) ) [35] as follows:
L V ( t , ν ¯ ( t ) ) = lim ε 0 + 1 ε E V ( t + ε , ν ¯ ( t + ε ) ) | ( t , ν ¯ ( t ) ) V ( t , ν ¯ ( t ) ) .
According to Lemma 1,
E L V 1 ( t , ν ¯ ( t ) ) E { D t β t 0 C ν ¯ ( t ) T P ν ¯ ( t ) + ν ¯ T ( t ) P D t β t 0 C ν ¯ ( t ) + ν ¯ T ( t 0 ) P ν ¯ ( t 0 ) Γ ( 1 β ) t β } ,
E L V 2 ( t , ν ¯ ( t ) ) = E η 0 T ( t ) M η 0 ( t ) ( 1 ρ ˙ ( t ) ) η 0 T ( t ρ ( t ) ) M η 0 ( t ρ ( t ) ) E η 0 T ( t ) M η 0 ( t ) ( 1 ρ ¯ ) η 0 T ( t ρ ( t ) ) M η 0 ( t ρ ( t ) ) ,
E L V 3 ( t , ν ¯ ( t ) ) = E { ν ¯ T ( t ) Q 1 ν ¯ ( t ) ν ¯ T ( t ρ ) Q 2 ν ¯ ( t ρ ) ( 1 ρ ˙ ( t ) ) ν ¯ T ( t ρ ( t ) ) Q 1 Q 2 ν ¯ ( t ρ ( t ) ) } E { ν ¯ T ( t ) Q 1 ν ¯ ( t ) ν ¯ T ( t ρ ) Q 2 ν ¯ ( t ρ ) ( 1 ρ ¯ ) ν ¯ T ( t ρ ( t ) ) Q 1 Q 2 ν ¯ ( t ρ ( t ) ) } .
As stated by Lemma 2, one has
E L V 4 ( t , ν ¯ ( t ) ) = E { 1 Γ ( β ) ρ 0 ( θ ) β 1 D t β t 0 C ν ¯ ( t ) T Y D t β t 0 C ν ¯ ( t ) d θ 1 Γ ( β ) ρ 0 ( θ ) β 1 D t + θ β t 0 C ν ¯ ( t + θ ) T Y D t + θ β t 0 C ν ¯ ( t + θ ) d θ } = E { ρ β Γ ( β + 1 ) D t β t 0 C ν ¯ ( t ) T Y D t β t 0 C ν ¯ ( t ) 1 Γ ( β ) t ρ t t μ β 1 D μ β t 0 C ν ¯ ( μ ) T Y D μ β t 0 C ν ¯ ( μ ) d μ } .
In accordance with the Definition 1 and Lemma 2, one gets
1 Γ ( β ) t ρ t t μ β 1 D μ β t 0 C ν ¯ ( μ ) T Y D μ β t 0 C ν ¯ ( μ ) d μ = 1 Γ ( β ) t ρ t t μ β 1 D μ β t ρ η ¯ ( μ ) T Y D μ β t ρ η ¯ ( μ ) d μ ϖ T ( t ) Υ Y ˜ 1 Υ T Γ ( β + 1 ) ρ β ϖ ( t ) + ϖ T ( t ) Sym 1 Υ 1 T + 2 Υ 2 T ϖ ( t ) .
On the basis of Lemma 3, we have
E L V 5 ( t , ν ¯ ( t ) ) = E d d 0 φ f T ( τ ) R φ f ( τ ) d τ d d 0 φ f T ( t + τ ) R φ f ( t + τ ) d τ = E d 2 φ f T ( t ) R φ f ( t ) d t d t φ f T ( τ ) R φ f ( τ ) d τ E d 2 φ f T ( t ) R φ f ( t ) t d ( t ) t φ f T ( τ ) d τ R t d ( t ) t φ f ( τ ) d τ .
According to the Assumption 1, the following inequation can be inferred:
ν ¯ ( t ) φ f ( t ) T J 1 J 2 I ν ¯ ( t ) φ f ( t ) 0 ^ ,
ν ¯ ( t ρ ( t ) ) φ f ( t ρ ( t ) ) T J 1 J 2 I ν ¯ ( t ρ ( t ) ) φ f ( t ρ ( t ) ) 0 ^ .
  From Assumption (2), which is the limited condition of cyber-attacks, we can get
ν ¯ T ( t ) D ¯ T G T G D ¯ ν ¯ ( t ) g T ( D ¯ ν ¯ ( t ) ) g ( D ¯ ν ¯ ( t ) ) 0 ^
For any matrices W 1 and W 2 , integrating the augmented system (11), we have
0 ^ = E { 2 ν ¯ T ( t ) W 1 + D t β t 0 C ν ¯ T ( t ) W 2 [ D t β t 0 C ν ¯ ( t ) C ˜ + γ C k ˜ ν ¯ ( t ) + A ˜ φ f ( t ) + ϱ ¯ B ˜ φ f ( t ρ ( t ) ) + δ ¯ E ˜ t d ( t ) t φ f ( s ) d s γ ¯ K ˜ g ( D ¯ ν ¯ ( t ) ) + ς ˜ ( t ) ] } .
Combining (14)∼(23), when (12) holds, one gets
E L V ( t , ν ¯ ( t ) ) E ϖ T ( t ) + ρ β Γ ( β + 1 ) Ξ Y ˜ 1 Ξ T ϖ ( t ) + ν ¯ T ( t 0 ) P ν ¯ ( t 0 ) Γ ( 1 β ) t β λ min ( ˜ ) ν ¯ T ( t ) ν ¯ ( t ) + ν ¯ T ( t 0 ) P ν ¯ ( t 0 ) Γ ( 1 β ) t β .
According to Definition 3, it can be inferred that lim t E ν ¯ ( t ) 2 = 0 . Then, the augmented system (11) is stochastically asymptotically stable.    □
Remark 4.
So far, numerous excellent results regarding the stability of delayed FONNs can be obtained [7,15,26,29,36,37]. However, most of these significant findings are delay-independent. The stability criterion proposed in this paper depends not only on the time-varying delay information, but also on the system order β. This is to say, by adjusting the bounded information of time-varying delays and the order β of the neural network systems, the feasible domain of the stability criterion can be effectively improved and have less conservatism.
In what follows, the estimator design for the memristor-based FONNs (1) based on the conclusion of Theorem 1 will be detailed.
Theorem 2.
For given positive sclars ρ, γ ¯ , ϱ ¯ , and ρ ¯ , the augmented system (11) is stochastically asymptotically stable if there exist positive definite matrices P R 2 n × 2 n , Q 1 R 2 n × 2 n , Q 2 R 2 n × 2 n , O R 2 n × 2 n , M R 4 n × 4 n , and any matrices W 1 R 4 n × 2 n , W 2 R 4 n × 2 n , W = diag V 1 , V 2 and scalars κ 1 > 0 , κ 2 > 0 , u > 0 , t > 0 , s > 0 and r > 0 satisfying the following LMIs:
¯ Ξ ð 1 Γ ( β + 1 ) ρ β Y ˜ 0 ^ ð 2 < 0 ^ ,
where
¯ = Θ 1 + Θ 2 + Π 1 + Π 2 + Υ 1 + Υ 2 + Ψ + Sym 1 Ω 1 T + 2 Ω 2 T + Λ ¯ , Λ ¯ = Sym { e 1 W e 10 T e 1 C e 1 T γ e 1 C k e 1 T + e 1 A ¯ e 4 T + ϱ ¯ e 1 W B ¯ e 5 T + δ ¯ e 1 W E ¯ e 6 T γ ¯ e 1 K e 7 T μ ˜ e 10 W e 10 T μ ˜ e 10 C e 1 T μ ˜ γ e 10 C k e 1 T + μ ˜ e 10 A ¯ e 4 T + μ ˜ ϱ ¯ e 10 W B ¯ e 5 T + μ ˜ δ ¯ e 10 W E ¯ e 6 T μ ˜ γ ¯ e 10 K e 7 T } , ð 1 = γ ϝ K , ϵ u e 1 N ¯ d T , ϝ W H ˜ k , ϵ t e 1 N ¯ k T , H ˜ , r N ˜ T , ϝ H ˜ k , s N ˜ k T , s ˜ = diag s , s , ð 2 = diag u ˜ I , t ˜ I , r ˜ I , s ˜ I , u ˜ = diag u , u , t ˜ = diag t , t , r ˜ = diag r , r , C k = 0 ^ 0 ^ X D 0 ^ , C = V 1 C 0 ^ X D V 2 C + X D , , K = 0 ^ X .
Other terms Θ j , Π j , Υ j ( j = 1 , 2 ) , Ψ , Y ˜ , Ξ have been defined in Theorem 1. If ( P , Q 1 , Q 2 , O , R , W , u , t , s , r , κ 1 , κ 2 ) are a set of feasible solutions of (25), Algorithm 1 shows the process of calculating the developed estimator gain K . Then, the estimator gain matrix K in (5) can be designed as
K = V 2 1 X .
Algorithm 1 Estimator Gain K
Step i:  
Supply the system parameters for memristor-based FONNs (1) and (5).
Step ii: 
Set the constants ρ ¯ , d , δ ¯ , ρ
Step iii:
By means of the Matlab LMI Toolbox and the parameters in Step i and ii, seek the feasible solution of (25). If the feasible solutions can not find, return to Step i and ii and reset the correlation parameters.
Step iv:
According to the feasible solutions and the setting X = V 2 K , calculate the estimator gain K .
Proof. 
First, define X ( t ) ν ¯ T ( t ) t 0 D t β ν ¯ ( t ) T T , W = diag V 1 , V 2 , in which W = W 1 , W 2 = μ ˜ W ( μ ˜ > 0 ) and W is a non-singular matrix. Then, (23) can be rewritten as
0 ^ = E { 2 X T ( t ) W [ D t β t 0 C ν ¯ ( t ) C ¯ + γ C ¯ k ν ¯ ( t ) + A ¯ φ f ( t ) + ϱ ¯ B ¯ φ f ( t ρ ( t ) ) + δ ¯ E ¯ t d ( t ) t φ f ( s ) d s H ˜ k F k ( t ) N ˜ k ν ¯ ( t ) γ ¯ K ¯ g ( D ¯ ν ¯ ( t ) ) + ς ˜ ( t ) γ H ˜ k F k ( t ) N ¯ k ν ¯ ( t ) + H ˜ F ˜ a ( t ) N ˜ a φ f ( t ) + H ˜ F ˜ b ( t ) N ˜ b φ f ( t ρ ( t ) ) γ ¯ H ˜ k F k ( t ) N k g ( D ¯ ν ¯ ( t ) ) γ H k Δ ι N ¯ d ν ¯ ( t ) γ H ˜ k F k ( t ) Δ ι N ¯ k ν ¯ ( t ) ] } ,
where
C ¯ = C 0 K D C + K D , C ¯ k = 0 0 K D 0 , A ¯ = A 0 0 A , H ˜ k = 0 H k , B ¯ = B 0 0 B , E ¯ = E 0 0 E , H ˜ = H 0 0 H , N ˜ a = N a 0 N a 0 , H k = 0 K , N ˜ b = ϱ ¯ N b 0 ϱ ¯ N b 0 , N ˜ c = N c 0 N c 0 , N ˜ e = δ ¯ N e 0 δ ¯ N e 0 , N ¯ k = N k D , 0 , F ˜ a ( t ) = diag F a ( t ) , F a ( t ) , F ˜ b ( t ) = diag F b ( t ) , F b ( t ) , N ˜ k = N k D , N k D , F ˜ c ( t ) = diag F c ( t ) , F c ( t ) , F ˜ e ( t ) = diag F e ( t ) , F e ( t ) , N ¯ d = D , 0 .
In order to eliminate the uncertainties Δ C , Δ A , Δ B , and Δ E in (12), the inequation ± 2 a b σ a T a + σ 1 b T b is utilized, and there exists an arbitrary scalar r > 0 satisfying
2 ϝ W H ˜ F ˜ c ( t ) N ˜ c e 1 T + H ˜ F ˜ a ( t ) N ˜ a e 4 T + H ˜ F ˜ b ( t ) N ˜ b e 5 T + H ˜ F ˜ e ( t ) N ˜ e e 6 T = H ˜ F ˜ ( t ) N ˜ r 1 H ˜ H ˜ T + r N ˜ T N ˜ ,
2 ϝ W H ˜ k F k ( t ) N ˜ k e 1 T γ H ˜ k F k ( t ) N k e 1 T γ ¯ H ˜ k F k ( t ) N k e 7 T = H ˜ k F k ( t ) N ˜ k s 1 H ˜ k H ˜ k T + s N ˜ k T N ˜ k ,
where
F ˜ ( t ) = diag F ˜ c ( t ) , F ˜ a ( t ) , F ˜ b ( t ) , F ˜ e ( t ) , ϝ = e 1 + μ ˜ e 10 , H ˜ = W H ˜ W H ˜ 0 ^ 0 ^ μ ˜ W H ˜ μ ˜ W H ˜ , N ˜ = N ˜ c 0 ^ 0 ^ 0 ^ 0 ^ 0 ^ 0 ^ 0 ^ N ˜ a 0 ^ 0 ^ 0 ^ 0 ^ 0 ^ 0 ^ N ˜ b 0 ^ 0 ^ 0 ^ 0 ^ 0 ^ 0 ^ N ˜ e 0 ^ , N ˜ k = N ˜ k γ N ¯ k , 0 ^ , 0 ^ , 0 ^ , γ ¯ N k , 0 ^ .
Similarly to (28), for the arbitrary scalars u and t , one has
2 γ ϝ W H k Δ ι N ¯ d e 1 T γ 2 u 1 ϝ W H k H k T ϝ T + ϵ 2 u e 1 N ¯ d T N ¯ d e 1 T ,
2 ϝ W H ˜ k F k ( t ) Δ ι N ¯ k e 1 T t 1 ϝ W H ˜ k H ˜ k T W ϝ T + ϵ 2 t e 1 N ¯ k T N ¯ k e 1 T ,
Combining (12) and (27)∼(31), we can get
˜ ¯ + r 1 H ˜ H ˜ T + r N ˜ T N ˜ + γ 2 u 1 ϝ W H k H k T ϝ T + s 1 H ˜ k H ˜ k T + s N ˜ k T N ˜ k + ϵ 2 u e 1 N ¯ d T N ¯ d e 1 T + t 1 ϝ W H ˜ k H ˜ k T W ϝ T + ϵ 2 t e 1 N ¯ k T N ¯ k e 1 T + ρ β Γ ( β + 1 ) Ξ O ˜ 1 Ξ T < 0 ^ ,
in which ¯ = Θ 1 + Θ 2 + Υ 1 + Υ 2 + Π 1 + Π 2 + Ψ + Sym 1 Ω 1 T + 2 Ω 2 T + Λ ¯ ,
Λ ¯ = Sym { ϝ W e 10 T ϝ W ( C ¯ + γ C ¯ k ) e 1 T + ϝ W A ¯ e 4 T + ϱ ¯ ϝ W B ¯ e 5 T + δ ¯ ϝ W E ¯ e 6 T γ ¯ ϝ W K ¯ e 7 T } .
The other terms Θ 1 , Θ 2 , Υ 1 , Υ 2 , Π 1 , Ψ and Π 2 have been defined in Theorem 1.
To facilitate the calculation of the estimator gain K , the variable X = V 2 K is defined. When Equation (32) is satisfied, it can be deduced from Schur’s Lemma that Equation (25) holds. From this, it can be known that the augmented system (11) is asymptotically stable. The proof is completed. □
Next, ignoring the random-occurrence characteristics of time-varying delays in (1), the memristor-based FONNs (1) are simplified to a type of traditional FONN with hybrid time-varying delays. In an ideal environment, the following fractional-order state estimator with ideal gain is designed:
D t β t 0 C ζ ^ ( t ) = C ζ ^ ( t ) + A f ( ζ ^ ( t ) ) + B f ( ζ ^ ( t ρ ( t ) ) ) + E t d ( t ) t f ( ζ ^ ( s ) ) d s + K ( y ( t ) y ^ ( t ) ) , y ^ ( t ) = D ζ ^ ( t ) ,
The following Corollary 1 can be easily inferred from Theorem 2. Therefore, the proof is omitted.
Corollary 1.
Under Assumption 1, for given scalars ρ, ρ ¯ , the augmented system (11) is stochastically asymptotically stable if there exist positive symmetric matrices P R 2 n × 2 n , Q 1 R 2 n × 2 n , Q 2 R 2 n × 2 n , O R 2 n × 2 n , M R 4 n × 4 n , any matrices W 1 R 4 n × 2 n , W 2 R 4 n × 2 n , W = diag V 1 , V 2 , scalars κ 1 > 0 , κ 2 > 0 , r > 0 satisfying the following LMI:
¯ Ξ H ˜ r N ˜ Γ ( β + 1 ) ρ β Y ˜ 0 ^ 0 ^ r I 0 ^ r I < 0 ^ ,
where
¯ = Θ 1 + Θ 2 + Π 1 + Π 2 + Υ 1 + Υ 2 + Ψ + Sym 1 Ω 1 T + 2 Ω 2 T + Λ ¯ , Λ ¯ = Sym { e 1 W e 10 T e 1 C e 1 T γ e 1 C k e 1 T + e 1 A ¯ e 4 T + e 1 W B ¯ e 5 T + e 1 W E ¯ e 6 T γ ¯ 1 K e 7 T μ ˜ e 10 W e 10 T μ ˜ e 10 C e 1 T μ ˜ γ e 10 C k e 1 T + μ ˜ e 10 A ¯ e 4 T + μ ˜ e 10 W B ¯ e 5 T + μ ˜ e 10 W E ¯ e 6 T μ ˜ γ ¯ e 10 K e 7 T } , N ˜ = N ˜ 1 0 ^ 0 ^ N ˜ 2 , N ˜ 1 = N ˜ c 0 ^ 0 ^ 0 ^ 0 ^ N ˜ a , N ˜ 2 = N ˜ b 0 ^ 0 ^ 0 ^ N ˜ e 0 ^ , N ˜ b = N b 0 ^ N b 0 ^ , N ˜ e = N e 0 ^ N e 0 ^ .
The rest terms Θ 1 , Θ 2 , Υ 1 , Υ 2 , Ψ , Π 1 , Π 2 can be found in Theorem 2. The estimator gain matrix K is calculated by K = V 2 1 X .
Based on the Corollary 1, a further discussion is carried out. Denote c i j = c i j , a i j = a i j , b i j = b i j , e i j = e i j . The fractional-order memristive neural networks (1) are simplified to a class of traditional FONNs with mixed delays. In an ideal environment, the following Corollary 2 can be obtained. This criterion can be directly derived from Corollary 1.
Corollary 2.
Suppose that Assumption 1, and let scalars ρ, ρ ¯ , be given; if there exist positive definite matrices P R 2 n × 2 n , Q 1 R 2 n × 2 n , Q 2 R 2 n × 2 n , O R 2 n × 2 n , M R 4 n × 4 n , any diagonal matrix W = diag V 1 , V 2 , and scalars κ 1 > 0 , κ 2 > 0 satisfying the following LMI:
¯ Ξ Γ ( β + 1 ) ρ β Y ˜ < 0 ^ ,
then, the augmented estimation error system (11) is asymptotically stable, where, ¯ , Ξ , and Y ˜ have been defined in Corollary 1. The estimator gain K is computed by K = V 2 1 X .
Remark 5.
In this paper, several novel LKFs containing the integral term t ρ t D τ β t 0 C ν ¯ T ( τ ) Y D t β t 0 C ν ¯ ( τ ) d τ and time delay information are constructed. Combining fractional-order Lyapunov approaches and a novel free-matrix-based integral inequality, several delay and order-dependent criteria are derived to guarantee the existence of a nonfragile state estimator. In [32,36,38], the available results are delay-independent or contain less time delay information. The results in this paper are delay- and order-independent, which reduces conservatism.

4. Numerical Examples

Numerical simulation examples are provided in this section to verify the validity and superiority of the aforementioned theoretical results.
Example 1.
To verify the validity of the estimator method in this paper, consider a class of 2-D fractional-order memristive neural network models (1):
D β t 0 C ζ 1 ( t ) = c 1 ( ζ 1 ( t ) ) ζ 1 ( t ) + a 11 ( ζ 1 ( t ) ) f 1 ( ζ 1 ( t ) ) + a 12 ( ζ 1 ( t ) ) f 2 ( ζ 2 ( t ) ) + ϱ ( t ) b 11 ( ζ 1 ( t ) ) f 1 ( ζ 1 ( t ρ ( t ) ) ) + ϱ ( t ) b 12 ( ζ 1 ( t ) ) f 2 ( ζ 2 ( t ρ ( t ) ) ) + δ ( t ) e 11 ( ζ 1 ( t ) ) t d ( t ) t f 1 ( ζ 1 ( s ) ) d s + δ ( t ) e 12 ( ζ 1 ( t ) ) t d ( t ) t f 2 ( ζ 2 ( s ) ) d s , D β t 0 C ζ 2 ( t ) = c 2 ( ζ 2 ( t ) ) ζ 2 ( t ) + a 21 ( ζ 2 ( t ) ) f 1 ( ζ 1 ( t ) ) + a 22 ( ζ 2 ( t ) ) f 2 ( ζ 2 ( t ) ) + ϱ ( t ) b 21 ( ζ 2 ( t ) ) f 1 ( ζ 1 ( t ρ ( t ) ) ) + ϱ ( t ) b 22 ( ζ 2 ( t ) ) f 2 ( ζ 2 ( t ρ ( t ) ) ) + δ ( t ) e 21 ( ζ 2 ( t ) ) t d ( t ) t f 1 ( ζ 1 ( s ) ) d s + δ ( t ) e 22 ( ζ 2 ( t ) ) t d ( t ) t f 2 ( ζ 2 ( s ) ) d s ,
where the correspond parameters can be chosen as
a 11 ( ζ 1 ( · ) ) = 0.59 , | ζ 1 ( · ) | 1 , 0.60 , | ζ 1 ( · ) | > 1 , a 12 ( ζ 1 ( · ) ) = 1.00 , | ζ 1 ( · ) | 1 , 0.50 , | ζ 1 ( · ) | > 1 , a 21 ( ζ 2 ( · ) ) = 0.20 , | ζ 2 ( · ) | 1 , 0.70 , | ζ 2 ( · ) | > 1 , a 22 ( ζ 2 ( · ) ) = 0.82 , | ζ 2 ( · ) | 1 , 0.50 , | ζ 2 ( · ) | > 1 , b 11 ( ζ 1 ( · ) ) = 0.60 , | ζ 1 ( · ) | 1 , 1.20 , | ζ 1 ( · ) | > 1 , b 12 ( ζ 1 ( · ) ) = 0.05 , | ζ 1 ( · ) | 1 , 0.25 , | ζ 1 ( · ) | > 1 , b 21 ( ζ 2 ( · ) ) = 0.30 , | ζ 2 ( · ) | 1 , 0.70 , | ζ 2 ( · ) | > 1 , b 22 ( ζ 2 ( · ) ) = 0.10 , | ζ 2 ( · ) | 1 , 0.40 , | ζ 2 ( · ) | > 1 , e 11 ( ζ 1 ( · ) ) = 0.70 , | ζ 1 ( · ) | 1 , 0.80 , | ζ 1 ( · ) | > 1 , e 12 ( ζ 1 ( · ) ) = 0.25 , | ζ 1 ( · ) | 1 , 0.15 , | ζ 1 ( · ) | > 1 , e 21 ( ζ 2 ( · ) ) = 0.30 , | ζ 2 ( · ) | 1 , 1.00 , | ζ 2 ( · ) | > 1 , e 22 ( ζ 2 ( · ) ) = 0.70 , | ζ 2 ( · ) | 1 , 0.40 , | ζ 2 ( · ) | > 1 , c 11 ( ζ 1 ( · ) ) = 0.70 , | ζ 1 ( · ) | 1 , 0.90 , | ζ 1 ( · ) | > 1 , c 22 ( ζ 2 ( · ) ) = 0.85 , | ζ 2 ( · ) | 1 , 1.00 , | ζ 2 ( · ) | > 1 ,
then, one can derive that
A = 0.75 0.75 0.25 0.65 , B = 0.90 0.10 0.20 0.25 , E = 0.75 0.2 0.35 0.55 , N a = 0.15 0.25 0 0 0 0 0.45 0.15 , N b = 0.30 0.15 0 0 0 0 0.50 0.15 , N e = 0.05 0.05 0 0 0 0 0.65 0.15 , N c = 0.100 0 0 0 0 0 0 0.075 , D = 0.1 0.3 0 0.4 , H k = 0.1 0 0 0.1 , N k = 0.4 0.4 0.4 0.4 .
The time-varying delays ρ ( t ) and d ( t ) are chosen as ρ ( t ) = 0.02 + 0.4 | sin ( t ) | , d ( t ) = 0.05 + 0.3 | cos ( t ) | , which imply ρ = 0.42 , ρ ¯ = 0.4 , d = 0.35 .
In this example, we assume that the time-varying delays ρ ( t ) and d ( t ) satisfy ϱ ¯ = E ϱ ( t ) = 0.7 , δ ¯ = E δ ( t ) = 0.65 . Choose the following activation functions:
f ( ζ ( t ) ) = 0.4 ζ 1 ( t ) + tanh ( 0.2 ζ 1 ( t ) ) + 0.3 ζ 2 ( t ) 0.2 ζ 2 ( t ) + tanh ( 0.3 ζ 2 ( t ) ) ,
which implies that
F 1 = 0.4 0.3 0 0.2 , F 2 = 0.2 0.3 0 0.1 .
By utilizing the Matlab LMI Toolbox, we can obtain a set of solutions of LMIs (25) as follows:
U 2 = 0.0409 0.0013 0.0013 0.0384 , X = 0.0046 0.0029 0.0025 0.0048 .
From (26), the gain matrix K is derived as
K = 0.1147 0.0751 0.0686 0.1275 ,
and κ 1 = 0.6339 , κ 2 = 0.3673 , r = 0.1049 , s = 0.1618 , u = 0.1422 , t = 0.1334 .
Based on the above parameters and feasible solutions, Figure 4, Figure 5 and Figure 6 show all the simulation results. Figure 4 and Figure 5 depict the trajectories of the neuronal states ζ 1 ( t ) and ζ 2 ( t ) and their estimated values at different orders. Figure 6 shows the dynamic error-response curves at different orders ( β = 0.7 , 0.8 , 0.9 ) , and Figure 7 indicates the value of the random variable ϱ ( t ) when the time-varying delay ρ ( t ) occurs randomly. Figure 8 and Figure 9 show the actual outputs of neural networks and the cyber-attacks for y ( t ) , respectively. From this, it can be seen that the fractional nonfragile state estimator designed in this paper is valid.
Example 2.
To further verify the validity and superiority of the methods provided in this example, consider the conventional FONN system [39]
D t β t 0 C ζ ( t ) = C ζ ( t ) + A f ( ζ ( t ) ) + B f ( ζ ( t ρ ( t ) ) ) + E t d ( t ) t f ( ζ ( s ) ) d s , y ( t ) = D ζ ( t ) ,
with the following parameters:
C = 1 0 0 1 , A = 0.8 0.19 0.5 0.82 , B = 0.7 0.8 0.17 0.6 , D = 0.1 0.65 0 0.15 .
In this simulation, we choose the following activation functions:
g ( ζ ( t ) ) = 0.6 ζ 1 ( t ) + tanh ( 0.3 ζ 1 ) + 0.3 ζ 2 ( t ) 0.1 ζ 1 ( t ) 0.2 ζ 2 ( t ) + tanh ( 0.6 ζ 2 ( t ) ) ,
which implies that
F 1 = 0.6 0.3 0.1 0.2 , F 2 = 0.3 0.3 0.1 0.4 .
In this example, we obtain the maximal allowable upper bounds for different ρ ¯ , β = 0.9 , which are shown in Table 1. Simultaneously, for the different d 0.1 , 0.2 , 0.3 , 0.5 , 0.7 , 0.9 , the results of MAUBs corresponding to system orders β are presented in Table 2, where the system orders are selected as β 0.6 , 0.8 , 0.9 , 0.99 . From Table 1 and Table 2, it can be easily concluded that the methods proposed in this paper exhibit reduced conservatism.
Choose ρ ¯ = 0.2 , d = 0.2 , and the allowable upper bound ρ = 4.1192 . Assume that ρ ( t ) = 0.2 sin ( t ) + 3.9192 and ζ ( 0 ) = [ 2.4 ; 3.6 ] T , ζ ^ ( 0 ) = [ 2.1 ; 3.2 ] T . The state trajectories of the FONNs (37) are shown in Figure 10 and Figure 11. Figure 12 depicts the estimation errors. As a result, the simulation results demonstrate the effectiveness of the designed estimator (5).

5. Conclusions

This paper addresses the nonfragile SE problem for a class of memristor-based FONNs with ROTVDs and cyber-attacks. Considering the phenomenon of cyber-attacks in the network transmission process and the problem of the signal transmission burden that affects network communication in practical engineering applications, a nonfragile fractional-order state estimator, based on quantized measurement outputs, was designed. Finally, two examples were provided to verify the validity of the estimation method. In the future, we will apply the proposed method to address fractional-order linear systems with parameter uncertainties, as well as other nonlinear systems.

Author Contributions

Conceptualization, Y.L.; Methodology, Q.N., X.S. and J.Z.; Software, X.S., Y.Z. and J.Z.; Investigation, X.S.; Writing—original draft, Q.N.; Writing—review & editing, Y.L. and Y.Z.; Funding acquisition, Q.N. and J.Z. All authors have read and agreed to the published version of the manuscript.

Funding

Project supported by the Natural Science Foundation of Henan Province (Grant 242300421718), Provincial Frontier leading technology basic research major project fund (Grant BK20232028).

Data Availability Statement

Data are contained within this article.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

M T transpose of matrix M
I / 0 ^ identity/zero matrix with appropriate order
symmetric term
E · mathematical expectation operator
R n n-dimensional Euclidean space
Prob · occurrence probability of event ‘·’
Sym M M + M T
col block-column vector

References

  1. Miller, K.S.; Ross, B. An Introduction to the Fractional Calculus and Fractional Differential Equations; Wiley: Hoboken, NJ, USA, 1993. [Google Scholar]
  2. Oldham, K.; Spanier, J. The Fractional Calculus Theory and Applications of Differentiation and Integration to Arbitrary Order; Elsevier: Amsterdam, The Netherlands, 1974. [Google Scholar]
  3. Tripathi, D.; Pandey, S.; Das, S. Peristaltic flow of viscoelastic fluid with fractional Maxwell model through a channel. Appl. Math. Comput. 2010, 215, 3645–3654. [Google Scholar] [CrossRef]
  4. Alarifi, N.M.; Ibrahim, R.W. Specific Classes of Analytic Functions Communicated with a Q-Differential Operator Including a Generalized Hypergeometic Function. Fractal Fract. 2022, 6, 545. [Google Scholar] [CrossRef]
  5. Kulish, V.V.; Lage, J.L. Application of fractional calculus to fluid mechanics. J. Fluids Eng. 2002, 124, 803–806. [Google Scholar] [CrossRef]
  6. Hilfer, R. Applications of Fractional Calculus in Physics; World Scientific: Singapore, 2000. [Google Scholar]
  7. Chen, B.; Chen, J. Razumikhin-type stability theorems for functional fractional-order differential systems and applications. Appl. Math. Comput. 2015, 254, 63–69. [Google Scholar] [CrossRef]
  8. Cheng, Y.; Xu, W.; Jia, H.; Zhong, S. Stability analysis of fractional-order neural networks with time-varying delay utilizing free-matrix-based integral inequalities. J. Frankl. Inst. 2023, 360, 10815–10835. [Google Scholar] [CrossRef]
  9. Parvizian, M.; Khandani, K.; Majd, V.J. An H non-fragile observer-based adaptive sliding mode controller design for uncertain fractional-order nonlinear systems with time delay and input nonlinearity. Asian J. Control 2021, 23, 423–431. [Google Scholar] [CrossRef]
  10. Chen, S.; Huang, W.; Liu, Q. A New Adaptive Robust Sliding Mode Control Approach for Nonlinear Singular Fractional-Order Systems. Fractal Fract. 2022, 6, 253. [Google Scholar] [CrossRef]
  11. Hu, T.; Park, J.H.; Liu, X.; He, Z.; Zhong, S. Sampled-Data-Based Event-Triggered Synchronization Strategy for Fractional and Impulsive Complex Networks with Switching Topologies and Time-Varying Delay. IEEE Trans. Syst. Man Cybern. Syst. 2022, 52, 3568–3580. [Google Scholar] [CrossRef]
  12. Hymavathi, M.; Muhiuddin, G.; Syed Ali, M.; Al-Amri, J.F.; Gunasekaran, N.; Vadivel, R. Global Exponential Stability of Fractional Order Complex-Valued Neural Networks with Leakage Delay and Mixed Time Varying Delays. Fractal Fract. 2022, 6, 140. [Google Scholar] [CrossRef]
  13. Xu, Y.; Li, W.; Zhang, C.; Li, W. Global bipartite synchronization of fractional-order time-varying coupled signed networks with proportional delays. Commun. Nonlinear Sci. Numer. Simul. 2023, 126, 107452. [Google Scholar] [CrossRef]
  14. Syed Ali, M.; Gunasekaran, N.; Joo, Y.H. Sampled-Data State Estimation of Neutral Type Neural Networks with Mixed Time-Varying Delays. Neural Process. Lett. 2019, 50, 357–378. [Google Scholar] [CrossRef]
  15. Shen, Y.; Zhu, S.; Liu, X.; Wen, S. Multiple Mittag-Leffler Stability of Fractional-Order Complex-Valued Memristive Neural Networks With Delays. IEEE Trans. Cybern. 2023, 53, 5815–5825. [Google Scholar] [CrossRef]
  16. Wang, Z.; Ho, D.W.; Liu, X. State estimation for delayed neural networks. IEEE Trans. Neural Netw. 2005, 16, 279–284. [Google Scholar] [CrossRef] [PubMed]
  17. Chua, L. Memristor-the missing circuit element. IEEE Trans. Circuit Theory 1971, 18, 507–519. [Google Scholar] [CrossRef]
  18. Bao, H.; Park, J.H.; Cao, J. Non-fragile state estimation for fractional-order delayed memristive BAM neural networks. Neural Netw. 2019, 119, 190–199. [Google Scholar] [CrossRef]
  19. Tri, V.V.; Huong, D.C.; Diep, P.N.N. State estimation problem for fractional-order neural networks using event-triggered state observers. Proc. Inst. Mech. Eng. Part I J. Syst. Control Eng. 2022, 237, 1078–1086. [Google Scholar] [CrossRef]
  20. Strukov, D.B.; Snider, G.S.; Stewart, D.R.; Williams, R.S. The missing memristor found. Nature 2008, 453, 80–83. [Google Scholar] [CrossRef] [PubMed]
  21. Fan, Y.; Huang, X.; Wang, Z.; Xia, J.; Shen, H. Quantized Control for Synchronization of Delayed Fractional-Order Memristive Neural Networks. Neural Process. Lett. 2020, 52, 403–419. [Google Scholar] [CrossRef]
  22. Huang, W.; Song, Q.; Zhao, Z.; Liu, Y.; Alsaadi, F.E. Robust stability for a class of fractional-order complex-valued projective neural networks with neutral-type delays and uncertain parameters. Neurocomputing 2021, 450, 399–410. [Google Scholar] [CrossRef]
  23. Cheng, J.; Liang, L.; Yan, H.; Cao, J.; Tang, S.; Shi, K. Proportional-Integral Observer-Based State Estimation for Markov Memristive Neural Networks With Sensor Saturations. IEEE Trans. Neural Netw. Learn. Syst. 2022, 35, 405–416. [Google Scholar] [CrossRef]
  24. Li, J.; Dong, H.; Wang, Z.; Bu, X. Partial-Neurons-Based Passivity-Guaranteed State Estimation for Neural Networks with Randomly Occurring Time Delays. IEEE Trans. Neural Netw. Learn. Syst. 2020, 31, 3747–3753. [Google Scholar] [CrossRef] [PubMed]
  25. Podlubny, I. Fractional Differential Equations: An Introduction to Fractional Derivatives, Fractional Differential Equations, to Methods of Their Solution and Some of Their Applications; Elsevier: Amsterdam, The Netherlands, 1998. [Google Scholar]
  26. Shao, X.; Lyu, M.; Zhang, J. Nonfragile estimator design for fractional-order neural networks under event-triggered mechanism. Discret. Dyn. Nat. Soc. 2021, 2021, 1–12. [Google Scholar] [CrossRef]
  27. Ding, S.; Wang, Z.; Rong, N.; Zhang, H. Exponential Stabilization of Memristive Neural Networks via Saturating Sampled-Data Control. IEEE Trans. Cybern. 2017, 47, 3027–3039. [Google Scholar] [CrossRef]
  28. Geng, H.; Wang, Z.; Hu, J.; Alsaadi, F.E.; Cheng, Y. Outlier-resistant sequential filtering fusion for cyber-physical systems with quantized measurements under denial-of-service attacks. Inf. Sci. 2023, 628, 488–503. [Google Scholar] [CrossRef]
  29. Shao, X.; Lu, Y.; Zhang, J.; Lyu, M.; Yang, Y. Quantized Nonfragile State Estimation of Memristor-Based Fractional-Order Neural Networks with Hybrid Time Delays Subject to Sensor Saturations. Fractal Fract. 2024, 8, 343. [Google Scholar] [CrossRef]
  30. Fu, M.; Xie, L. The sector bound approach to quantized feedback control. IEEE Trans. Autom. Control 2005, 50, 1698–1711. [Google Scholar]
  31. Shen, J.; Lam, J. Stability and Performance Analysis for Positive Fractional-Order Systems With Time-Varying Delays. IEEE Trans. Autom. Control 2016, 61, 2676–2681. [Google Scholar] [CrossRef]
  32. Hu, T.; He, Z.; Zhang, X.; Zhong, S.; Yao, X. New fractional-order integral inequalities: Application to fractional-order systems with time-varying delay. J. Frankl. Inst. 2021, 358, 3847–3867. [Google Scholar] [CrossRef]
  33. Gu, K.; Chen, J.; Kharitonov, V.L. Stability of Time-Delay Systems; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
  34. Yang, X.; Wu, X.; Song, Q. Caputo-Wirtinger integral inequality and its application to stability analysis of fractional-order systems with mixed time-varying delays. Appl. Math. Comput. 2024, 460, 128303. [Google Scholar] [CrossRef]
  35. Selvaraj, P.; Sakthivel, R.; Kwon, O.M. Synchronization of fractional-order complex dynamical network with random coupling delay, actuator faults and saturation. Nonlinear Dyn. 2018, 94, 3101–3116. [Google Scholar] [CrossRef]
  36. Peng, X.; Wu, H. Non-fragile robust finite-time stabilization and H performance analysis for fractional-order delayed neural networks with discontinuous activations under the asynchronous switching. Neural Comput. Appl. 2020, 32, 4045–4071. [Google Scholar] [CrossRef]
  37. Chen, S.; Song, Q.; Zhao, Z.; Liu, Y.; Alsaadi, F.E. Global asymptotic stability of fractional-order complex-valued neural networks with probabilistic time-varying delays. Neurocomputing 2021, 450, 311–318. [Google Scholar] [CrossRef]
  38. Chen, L.; Li, T.; Wu, R.; Chen, Y.; Liu, Z. Non-fragile control for a class of fractional-order uncertain linear systems with time-delay. IET Control Theory Appl. 2020, 14, 1575–1589. [Google Scholar] [CrossRef]
  39. Liu, P.; Kong, M.; Zeng, Z. Projective Synchronization Analysis of Fractional-Order Neural Networks with Mixed Time Delays. IEEE Trans. Cybern. 2020, 52, 6798–6808. [Google Scholar] [CrossRef]
  40. Dai, J.; Xiong, L.; Zhang, H.; Rui, W. Improved Results on Delay-Dependent and Order-Dependent Criteria of Fractional-Order Neural Networks with Time Delay Based on Sampled-Data Control. Fractal Fract. 2023, 7, 876. [Google Scholar] [CrossRef]
Figure 1. The physical structure of a memristor [20].
Figure 1. The physical structure of a memristor [20].
Fractalfract 09 00447 g001
Figure 2. The logarithmic quantizer.
Figure 2. The logarithmic quantizer.
Fractalfract 09 00447 g002
Figure 3. Concise flow diagram.
Figure 3. Concise flow diagram.
Fractalfract 09 00447 g003
Figure 4. Trajectories of states ζ 1 ( t ) and ζ ^ 1 ( t ) .
Figure 4. Trajectories of states ζ 1 ( t ) and ζ ^ 1 ( t ) .
Fractalfract 09 00447 g004
Figure 5. Trajectories of states ζ 2 ( t ) and ζ ^ 2 ( t ) .
Figure 5. Trajectories of states ζ 2 ( t ) and ζ ^ 2 ( t ) .
Fractalfract 09 00447 g005
Figure 6. Estimation error r i ( t ) .
Figure 6. Estimation error r i ( t ) .
Fractalfract 09 00447 g006
Figure 7. The Bernoulli random variable ϱ ( t ) with ( ϱ ¯ = 0.7 ) .
Figure 7. The Bernoulli random variable ϱ ( t ) with ( ϱ ¯ = 0.7 ) .
Fractalfract 09 00447 g007
Figure 8. The actual outputs y ˜ ( t ) .
Figure 8. The actual outputs y ˜ ( t ) .
Fractalfract 09 00447 g008
Figure 9. The graph of cyber-attack functions g ( t ) .
Figure 9. The graph of cyber-attack functions g ( t ) .
Fractalfract 09 00447 g009
Figure 10. Trajectories of states ζ 1 ( t ) and ζ ^ 1 ( t ) with β = 0.9 .
Figure 10. Trajectories of states ζ 1 ( t ) and ζ ^ 1 ( t ) with β = 0.9 .
Fractalfract 09 00447 g010
Figure 11. Trajectories of states ζ 2 ( t ) and ζ ^ 2 ( t ) with β = 0.9 .
Figure 11. Trajectories of states ζ 2 ( t ) and ζ ^ 2 ( t ) with β = 0.9 .
Fractalfract 09 00447 g011
Figure 12. Estimation error r i ( t ) ( i = 1 , 2 ) with β = 0.9 .
Figure 12. Estimation error r i ( t ) ( i = 1 , 2 ) with β = 0.9 .
Fractalfract 09 00447 g012
Table 1. Maximal allowable delays for different values ρ ¯ ( β = 0.9 ).
Table 1. Maximal allowable delays for different values ρ ¯ ( β = 0.9 ).
Methods ρ ¯ = 0.1 ρ ¯ = 0.2 ρ ¯ = 0.3 ρ ¯ = 0.5 ρ ¯ = 0.7 ρ ¯ = 0.9
[40]4.3533.55142.45491.84311.12010.5829
[38]
Corollary 25.59324.11923.24842.16541.41580.7049
Table 2. Maximal allowable delays for different orders of β and d.
Table 2. Maximal allowable delays for different orders of β and d.
β d
0.20.611.41.82.2
0.610.4163.53762.12831.50161.14520.9152
0.86.10672.71681.85591.42871.16590.9855
0.94.11922.51951.79561.42311.18781.0230
0.994.61672.39931.76341.42741.21121.0574
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

Niu, Q.; Shao, X.; Lu, Y.; Zhao, Y.; Zhang, J. Nonfragile State Estimator Design for Memristor-Based Fractional-Order Neural Networks with Randomly Occurring Hybrid Time Delays and Stochastic Cyber-Attacks. Fractal Fract. 2025, 9, 447. https://doi.org/10.3390/fractalfract9070447

AMA Style

Niu Q, Shao X, Lu Y, Zhao Y, Zhang J. Nonfragile State Estimator Design for Memristor-Based Fractional-Order Neural Networks with Randomly Occurring Hybrid Time Delays and Stochastic Cyber-Attacks. Fractal and Fractional. 2025; 9(7):447. https://doi.org/10.3390/fractalfract9070447

Chicago/Turabian Style

Niu, Qifeng, Xiaoguang Shao, Yanjuan Lu, Yibo Zhao, and Jie Zhang. 2025. "Nonfragile State Estimator Design for Memristor-Based Fractional-Order Neural Networks with Randomly Occurring Hybrid Time Delays and Stochastic Cyber-Attacks" Fractal and Fractional 9, no. 7: 447. https://doi.org/10.3390/fractalfract9070447

APA Style

Niu, Q., Shao, X., Lu, Y., Zhao, Y., & Zhang, J. (2025). Nonfragile State Estimator Design for Memristor-Based Fractional-Order Neural Networks with Randomly Occurring Hybrid Time Delays and Stochastic Cyber-Attacks. Fractal and Fractional, 9(7), 447. https://doi.org/10.3390/fractalfract9070447

Article Metrics

Back to TopTop