
In this paper, we proposed a reachable set control method for a class of Markov jump cyber-physical systems (MJCPSs) with time-varying delays, which addressed the challenges posed by false data injection (FDI) attacks to system security. The goal was to find the set of regions where all MJCPSs states were reachable from the origin in the presence of bounded disturbances. The adaptive event-triggered control strategy was introduced to save network resources. It also reduced the impact of FDI attacks and external disturbances on system security. The conservatism of the results were reduced by constructing the Lyapunov-Krasovskii (L-K) functional with time-varying delays. Difference terms were estimated by using the discrete Wirtinger inequality and the improved extended reciprocally convex matrix inequality, and the ellipsoid reachable set of the MJCPS was obtained. Then, the reachable set controller was obtained by linear matrix inequalities (LMIs) solving technique. Finally, an example simulation proved the validity of the results.
Citation: Sheng-Ran Jia, Wen-Juan Lin. Adaptive event-triggered reachable set control for Markov jump cyber-physical systems with time-varying delays[J]. AIMS Mathematics, 2024, 9(9): 25127-25144. doi: 10.3934/math.20241225
[1] | Chantapish Zamart, Thongchai Botmart, Wajaree Weera, Prem Junsawang . Finite-time decentralized event-triggered feedback control for generalized neural networks with mixed interval time-varying delays and cyber-attacks. AIMS Mathematics, 2023, 8(9): 22274-22300. doi: 10.3934/math.20231136 |
[2] | Xipan Zhang, Changchun Shen, Dingju Xu . Reachable set estimation for neutral semi-Markovian jump systems with time-varying delay. AIMS Mathematics, 2024, 9(4): 8043-8062. doi: 10.3934/math.2024391 |
[3] | Wentao Le, Yucai Ding, Wenqing Wu, Hui Liu . New stability criteria for semi-Markov jump linear systems with time-varying delays. AIMS Mathematics, 2021, 6(5): 4447-4462. doi: 10.3934/math.2021263 |
[4] | Yonggwon Lee, Yeongjae Kim, Seunghoon Lee, Junmin Park, Ohmin Kwon . An improved reachable set estimation for time-delay linear systems with peak-bounded inputs and polytopic uncertainties via augmented zero equality approach. AIMS Mathematics, 2023, 8(3): 5816-5837. doi: 10.3934/math.2023293 |
[5] | Liping Luo, Yonggang Chen, Jishen Jia, Kaixin Zhao, Jinze Jia . Event-triggered anti-windup strategy for time-delay systems subject to saturating actuators. AIMS Mathematics, 2024, 9(10): 27721-27738. doi: 10.3934/math.20241346 |
[6] | Junfeng Zhang, Renjie Fu, Yuanyuan Wu, Bhatti Uzair Aslam . Practical consensus of time-varying fuzzy positive multi-agent systems. AIMS Mathematics, 2024, 9(11): 31119-31141. doi: 10.3934/math.20241500 |
[7] | Yahan Deng, Zhenhai Meng, Hongqian Lu . Adaptive event-triggered state estimation for complex networks with nonlinearities against hybrid attacks. AIMS Mathematics, 2022, 7(2): 2858-2877. doi: 10.3934/math.2022158 |
[8] | Yakufu Kasimu, Gulijiamali Maimaitiaili . Non-fragile ${H_\infty }$ filter design for uncertain neutral Markovian jump systems with time-varying delays. AIMS Mathematics, 2024, 9(6): 15559-15583. doi: 10.3934/math.2024752 |
[9] | Yuxin Lou, Mengzhuo Luo, Jun Cheng, Xin Wang, Kaibo Shi . Double-quantized-based $ H_{\infty} $ tracking control of T-S fuzzy semi-Markovian jump systems with adaptive event-triggered. AIMS Mathematics, 2023, 8(3): 6942-6969. doi: 10.3934/math.2023351 |
[10] | Xuelian Jin . Exponential stability analysis and control design for nonlinear system with time-varying delay. AIMS Mathematics, 2021, 6(1): 102-113. doi: 10.3934/math.2021008 |
In this paper, we proposed a reachable set control method for a class of Markov jump cyber-physical systems (MJCPSs) with time-varying delays, which addressed the challenges posed by false data injection (FDI) attacks to system security. The goal was to find the set of regions where all MJCPSs states were reachable from the origin in the presence of bounded disturbances. The adaptive event-triggered control strategy was introduced to save network resources. It also reduced the impact of FDI attacks and external disturbances on system security. The conservatism of the results were reduced by constructing the Lyapunov-Krasovskii (L-K) functional with time-varying delays. Difference terms were estimated by using the discrete Wirtinger inequality and the improved extended reciprocally convex matrix inequality, and the ellipsoid reachable set of the MJCPS was obtained. Then, the reachable set controller was obtained by linear matrix inequalities (LMIs) solving technique. Finally, an example simulation proved the validity of the results.
The integration of physical systems and network systems has become a trend. This integration forms cyber-physical systems (CPSs) [1]. CPSs realize real-time information interaction between cyber and physical modules, which have the advantages of efficiency, convenience, and transparency. A typical CPS consists of three parts: sensing part, network part, and control part. In the practical application of some CPSs, external disturbances, internal failures, and changes in the working environment often occur [2]. Those situations can lead to abrupt changes in the modes of the CPS, while also causing the system to not operate safely [3]. Markov jump cyber-physical systems (MJCPSs) introduce Markov jump properties to describe the abrupt change of system modes. Scholars have paid increasing attention to MJCPSs in recent years and have obtained some research results, such as attack-compensated output control [4], sliding mode control [5], and adaptive resilient control [6].
MJCPSs are characterized by the openness of network transmission, thus making them vulnerable to the threat of cyber attacks during information transmission. Common cyber attacks include deception attacks [7] and denial of service (DOS) attacks [8]. Deception attacks are related to the state of the system and carefully designed by the attacker. As a result, deception attacks tend to be more destructive than DOS attacks [9], the most typical of which are false data injection (FDI) attacks. When the system state information of MJCPSs is transmitted between physical and network modules, the attacker tampers with the system state information by secretly injecting false information, which leads to system paralysis. Reachable set control is an important branch of system security research and the reachable set control can defend against FDI attacks. The existence of FDI attacks and external disturbances will destroy the security of the system and make the system unstable. The system can be restored to normal by reachable set control. Therefore, reachable set control has great significance in theoretical research and practical application. The reachable set is the set of all states of the system that can be reached from the original state under the influence of bounded disturbances [10]. Scholars have conducted reachable set research on stealth attacks [11], deception attacks [12], and hybrid attacks [13] that MJCPSs may be subjected to. However, there are few studies on the reachable set of discrete MJCPSs, and even fewer on the reachable set of MJCPSs under FDI attacks. Therefore, obtaining more applicable reachable set control results for discrete MJCPSs under FDI attacks is a motivation for this paper.
Influenced by physical factors such as material and temperature, the transmission of signals at actual MJCPSs creates time delays that cannot be eliminated[14]. In the transmission of the signal, most of the time delays are not constant. The magnitude of time delays varies with time because of the physical factors, such as material and temperature change. This kind of delay is called time-varying delay. It makes the current state information of the system also contain the state information of the previous time [15]. The presence of system delays increases the conservatism of research results in the reachable set of MJCPSs[16]. Therefore, reducing the conservatism that system delays bring to the study of reachable sets of MJCPSs is another motivation for this paper.
Since MJCPSs are characterized by data exchange and sharing, remote monitoring and control, they require continuous network transmission. However, network bandwidth is usually limited, leading to problems such as information congestion and inefficient utilization of network resources during data transmission. Event-triggered control strategies can effectively save network resources. Moreover, event-triggered control strategies can also reduce the impact of cyber attacks and external disturbances on the MJCPS [17]. There are many kinds of event-triggered control strategies, including but not limited to hybrid-triggered security control strategies [18], dynamic event-triggered security control strategies [19], and memory-based event-triggered security control strategies [20]. Ordinary event-triggered control strategies give fixed trigger thresholds and consider global information. Adaptive event-triggered control strategies introduce dynamic trigger thresholds that eliminate the need for global data and provide more flexible trigger conditions. It can flexibly change the trigger threshold when FDI attacks and external disturbances occur. This reduces the number of triggers and increases the security of the MJCPS. Obtaining more effective reachable set control effects through adaptive event-triggered control strategies is also the research motivation.
The contributions of the paper are as follows:
1) In this paper, the reachable set problem of MJCPS with time-varying delays and external disturbances under FDI attacks is studied for the first time. Compared to other papers[21], this paper considers a variety of adverse effects on the MJCPS, and the results are more applicable.
2) The adaptive event-triggered control strategy is added to save network resources during data transmission. It also reduces the impact of FDI attacks and external disturbances on the MJCPS.
3) By constructing the new Lyapunov-Krasovskii (L-K) functional with system time-varying delays and utilizing the Wirtinger inequality and the improved extended reciprocally convex matrix inequality, sufficient conditions of less conservative for reachable set estimation are derived. It is transformed into the form of the linear matrix inequality (LMI) and solved to obtain the optimal solution of the reachable set controller.
4) The validity of the results is proved by a boost converter circuit system example.
Notations: Rn stands for an n-dimensional real matrix; Z stands for nonnegative integers; and E{⋅} represents the mathematical expectation. The symmetric term in a symmetric matrix is represented by the symbol ∗, and ‖⋅‖ indicates the Euclidean norm. The diagonal matrix is represented by the symbol diag{⋯}.
Figure 1 shows the design diagram of the reachable set controller of the MJCPS under FDI attacks. As can be seen from the figure, the sensor obtains the sampled signal x(k) and sends it to the event generator. The event generator is compared the sampled signal with the trigger conditions. The signal which meets the conditions will be sent to the network transmission. When the signal does not meet the trigger conditions, the zero-order hold (ZOH) will keep the information of the previous time unchanged to ensure the continuity of the signal. In the transmission process, it is assumed that the network-induced delay of the network transmission is σ(k), which satisfies σ(k)∈[0,σM], and the attacker randomly carries out FDI attacks. Finally, the controller processes the signal ˆx(k−σ(k)).
Consider the following MJCPS:
{x(k+1)=Arkx(k)+Brku(k)+Frkx(k−d(k))+Drkw(k),u(k)=Krkx(k), | (2.1) |
where x(k)∈Rn,u(k)∈Rm,Krk represent the state vector, the controller input, and the controller gain; d(k) is a time-varying delay; d(k)∈[dm,dM], where dm and dM are constant; w(k)∈Rl represents the external disturbance, and the following mean bounded condition is met:
E[wT(k)w(k)]≤ϖ, | (2.2) |
where ϖ is a constant. Ark,Brk,Crk,Drk,Frk are constant matrices of known suitable dimensions. Here, {rk,k∈Z} is a discrete-time Markov chain, which takes from a finite space N={1,2,…,N}. The system transition probability is πpq=Pr{rk+1=q|rk=p}, where 0≤πpq≤1 for all p,q∈N, and ∑Nq=1πpq=1 for all p∈N. Π=[πpq] is a matrix of transition probability.
The adaptive event-triggered control strategy is adopted to reduce the waste of network resources. The corresponding trigger condition is:
km+1=km+mink>km{k|[x(k)−x(km)]TQ[x(k)−x(km)]>ϑ(k)xT(km)Qx(km)}, | (2.3) |
where km represents the most recent trigger time; x(km) denotes the latest transmitted state; and Q is the undetermined positive definite weighting matrix. The adaptive triggered threshold ϑ(k) meets:
Δϑ(k)=1ϑ(k)[1ϑ(k)−ϑ0][x(k)−x(km)]TQ[x(k)−x(km)], | (2.4) |
where Δϑ(k)=ϑ(k+1)−ϑ(k) and ϑ0>0. It is inevitable that there is transmission delay in the transmission process. The delay existing in network transmission is analyzed as in references [22] and [23]. The mechanism (2.3) can be rewritten as:
km+1=km+mink>km{k|eTxQex>ϑ(k)xT(k−σ(k))Qx(k−σ(k))}, | (2.5) |
where ex=x(k)−x(km). The delay is 0≤σ(k)≤σM, and σM is a constant. So, x(k) after passing the adaptive event-triggered control strategy can be expressed as: ˜x(k−σ(k))=x(k−σ(k))−ex.
Remark 1. The common event-triggered control strategy relies on global information to set a fixed trigger threshold, which may cause the loss of important information. The adaptive event-triggered control strategy in this paper not only preserves system data as much as possible, but also helps the system recover quickly after FDI attacks and external disturbances happened. Compared with other adaptive laws, this adaptive law is adjusted by focusing on the difference in state near the trigger time. When the FDI attack or the disturbance occur, ex will increase, then Δϑ(k) will increase, consequently causing an increase in ϑ(k). The trigger condition will become harder, and the system will maintain its previous trigger state unchanged under the ZOH, thereby effectively mitigating the impact of FDI attacks and disturbances on MJCPSs state. In addition, in order to avoid Zeno behavior, the sampling period of the system is used as the minimum time interval between two events.
FDI attacks occur during network communications such as data sharing and remote control in the MJCPS (2.1). Different from the previous attacks from [24], the attacker eliminates the original correct data in the system while carrying out the attacks signal input, which is more destructive to the system. The attacks signal model can be expressed as:
ˆx(k−σ(k))=˜x(k−σ(k))+α(k)[−˜x(k−σ(k))+ξ(˜x(k−σ(k)))], | (2.6) |
where α(k)=0 or α(k)=1 represent failure or success of the attack launched by the attacker at time k. α(k) satisfies the Bernoulli distribution; E{α(k)}=Prob{α(k)=1}=ˆα,E{1−α(k)}=Prob{α(k)=0}=1−ˆα; and ξ(˜x(k−σ(k))) denotes the FDI attacks signal in discrete time, satisfying:
‖ξ(˜x(k−σ(k)))‖2≤‖GM˜x(k−σ(k))‖2, | (2.7) |
where GM is a known matrix.
Remark 2. FDI attacks pose a huge threat to the security of the MJCPS as they are well-designed by the attackers. The attack model in this paper is to erase the original state information of the MJCPS and inject error information. In order to avoid the attacks signal being detected and improve the success rate of the FDI attack, the attacker sets an energy upper limit for the attacks signal. In the actual MJCPS, the attacks signal will be affected by the external environment, signal disturbances, and other factors. Therefore, it is random whether the FDI attacks signal can be injected into the MJCPS. In this paper, the Bernoulli distribution function is used to describe the probability distribution of whether an attacker launches a successful FDI attack. In order to be closer to the actual MJCPS, the system state in this paper introduces the corresponding delay in the network transmission after the event-triggered control strategy processing, so the FDI attacks signal should contain the corresponding delay.
When rk=p, there is the system such that:
x(k+1)=Apx(k)+(1−α(k))BpKpx(k−σ(k))+α(k)BpKpξ(x(k−σ(k)))+Fpx(k−d(k))+Dpw(k)−(1−α(k))BpKpex. | (2.8) |
Here are the definition and a few lemmas.
Definition 1. [25] For ∀k≥0, the reachable set of the MJCPS is denoted as follows:
H(x)={x(k)|x(k)andw(k)satisfy(2.1)and(2.2)}, |
and the ellipsoid bound of the MJCPS can be given as:
εx(Up,1)={x(k)|E{xT(k)UPx(k)|x0,r0}≤1,x(k)∈Rn,UP>0}. |
Lemma 1. [26] For a given symmetric matrix R>0, a sequence of discrete-time variable δ:Z[γ1,γ2]→Rn, and integers 0≤γ1≤γ2,
(γ2−γ1)γ2−1∑δ=γ1xT(δ)Rx(δ)≥ΩT1RΩ1+3ΩT2RΩ2, | (2.9) |
where
Ω1=x(γ2)−x(γ1),Ω2=x(γ2)+x(γ1)−2γ2−γ1+1γ2∑δ=γ1x(δ). |
Lemma 2. [27] For a real scalar 0<χ<1, real matrices D1>0,D2>0 and an arbitrary matrix N, we obtain
[1χD10011−χD2]≥[D1+(1−χ)(D1−ND−12NT)N∗D2+χ(D2−NTD−11N)]. | (2.10) |
Lemma 3. [28] Consider the MJCPS (2.1) with a well-squared bounded external disturbance, assuming that V(xk,rk) is an L-K functional satisfying the initial condition V(x0,r0)=0 and w(k) satisfies (2.2). If there exists a scalar β∈(0,1), for any ∀k≥0: E[V(xk+1,rk+1)|xk,rk]−βV(xk,rk)−1−βϖwT(k)w(k)≤0, then E[V(xk,rk)|x0,r0]≤1.
In this part, we give the analysis of reachable set estimation for the MJCPS (2.1). First, the range of the reachable set for the MJCPS is obtained by estimation in Theorem 1. Second, the controller gain of the MJCPS reachable set controller is obtained in Theorem 2. Define the following symbols:
η(k)=[xT(k),xT(k−dm),xT(k−d(k)),xT(k−dM),xT(k−σ(k)),xT(k−σM),ξT(˜x(k−σ(k))),mT1(k),mT2(k),mT3(k),mT4(k),mT5(k),eTx,wT(k)]T, |
with
m1(k)=2dm+1k∑δ=k−dmx(δ),m2(k)=2d(k)−dm+1k−dm∑δ=k−d(k)x(δ),m3(k)=2dM−d(k)+1k−d(k)∑δ=k−dMx(δ),m4(k)=2σ(k)+1k∑δ=k−σ(k)x(δ),m5(k)=2σM−σ(k)+1k−σ(k)∑δ=k−σMx(δ). |
Theorem 1. For given scalars dM,dm,σM,ϑ0,ˆα, and the matrix GM, if there is a scalar 0<β<1, positive definite matrices Pi(i=1,…,7),Up∈Rn×n, Ni(i=1,…,4)∈R2n×2n, such that, for ∀p∈N :
ΨP1=[Γp|d(k)=dm,σ(k)=0φT2N2φT4N4∗−1βdMX20∗∗−1βσMX3]<0, | (3.1) |
ΨP2=[Γp|d(k)=dm,σ(k)=σMφT2N2φT5NT3∗−1βdMX20∗∗−1βσMX3]<0, | (3.2) |
ΨP3=[Γp|d(k)=dM,σ(k)=0φT3NT1φT4N4∗−1βdMX20∗∗−1βσMX3]<0, | (3.3) |
ΨP4=[Γp|d(k)=dM,σ(k)=σMφT3NT1φT5NT3∗−1βdMX20∗∗−1βσMX3]<0, | (3.4) |
where
Γp=[TplTpΠp1(e5−e13)TGTMUp∗Π20∗∗−Up],Tp=Φp1+Φ2+Φ3+Φp4+Φ5−1−βϖeT14e14,Φp1=−βeT1Upe1+ϑ(k)eT5Qe5−eT7Upe7−eT13Qe13,Φ2=eT1(P1+P2+P3+P4)e1−βdMeT3P1e3−βσMeT6P2e6−βdmeT2P3e2−βdMeT4P4e4+dmMeT1P1e1,Φ3=eT1(d2mP5+d2mMP6+σ2MP7)e1−βdmφT1X1φ1−βdM[φT2φT3]E[φ2φ3]−βσM[φT4φT5]F[φ4φ5],dmM=dM−dm,Πp1=(√πp1Up,√πp2Up,...,√πpNUp),Πp2=diag{−UpU−11Up,−UpU−12Up,...,−UpU−1NUp},Xγ=[Pγ+40∗3Pγ+4](γ=1,2,3),φγ=[eγ−eγ+1eγ+eγ+1−eγ+7](γ=1,2,3),φγ=[e1−eγ+1e1+eγ+1−eγ+7](γ=4,5),E=[2dM−d(k)−dmdmMX2dM−d(k)dmMN1+d(k)−dmdmMN2∗dM+d(k)−2dmdmMX2],F=[2σM−σ(k)σMX3σM−σ(k)σMN3+σ(k)−σmσMN4∗σM+σ(k)σMX3],lp=Ape1+(1−ˆα)BpKpe5+ˆαBpKpe7+Fpe3−(1−ˆα)BpKpe13+Dpe14,eγ=[0n×(γ−1)n,In×n,0n×(13−γ)×n,0n×l](γ=1,2,…,13),e14=[0l×13n,Il×l], | (3.5) |
the ellipsoid set εx(Up,1) is a reachable set of the MJCPS (2.8).
Proof: We choose the L-K functional:
V(k,xk,rk)=V1(k,xk,rk)+3∑i=2Vi(k,xk). | (3.6) |
where
V1(k,xk,rk)=xT(k)Upx(k),V2(k,xk)=k−1∑δ=k−d(k)βk−δ−1xT(δ)P1x(δ)+k−1∑δ=k−σMβk−δ−1xT(δ)P2x(δ)+k−1∑δ=k−dmβk−δ−1xT(δ)P3x(δ)+k−1∑δ=k−dMβk−δ−1xT(δ)P4x(δ)+k−dm∑γ=k−dM+1k−1∑δ=γβk−δ−1xT(δ)P1x(δ),V3(k,xk)=dm−1∑γ=−dmk−1∑δ=k+γβk−δ−1xT(δ)P5x(δ)+dmM−dm∑γ=−dMk−1∑δ=k+γβk−δ−1xT(δ)P6x(δ)+σM−1∑γ=−σMk−1∑δ=k+γβk−δ−1xT(δ)P7x(δ). |
Define ΔV(k,xk,rk) as the forward difference, then we have:
ΔV1(k,xk,rk)=(β−1)V1(k,xk,rk)+xT(k)lTp∑q∈NπpqUqlpx(k)−xT(k)βUpx(k)=(β−1)V1(k,xk,rk)+ηT(k)(Φp0+Φp1s)η(k), | (3.7) |
where Φp0=∑q∈NπpqlTpUqlp.
ΔV2(k,xk)≤OTWO+k−dm∑δ=k−dM+1βk−δxT(δ)P1x(δ)+dmMxT(k)P1x(k)−k−dm∑δ=k−dM+1βk−δxT(δ)P1x(δ),=(β−1)V2(k,xk)+ηT(k)Φ2η(k), | (3.8) |
where
O=[xT(k),xT(k−d(k)),xT(k−dm),xT(k−dM)]T,W=diag{P1+P2+P3+P4,−βdMP1,−βdmP3,−βdM(P2+P4)}. |
ΔV3(k,xk)=(β−1)V3(k,xk)+d2mxT(k)P5x(k)+d2mMxT(k)P6x(k)−dmk−1∑δ=k−dmβk−δxT(δ)P5x(δ)−dmMk−dm−1∑δ=k−dMβk−δxT(δ)P6x(δ)−σMk−1∑δ=k−σMβk−δxT(δ)P7x(δ)≤(β−1)V3(k,xk)+d2mxT(k)P5x(k)+d2mMxT(k)P6x(k)+σ2MxT(k)P7x(k)−dmβdmk−1∑δ=k−dmxT(δ)P5x(δ)−dmMβdMk−dm−1∑δ=k−dMxT(δ)P6x(δ)−σMβσMk−1∑δ=k−σMxT(δ)P7x(δ). | (3.9) |
Those can be obtained by Lemma 1:
−dmβdmk−1∑δ=k−dmxT(δ)P5x(δ)≤−βdmηT(k)φ1TX1φ1η(k). | (3.10) |
−dmMβdMk−dm−1∑δ=k−dMxT(δ)P6x(δ)=−dmMβdM(k−dm−1∑δ=k−d(k)+k−d(k)−1∑δ=k−dM)xT(δ)P6x(δ)≤−dmMβdMd(k)−dmηT(k)φ2TX2φ2η(k)−dmMβdMdM−d(k)ηT(k)φ3TX2φ3η(k). | (3.11) |
It is estimated by Lemma 2 that:
−ηT(k)φ2T(dmMβdMd(k)−dmX2)φ2η(k)−ηT(k)φ3T(dmMβdMdM−d(k)X2)φ3η(k)≤−βdM[φ2η(k)φ3η(k)]TE[φ2η(k)φ3η(k)]+βdMdM−d(k)dmM(ηT(k)φ2TN2X−12NT2φ2η(k))+βdMd(k)−dmdmM(ηT(k)φ3TNT1X−12N1φ3η(k)), | (3.12) |
and using the same processing method as (3.12), the another integral term can be estimated as:
−σMβσMk−1∑δ=k−σMxT(δ)P7x(δ) | (3.13) |
≤−βσM[φ4η(k)φ5η(k)]TF[φ4η(k)φ5η(k)]+βσMσM−σ(k)σM(ηT(k)φ4TN4X−13NT4φ4η(k))+βσMσ(k)σM(ηT(k)φ5TNT3X−13N3φ5η(k)). | (3.14) |
Therefore, it can be obtained that:
ΔV3(k,xk)≤(β−1)V3(k,xk)+ηT(k)(Φ3+˜Φ3)η(k), | (3.15) |
where
˜Φ3=βdMdM−d(k)dmM(φ2TN2X−12NT2φ2)+βdMd(k)−dmdmM(φ3TNT1X−12N1φ3)+βσMσM−σ(k)σM(φ4TN4X−13NT4φ4)+βσMσ(k)σM(φ5TNT3X−13N3φ5). |
In addition, assuming the attacks signal ξ(x(k−σ(k))) satisfies (2.7), we have:
˜xT(k−σ(k))GTMUpGM˜x(k−σ(k))−ξT(˜x(k−σ(k)))Upξ(˜x(k−σ(k)))≥0. | (3.16) |
Meanwhile, from (2.5), we can get:
ϑ(k)xT(k−σ(k))Qx(k−σ(k))−eTxQex≥0. | (3.17) |
Combining (3.7)–(3.17), we get:
ΔV(k,xk,rk)≤(β−1)V(k,xk,rk)+ηT(k)Φpη(k), | (3.18) |
where
Φp=Φp0+Φp1+Φ2+Φ3+˜Φ3+˜Φ4p,Φp1=Φp1s+ϑ(k)eT5Qe5−eT7Upe7−eT13Qe13,˜Φ4p=(e5−e13)TGTMUpGM(e5−e13). |
To obtain the reachable set of the MJCPS (2.1), the following function is defined:
J=E[V(k+1,xk+1,rk+1)|k,xk,rk]−βV(k,xk,rk)−1−βϖw(k)Tw(k). | (3.19) |
Combining (3.18) and (3.19), we get:
J≤ηT(k)ˉΦpη(k), | (3.20) |
where ˉΦp=Φp−1−βϖw(k)Tw(k).
By using the Schur complement, if (3.1)–(3.4) hold, ˉΦp≤0 holds, which means E[V(k+1,xk+1,rk+1)|k,xk,rk]−βV(k,xk,rk)−1−βϖwTw ≤0 holds, then based on Lemma 3, E[xT(k)Upx(k)]≤1 holds. This completes the proof.
Remark 3. In general, after constructing the L-K functional, the reachable set estimation result, which is obtained by applying the Jensen summation inequality to handle summation terms, tends to be conservative. In order to reduce conservatism, researchers have adopted many methods, which also increase the difficulty of computation [29]. This paper employs the Wirtinger inequality and improved extended reciprocally convex matrix inequality to estimate the integral term, which reduce the conservatism of the results and the complexity of the calculation. At the same time, by designing V2(k,xk), two summation terms are cleverly eliminated in ΔV2(k,xk). In addition, more time-varying delays and system information are introduced. These further reduce conservatism of the results and calculation difficulty.
Remark 4. In this paper, the problem of reachable sets for the discrete-time MJCPS under FDI attacks is studied for the first time. Unlike the result of previous studies, this paper considers the effect of unfavorable factors such as time-varying delays information, mode jumps, and FDI attacks. Considering these factors makes it difficult to design the controller. In addition, it is also difficult to reduce the conservatism of the results and the complexity of the calculation at the same time. In order to solve these difficulties, the L-K functional with more time-varying delays is constructed, and the satisfactory results are obtained through the Wirtinger inequality and improved extended reciprocally convex matrix inequality techniques.
In this part, the reachable set controller is designed and obtained.
Theorem 2. For given scalars dM,dm,σM,ϑ0,ˆα, and matrices GM,Θ, if there is a scalar 0<β<1, positive definite matrices are ˆPpi(i=1,…,7),Hp∈Rn×n, ˆNip(i=1,…,4)∈R2n×2n,ˆKp∈Rm×n, such that, for ∀p∈N:
[−HPHP∗−Θ−1]<0, | (3.21) |
ˆΨP1=[ˆΓp|d(k)=dm,σ(k)=0φT2ˆN2pφT4ˆN4p∗−1βdMˆXp20∗∗−1βσMˆXp3]<0, | (3.22) |
ˆΨP2=[ˆΓp|d(k)=dm,σ(k)=σMφT2ˆN2pφT5ˆNT3p∗−1βdMˆXp20∗∗−1βσMˆXp3]<0, | (3.23) |
ˆΨP3=[ˆΓp|d(k)=dM,σ(k)=0φT3ˆNT1pφT4ˆNT4p∗−1βdMˆXp20∗∗−1βσMˆXp3]<0, | (3.24) |
ˆΨP4=[ˆΓp|d(k)=dM,σ(k)=σMφT3ˆNT1pφT5ˆNT3p∗−1βdMˆXp20∗∗−1βσMˆXp3]<0, | (3.25) |
where
ˆΓP=[ˆTp^lpˆΠp1(e5−e13)THTpGTM∗ˆΠ20∗∗−HTp],ˆTp=ˆΦp1+ˆΦp2+ˆΦp3+ˆΦp4+Φp5−1−βϖeT14e14,ˆΦp1=−βeT1Hpe1+ϑ(k)eT5ˆQe5−eT7Hpe7−eT13ˆQe13,ˆΦp2=eT1(ˆPp1+ˆPp2+ˆPp3+ˆPp4)−βdMeT3ˆPp1e3−βσMeT6ˆPp2e6−βdmeT2ˆPp3e2−βdMeT4ˆPp4e4+dmMeT1ˆPp1e1,ˆΦp3=eT1(d2mˆPp5+d2mMˆPp6+σ2MˆPp7)e1−βdmφT1ˆXp1φ1−βdM[φT2φT3]ˆEp[φ2φ3]−βσM[φT4φT5]ˆFp[φ4φ5],ˆΠp1=(√πp1,√πp2,...,√πpN),ˆΠ2=diag{−H1,−H2,...,−HN},ˆXpγ=[ˆPpγ+40∗3ˆPpγ+4](γ=1,2,3),ˆEp=[2dM−d(k)−dmdmMˆXp2dM−d(k)dmMˆN1p+d(k)−dmdmMˆN2p∗dM+d(k)−2dmdmMˆXp2],ˆFp=[2σM−σ(k)σMˆXp3σM−σ(k)σMˆN3p+σ(k)−σmσMˆN4p∗σM+σ(k)σMˆXp3],^lp=ApHpe1+(1−α(k))Bp^Kpe5+α(k)Bp^Kpe7+FpHpe3−(1−α(k))Bp^Kpe13+Dpe14. |
Then, controller gains are given by Kp=^KpHp and the reachable set of (2.8) is defined by εx(Θ,1).
Proof. Define Hp=U−1P,ˆPpi=HTpPiHp(i=1,…,7),ˆNip=HTpNiHp(i=1,…,4), ˆQ=HTpQHp,^Kp=KpH−1p,hp=diag{Hp…Hp⏟13,I,Hp…Hp⏟N+5}.
By pre-multiplying and post-multiplying LMIs (3.1)–(3.4) with hTp and hp, we get:
hTpΨpihp=ˆΨpi(i=1,…,4), | (3.26) |
where ˆΨpi(i=1,…,4) are defined in (3.22)-(3.25). If ˆΨpi<0(i=1,…,4) hold, that means hTpΨpihp<0(i=1,…,4) are true, so Ψpi<0(i=1,…,4).
Then, combining Theorem 1:
E[xT(k)Hpx(k)]≤1, | (3.27) |
from LMI (3.21), we obtain −Hp+HTpΘHp<0. Due to Hp=U−1p, we get −Up+Θ<0. Eventually, we get:
E[xT(k)Θx(k)]≤E[xT(k)Upx(k)]≤1. | (3.28) |
Therefore, when (3.21)–(3.25) are satisfied, the reachability set of the system can be obtained, and the controller gain Kp of the MJCPS can be obtained by solving Kp=^KpHp. This completes the proof.
In this part, a practical example is given to verify the validity of the reachable set control method to the MJCPS (2.1).
Example. (Boost converter circuit system) In order to verify the validity of the result, example Boost converter circuit system is used for verification [30]. The corresponding parameters and known matrices are set as follows:
A1=[1−0.22−0.2],B1=[0.20],D1=[−0.040.02],F1=[−0.1−0.0200.01],A2=[1000.8],B2=[0.20],D2=[0.1−0.1],F2=[0.20.10.3−0.1]. |
Also, given scalars dM=2,dm=1,σM=1,ϑ0=0.15,ˆα=0.5, and matrices GM=[0.01000.02], Θ=[0.5389000.5389],Π=[0.80.20.30.7], one of the Markov jump processes is shown in Figure 2.
The random external disturbances signal conforming to ‖w(k)‖≤0.3 is selected and shown in Figure 3. The FDI attacks signal is [−tanh(0.1x1(k))tanh(0.01x2(k))]T and shown in Figure 4.
The resident time and trigger time of adaptive event-triggered control strategy are shown in Figure 5. It can be found that after the adaptive event-triggered control strategy is added to the MJCPS, the event generator triggers a total of 59 times within 100 seconds, effectively saving network resources and improving transmission efficiency.
By using LMI solving technology, the value range of β is [ 0.875, 1). We select β=0.88, then the controller gain Kp can be solved.
K1=[−3.06860.7565],K2=[−6.4315−0.3777]. |
The ellipsoid reachable set ε(Θ,1) of all states that the MJCPS can reach from the initial state is shown in Figure 6. It can be seen that all states of the MJCPS are in the ellipsoid range, which proves that the designed controller is effective.
In this paper, the reachable set problem of MJCPS (2.1) with time-varying delays and external disturbances under FDI attacks is studied for the first time. To begin, by selecting the L-K functional with delays information and combining the discrete Wirtinger inequality and the improved extended reciprocally convex matrix inequality, the conservatism and computational difficulty of the result are reduced. Additionally, the adaptive event-triggered control strategy is introduced to reduce the waste of network resources. At the same time, it reduces the impact of FDI attacks and external disturbances on the MJCPS security. What's more, the controller gain of the MJCPS is obtained by using LMI technology. Finally, the validity of the research results is verified by the circuit simulation of the boost converter circuit system.
All authors contributed to the study conception and design. The first manuscript was written by Sheng-Ran Jia. Wen-Juan Lin provided guidance and comments on the manuscript. All authors have read and approved the final version of the manuscript for publication.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work was supported in part by the National Natural Science Foundation of China (Grant No. 62103213), the Shandong Provincial Natural Science Foundation (Grant No. 2023HWYQ-086, ZR2021QF002), the China Postdoctoral Science Foundation (Grant No. 2022M721748), and in part by Young Talent of Lifting engineering for Science and Technology in Shandong, China.
The authors declare no conflict of interest.
[1] |
V. Gunes, S. Peter, T. Givargis, F. Vahid, A survey on concepts, applications, and challenges in cyber-physical systems, KSII T. Internet Inf., 8 (2014), 4242–4268. https://doi.org/10.3837/tiis.2014.12.001 doi: 10.3837/tiis.2014.12.001
![]() |
[2] |
M. S. Ali, S. Arik, R. Saravanakumar, Delay-dependent stability criteria of uncertain Markovian jump neural networks with discrete interval and distributed time-varying delays, Neurocomputing, 158 (2015), 167–173. https://doi.org/10.1016/j.neucom.2015.01.056 doi: 10.1016/j.neucom.2015.01.056
![]() |
[3] |
M. Q. Xing, Y. Q. Wang, G. M. Zhuang, F. Chen, Event-based asynchronous and resilient filtering for singular Markov jump LPV systems against deception attacks, Appl. Math. Comput., 403 (2021), 126176. https://doi.org/10.1016/j.amc.2021.126176 doi: 10.1016/j.amc.2021.126176
![]() |
[4] |
H. Y. Chen, G. D. Zong, X. Liu, X. D. Zhao, B. Niu, F. Z. Gao, A sub-domain-awareness adaptive probabilistic event-triggered policy for attack-compensated output control of Markov jump CPSs with dynamically matching modes, IEEE T. Autom. Sci. Eng., 21 (2024), 4419–4431. https://doi.org/10.1109/TASE.2023.3296259 doi: 10.1109/TASE.2023.3296259
![]() |
[5] |
W. H. Qi, C. Y. Lv, J. H. Park, G. D. Zong, J. Cheng, K. B. Shi, SMC for Semi-Markov jump cyber-physical systems subject to randomly occurring deception attacks, IEEE T. Circuits-Ⅱ, 69 (2022), 159–163. https://doi.org/10.1109/TCSII.2021.3076132 doi: 10.1109/TCSII.2021.3076132
![]() |
[6] |
H. Y. Yang, H. G. Han, S. Yin, H. Y. Han, P. Wang, Sliding mode-based adaptive resilient control for Markovian jump cyber-physical systems in face of simultaneous actuator and sensor attacks, Automatica, 142 (2022), 110345. https://doi.org/10.1016/j.automatica.2022.110345 doi: 10.1016/j.automatica.2022.110345
![]() |
[7] |
H. Q. Lu, X. W. Wang, W. N. Zhou, Y. X. Gou, Hybrid-driven-based H∞ filtering for networked systems under randomly occurring deception attacks, J. Franklin Ⅰ., 359 (2022), 6544–6566. https://doi.org/10.1016/j.jfranklin.2022.05.049 doi: 10.1016/j.jfranklin.2022.05.049
![]() |
[8] |
H. L. Ren, G. D. Zong, X. L. Qian, W. C. Yue, K. B. Shi, Hybrid event-based asynchronous finite-time control for cyber-physical switched systems under denial-of-service attacks, J. Franklin Ⅰ., 360 (2023), 1036–1057. https://doi.org/10.1016/j.jfranklin.2022.11.028 doi: 10.1016/j.jfranklin.2022.11.028
![]() |
[9] |
Z. H. Pang, L. Z. Fan, J. Sun, K. Liu, G. P. Liu, Detection of stealthy false data injection attacks against networked control systems via active data modification, Inform. Sciences, 546 (2021), 192–205. https://doi.org/10.1016/j.ins.2020.06.074 doi: 10.1016/j.ins.2020.06.074
![]() |
[10] |
W. J. Lin, Y. He, M. Wu, Q. P. Liu, Reachable set estimation for Markovian jump neural networks with time-varying delay, Neural Networks, 108 (2018), 527–532. https://doi.org/10.1016/j.neunet.2018.09.011 doi: 10.1016/j.neunet.2018.09.011
![]() |
[11] |
Q. R. Zhang, K. Liu, Z. H. Pang, Y. Q. Xia, T. Liu, Reachability analysis of cyber-physical systems under stealthy attacks, IEEE T. Cybernetics, 52 (2022), 4926–4934. https://doi.org/10.1109/TCYB.2020.3025307 doi: 10.1109/TCYB.2020.3025307
![]() |
[12] |
X. Y. Fan, W. J. Lin, Z. Liu, L. Zhao, Reachable set control for nonlinear Markov jump cyber-physical systems with false data injection attacks, J. Franklin Ⅰ., 361 (2024), 224–233. https://doi.org/10.1016/j.jfranklin.2023.12.013 doi: 10.1016/j.jfranklin.2023.12.013
![]() |
[13] |
F. Farivar, M. S. Haghighi, A. Jolfaei, M. Alazab, Artificial intelligence for detection, estimation, and compensation of malicious attacks in nonlinear cyber-physical systems and industrial IoT, IEEE T. Ind. Inform., 16 (2020), 2716–2725. https://doi.org/10.1109/TII.2019.2956474 doi: 10.1109/TII.2019.2956474
![]() |
[14] |
J. X. Hu, G. Q. Tan, L. Liu, A new result on H∞ state estimation for delayed neural networks based on an extended reciprocally convex inequality, IEEE T. Circuits-II, 71 (2024), 1181–1185. https://doi.org/10.1109/TCSII.2023.3323834 doi: 10.1109/TCSII.2023.3323834
![]() |
[15] |
C. C. Qin, W. J. Lin, Adaptive event-triggered fault-tolerant control for Markov jump nonlinear systems with time-varying delays and multiple faults, Commun. Nonlinear Sci., 128 (2024), 107655. https://doi.org/10.1016/j.cnsns.2023.107655 doi: 10.1016/j.cnsns.2023.107655
![]() |
[16] |
G. Q. Tan, Z. S. Wang, Stability analysis of recurrent neural networks with time-varying delay based on a flexible negative-determination quadratic function method, IEEE T. Neur. Net. Lear., 2023 (2023), 1–6. https://doi.org/10.1109/TNNLS.2023.3327318 doi: 10.1109/TNNLS.2023.3327318
![]() |
[17] |
X. Jin, W. M. Haddad, T. Yucelen, An adaptive control architecture for mitigating sensor and actuator attacks in cyber-physical systems, IEEE T. Automat. Contr., 62 (2017), 6058–6064. https://doi.org/10.1109/TAC.2017.2652127 doi: 10.1109/TAC.2017.2652127
![]() |
[18] |
S. A. Karthick, B. S. Chen, Hybrid-triggered and fault-tolerant observer-based control for neural networks under malicious attacks, Neurocomputing, 532 (2023), 114–128. https://doi.org/10.1016/j.neucom.2023.02.009 doi: 10.1016/j.neucom.2023.02.009
![]() |
[19] |
W. L. He, Z. K. Mo, Secure event-triggered consensus control of linear multiagent systems subject to sequential scaling attacks, IEEE T. Cybernetics, 52 (2022), 10314–10327. https://doi.org/10.1109/TCYB.2021.3070356 doi: 10.1109/TCYB.2021.3070356
![]() |
[20] |
K. X. Sun, Y. Q. Wang, G. M. Zhuang, J. H. Wang, Asynchronous secure controller design for singularly perturbation stochastic semi-Markov jump CPSs with the memory-based dynamic event-triggered scheme against complex cyber-attacks, Commun. Nonlinear Sci., 125 (2023), 107408. https://doi.org/10.1016/j.cnsns.2023.107408 doi: 10.1016/j.cnsns.2023.107408
![]() |
[21] |
Q. Zhang, Z. W. Guo, Y. Y. Zhu, P. Vijayakumar, A. Castiglione, B. B. Gupta, A deep learning-based fast fake news detection model for cyber-physical social services, Pattern Recogn. Lett., 168 (2023), 31–38. https://doi.org/10.1016/j.patrec.2023.02.026 doi: 10.1016/j.patrec.2023.02.026
![]() |
[22] |
D. Yue, E. G. Tian, Q. L. Han, A delay system method for designing event-triggered controllers of networked control systems, IEEE T. Automat. Contr., 58 (2013), 475–481. https://doi.org/10.1109/TAC.2012.2206694 doi: 10.1109/TAC.2012.2206694
![]() |
[23] |
R. R. Wu, N. F. Zhong, M. H. Sun, Dynamic event-triggered non-fragile filtering for singular Markovian jump systems with packet dropouts, Eur. J. Control, 78 (2024), 101018. https://doi.org/10.1016/j.ejcon.2024.101018 doi: 10.1016/j.ejcon.2024.101018
![]() |
[24] |
Y. J. Liu, S. H. Liu, Y. Z. Liu, S. M. Lee, Adaptive event-triggered dissipative control for semi-Markovian jump systems with stochastic deception attack, J. Franklin Ⅰ., 360 (2023), 12358–12377. https://doi.org/10.1016/j.jfranklin.2023.09.037 doi: 10.1016/j.jfranklin.2023.09.037
![]() |
[25] |
W. J. Lin, Q. L. Han, X. M. Zhang, J. P. Yu, Reachable set synthesis of Markov jump systems with time-varying delays and mismatched modes, IEEE T. Circuits-Ⅱ, 69 (2022), 2186–2190. https://doi.org/10.1109/TCSII.2021.3126262 doi: 10.1109/TCSII.2021.3126262
![]() |
[26] |
A. Seuret, F. Gouaisbaut, Wirtinger-based integral inequality: application to time-delay systems, Automatica, 49 (2013), 2860–2866. https://doi.org/10.1016/j.automatica.2013.05.030 doi: 10.1016/j.automatica.2013.05.030
![]() |
[27] |
C. K. Zhang, Y. He, L. Jiang, M. Wu, Q. G. Wang, An extended reciprocally convex matrix inequality for stability analysis of systems with time-varying delay, Automatica, 85 (2017), 481–485. https://doi.org/10.1016/j.automatica.2017.07.056 doi: 10.1016/j.automatica.2017.07.056
![]() |
[28] |
N. Malone, H. T. Chiang, K. Lesser, M. Oishi, L. Tapia, Hybrid dynamic moving obstacle avoidance using a stochastic reachable set-based potential field, IEEE T. Robot., 33 (2017), 1124–1138. https://doi.org/10.1109/TRO.2017.2705034 doi: 10.1109/TRO.2017.2705034
![]() |
[29] |
X. L. Wang, J. W. Xia, J. Wang, Z. Wang, J. Wang, Reachable set estimation for Markov jump LPV systems with time delays, Appl. Math. Comput., 376 (2020), 125117. https://doi.org/10.1016/j.amc.2020.125117 doi: 10.1016/j.amc.2020.125117
![]() |
[30] |
H. Y. Chen, G. D. Zong, F. Z. Gao, Y. Shi, Probabilistic event-triggered policy for extended dissipative finite-time control of MJSs under cyber-attacks and actuator failures, IEEE T. Automat. Contr., 68 (2023), 7803–7810. https://doi.org/10.1109/TAC.2023.3246429 doi: 10.1109/TAC.2023.3246429
![]() |