Pub Date : 2026-02-01Epub Date: 2025-09-11DOI: 10.1016/j.nahs.2025.101634
Mingyu Wang , Xiaofeng Zong , Xin Chen
This paper investigates the finite-time stability of a jump diffusion system with Brownian motion and random jump components. First, we establish a novel Lyapunov-type finite-time stability theorem, which provides a direct way for selecting an appropriate Lyapunov function. It is important to note that our finite-time stability result is significantly distinct from the case involving only Brownian motion. The presence of the jump term disrupts the continuity of the system’s solution paths, thereby introducing additional complexities in the analysis of finite-time stability. Subsequently, we employ this theorem to design a finite-time controller to ensure the finite-time stochastic stability of the tracking error in a drill-bit system. The proposed control strategy guarantees that the tracking error converges to the origin within finite time and remains there thereafter with probability one. Finally, simulation results are presented to validate the effectiveness of the proposed control law in achieving precise drill-bit tracking control.
{"title":"Finite-time stability of jump diffusion system and its application in drill-bit tracking control","authors":"Mingyu Wang , Xiaofeng Zong , Xin Chen","doi":"10.1016/j.nahs.2025.101634","DOIUrl":"10.1016/j.nahs.2025.101634","url":null,"abstract":"<div><div>This paper investigates the finite-time stability of a jump diffusion system with Brownian motion and random jump components. First, we establish a novel Lyapunov-type finite-time stability theorem, which provides a direct way for selecting an appropriate Lyapunov function. It is important to note that our finite-time stability result is significantly distinct from the case involving only Brownian motion. The presence of the jump term disrupts the continuity of the system’s solution paths, thereby introducing additional complexities in the analysis of finite-time stability. Subsequently, we employ this theorem to design a finite-time controller to ensure the finite-time stochastic stability of the tracking error in a drill-bit system. The proposed control strategy guarantees that the tracking error converges to the origin within finite time and remains there thereafter with probability one. Finally, simulation results are presented to validate the effectiveness of the proposed control law in achieving precise drill-bit tracking control.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101634"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145046680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-09-18DOI: 10.1016/j.nahs.2025.101643
Bhim Kumar, Muslim Malik
This paper investigates the finite-time stability and stabilization of impulsive positive switched delay systems defined on arbitrary time scales, using Lyapunov function-based methods. The finite-time stabilization problem is solved using state feedback controllers on time scales. Furthermore, the applicability of the proposed finite-time stability criteria is demonstrated for positive switched multi-agent delay systems by designing an event-triggered controller on time scales. The analysis extends the existing results to incorporate hybrid time domains with time-dependent switching and provide sufficient conditions for the system’s stability and stabilization within the specified time period. To demonstrate the results of this paper, several numerical and simulation-based examples are presented by considering continuous, discrete, and hybrid time domains simultaneously.
{"title":"Finite-time stability and stabilization of positive switched delay systems with non-instantaneous impulses on time scales and applications to multi-agent systems","authors":"Bhim Kumar, Muslim Malik","doi":"10.1016/j.nahs.2025.101643","DOIUrl":"10.1016/j.nahs.2025.101643","url":null,"abstract":"<div><div>This paper investigates the finite-time stability and stabilization of impulsive positive switched delay systems defined on arbitrary time scales, using Lyapunov function-based methods. The finite-time stabilization problem is solved using state feedback controllers on time scales. Furthermore, the applicability of the proposed finite-time stability criteria is demonstrated for positive switched multi-agent delay systems by designing an event-triggered controller on time scales. The analysis extends the existing results to incorporate hybrid time domains with time-dependent switching and provide sufficient conditions for the system’s stability and stabilization within the specified time period. To demonstrate the results of this paper, several numerical and simulation-based examples are presented by considering continuous, discrete, and hybrid time domains simultaneously.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101643"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145096589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-10-07DOI: 10.1016/j.nahs.2025.101629
Eric Goubault, Sylvie Putot
We propose an approach for computing inner and outer-approximations of the sets of values that satisfy constraints expressed as arbitrarily quantified formulas. Such formulas arise for example when specifying important problems in control such as robustness, motion planning and controller comparison. We propose an interval-based method which allows for tight but tractable approximations. We demonstrate its applicability through a series of examples and benchmarks using a prototype implementation. Finally, we develop higher-order methods, particularly tractable order one methods which provide even tighter results.
{"title":"Inner and outer approximations of arbitrarily quantified reachability problems","authors":"Eric Goubault, Sylvie Putot","doi":"10.1016/j.nahs.2025.101629","DOIUrl":"10.1016/j.nahs.2025.101629","url":null,"abstract":"<div><div>We propose an approach for computing inner and outer-approximations of the sets of values that satisfy constraints expressed as arbitrarily quantified formulas. Such formulas arise for example when specifying important problems in control such as robustness, motion planning and controller comparison. We propose an interval-based method which allows for tight but tractable approximations. We demonstrate its applicability through a series of examples and benchmarks using a prototype implementation. Finally, we develop higher-order methods, particularly tractable order one methods which provide even tighter results.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101629"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145267873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-10-11DOI: 10.1016/j.nahs.2025.101648
Wei Ren
This paper addresses the state estimation problem of multi-agent systems under multiple networks and event-triggered mechanisms. Multiple networks are to accommodate physical separation of different agents, while event-triggered mechanisms are to address the resource constraints of networks. This setting results in the distributed structure and even the simultaneous design of distributed observers and event-triggered mechanisms. We follow the emulation-based approach to propose a novel hybrid model for the state estimation of multi-agent systems. Both Lyapunov-based conditions and distributed event-triggered mechanisms are established such that the estimation errors are convergent asymptotically. The proposed approach is further implemented to deal with the distributed observer-based controller design problem of multi-agent systems. Both the general framework is established and the conditions in the form of linear matrix inequalities are derived. Finally, the derived results are illustrated via two numerical examples from inverted pendulum robots and power systems.
{"title":"Distributed event-triggered observer design for networked multi-agent systems","authors":"Wei Ren","doi":"10.1016/j.nahs.2025.101648","DOIUrl":"10.1016/j.nahs.2025.101648","url":null,"abstract":"<div><div>This paper addresses the state estimation problem of multi-agent systems under multiple networks and event-triggered mechanisms. Multiple networks are to accommodate physical separation of different agents, while event-triggered mechanisms are to address the resource constraints of networks. This setting results in the distributed structure and even the simultaneous design of distributed observers and event-triggered mechanisms. We follow the emulation-based approach to propose a novel hybrid model for the state estimation of multi-agent systems. Both Lyapunov-based conditions and distributed event-triggered mechanisms are established such that the estimation errors are convergent asymptotically. The proposed approach is further implemented to deal with the distributed observer-based controller design problem of multi-agent systems. Both the general framework is established and the conditions in the form of linear matrix inequalities are derived. Finally, the derived results are illustrated via two numerical examples from inverted pendulum robots and power systems.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101648"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145267874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-09-09DOI: 10.1016/j.nahs.2025.101630
Vishnu Murali, Ashutosh Trivedi, Majid Zamani
A barrier certificate, defined over the states of a dynamical system, is a real-valued function whose zero level set characterizes an inductively verifiable state invariant separating reachable states from unsafe ones. When combined with powerful decision procedures — such as sum-of-squares programming (SOS) or satisfiability-modulo-theory solvers (SMT) — barrier certificates enable an automated deductive verification approach to safety. The barrier certificate approach has been extended to refute LTL and -regular specifications by separating consecutive transitions of corresponding -automata in the hope of denying all accepting runs. Unsurprisingly, such tactics are bound to be conservative as refutation of recurrence properties requires reasoning about ranking functions to prove liveness as well. This paper introduces the notion of closure certificates as a natural extension of barrier certificates from state invariants to transition invariants. We show how one may use ranking function arguments over such certificates to verify discrete-time dynamical systems against Linear Temporal logic formulae. We augment these definitions with SOS and SMT based characterization for automating the search of closure certificates and demonstrate their effectiveness over some case studies.
{"title":"Closure certificates","authors":"Vishnu Murali, Ashutosh Trivedi, Majid Zamani","doi":"10.1016/j.nahs.2025.101630","DOIUrl":"10.1016/j.nahs.2025.101630","url":null,"abstract":"<div><div>A <em>barrier certificate</em>, defined over the states of a dynamical system, is a real-valued function whose zero level set characterizes an inductively verifiable <em>state invariant</em> separating reachable states from unsafe ones. When combined with powerful decision procedures — such as sum-of-squares programming (SOS) or satisfiability-modulo-theory solvers (SMT) — barrier certificates enable an automated deductive verification approach to safety. The barrier certificate approach has been extended to refute LTL and <span><math><mi>ω</mi></math></span>-regular specifications by separating consecutive transitions of corresponding <span><math><mi>ω</mi></math></span>-automata in the hope of denying all accepting runs. Unsurprisingly, such tactics are bound to be conservative as refutation of <em>recurrence properties</em> requires reasoning about ranking functions to prove liveness as well. This paper introduces the notion of <em>closure certificates</em> as a natural extension of barrier certificates from state invariants to transition invariants. We show how one may use ranking function arguments over such certificates to verify discrete-time dynamical systems against Linear Temporal logic formulae. We augment these definitions with SOS and SMT based characterization for automating the search of closure certificates and demonstrate their effectiveness over some case studies.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101630"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145020290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-11-12DOI: 10.1016/j.nahs.2025.101659
Linye Wu , Qiyao Wang , Jitao Sun
This paper explores optimal preview control for probabilistic Boolean networks (PBNs). Over the past decade, scholars have introduced PBNs as a pioneering mathematical framework. A significant challenge involves deriving optimal strategies for PBNs to prevent unfavorable states. Our proposed methodology integrates the strengths of the semi-tensor product (STP, i.e., Cheng product) of matrices and the Exclusive-Or operator. This integration results in an extended system capable of guiding PBNs with minimal cost. Furthermore, the configurability of the cost function allows for the inclusion of various control inputs and state variables. Discrete-time Markov decision processes (DTMDPs) are employed to determine the most suitable control policies. Finally, a numerical example is presented to validate the effectiveness of the proposed preview control protocol for PBNs.
{"title":"Optimal preview control of probabilistic Boolean networks","authors":"Linye Wu , Qiyao Wang , Jitao Sun","doi":"10.1016/j.nahs.2025.101659","DOIUrl":"10.1016/j.nahs.2025.101659","url":null,"abstract":"<div><div>This paper explores optimal preview control for probabilistic Boolean networks (PBNs). Over the past decade, scholars have introduced PBNs as a pioneering mathematical framework. A significant challenge involves deriving optimal strategies for PBNs to prevent unfavorable states. Our proposed methodology integrates the strengths of the semi-tensor product (STP, i.e., Cheng product) of matrices and the Exclusive-Or operator. This integration results in an extended system capable of guiding PBNs with minimal cost. Furthermore, the configurability of the cost function allows for the inclusion of various control inputs and state variables. Discrete-time Markov decision processes (DTMDPs) are employed to determine the most suitable control policies. Finally, a numerical example is presented to validate the effectiveness of the proposed preview control protocol for PBNs.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101659"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145519771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-09-12DOI: 10.1016/j.nahs.2025.101632
Mengyao Lu, Jingyuan Zhan, Liguo Zhang
This study addresses the boundary consensus problem of multi-agent systems, in which each agent is governed by hyperbolic partial differential equations. To reduce the controller update frequency, the event-triggered boundary controller is proposed for each agent based on the boundary state information of its neighbors and itself. Firstly, we present the well-posedness and consensus analysis under undirected communication graphs. By using Lyapunov approach and graph theory, we obtain the sufficient conditions associated with triggering parameters, Laplacian eigenvalues and boundary coefficient matrices for guaranteeing the asymptotic consensus and excluding Zeno behaviors. Next, we further consider the consensus problem under the directed communication topologies, and we also establish the sufficient conditions for ensuring the asymptotic consensus. Finally, we present a three-lane freeway traffic flow system described by Aw–Rascle–Zhang Equations as an example to demonstrate the effectiveness of the designed event-triggered boundary consensus controllers.
{"title":"Event-triggered boundary consensus for multi-agent systems of hyperbolic balance laws","authors":"Mengyao Lu, Jingyuan Zhan, Liguo Zhang","doi":"10.1016/j.nahs.2025.101632","DOIUrl":"10.1016/j.nahs.2025.101632","url":null,"abstract":"<div><div>This study addresses the boundary consensus problem of multi-agent systems, in which each agent is governed by hyperbolic partial differential equations. To reduce the controller update frequency, the event-triggered boundary controller is proposed for each agent based on the boundary state information of its neighbors and itself. Firstly, we present the well-posedness and consensus analysis under undirected communication graphs. By using Lyapunov approach and graph theory, we obtain the sufficient conditions associated with triggering parameters, Laplacian eigenvalues and boundary coefficient matrices for guaranteeing the asymptotic consensus and excluding Zeno behaviors. Next, we further consider the consensus problem under the directed communication topologies, and we also establish the sufficient conditions for ensuring the asymptotic consensus. Finally, we present a three-lane freeway traffic flow system described by Aw–Rascle–Zhang Equations as an example to demonstrate the effectiveness of the designed event-triggered boundary consensus controllers.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101632"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145046681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-09-10DOI: 10.1016/j.nahs.2025.101633
Shaowen Miao , Aiwen Lai , Jan Komenda , Sébastien Lahaye
In this paper, we address the problem of initial-state detectability (I-detectability) for timed discrete-event systems modeled by time-interval automata (TIAs). An I-observer, defined over a timed event set, is developed to check both strong and weak I-detectability. Additionally, an I-detector structure is designed as an alternative method for verifying strong I-detectability, which is more efficient than the I-observer in certain cases. In addition, we are the first to formally define the concepts of strong and weak timed initial-state detectability (-I-detectability) within the framework of timed discrete-event systems. Specifically, I-detectability necessitates that the initial state of a system can be detected after a finite number of observations. From another perspective, -I-detectability entails that the initial state can be ascertained after a delay of time units. Under the assumption that every cycle in the TIA has strictly positive weight, we establish that a TIA is -I-detectable if and only if it satisfies the condition of being I-detectable. Finally, we introduce an algebraic method to compute the upper bound of time that needs to elapse before the initial state can be determined in an I-detectable TIA.
本文研究了由时间间隔自动机（TIAs）建模的时间离散事件系统的初始状态可检测性问题。在一个定时事件集上定义了一个i -观测器，用于检查强和弱i -可探测性。此外，设计了一个i检测器结构作为验证强i可探测性的替代方法，在某些情况下，它比i观察者更有效。此外，我们首次在时间离散事件系统的框架内正式定义了强和弱时间初始状态可探测性（t - i -可探测性）的概念。具体来说，i -可探测性要求系统的初始状态可以在有限次观测后被探测到。从另一个角度来看，T- i可探测性意味着在延迟T个时间单位后可以确定初始状态。在假定TIA中的每个周期都有严格正权的前提下，我们建立了TIA是t - i可检测的当且仅当它满足i可检测的条件。最后，我们引入了一种代数方法来计算在i可检测的TIA中确定初始状态所需时间的上界。
{"title":"Timed initial-state detectability of discrete-event systems by algebraic method","authors":"Shaowen Miao , Aiwen Lai , Jan Komenda , Sébastien Lahaye","doi":"10.1016/j.nahs.2025.101633","DOIUrl":"10.1016/j.nahs.2025.101633","url":null,"abstract":"<div><div>In this paper, we address the problem of initial-state detectability (I-detectability) for timed discrete-event systems modeled by time-interval automata (TIAs). An I-observer, defined over a timed event set, is developed to check both strong and weak I-detectability. Additionally, an I-detector structure is designed as an alternative method for verifying strong I-detectability, which is more efficient than the I-observer in certain cases. In addition, we are the first to formally define the concepts of strong and weak timed initial-state detectability (<span><math><mi>T</mi></math></span>-I-detectability) within the framework of timed discrete-event systems. Specifically, I-detectability necessitates that the initial state of a system can be detected after a finite number of observations. From another perspective, <span><math><mi>T</mi></math></span>-I-detectability entails that the initial state can be ascertained after a delay of <span><math><mi>T</mi></math></span> time units. Under the assumption that every cycle in the TIA has strictly positive weight, we establish that a TIA is <span><math><mi>T</mi></math></span>-I-detectable if and only if it satisfies the condition of being I-detectable. Finally, we introduce an algebraic method to compute the upper bound of time that needs to elapse before the initial state can be determined in an I-detectable TIA.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101633"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145027221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-11-06DOI: 10.1016/j.nahs.2025.101654
Xinyong Wang , Laurentiu Hetel , Ying Tang , Jimmy Lauber
In this paper the local asymptotic stability problem is investigated for a class of piecewise affine (PWA) Filippov systems. We address a particular case of PWA systems with linear switching surfaces crossing at an equilibrium resulting from sliding dynamics (Filippov/pseudo equilibrium). The PWA systems may also present other unstable equilibria. Sufficient Lyapunov-based conditions are given for characterising the local asymptotic stability of the Filippov equilibrium. Methods are proposed to estimate the domain of attraction.
{"title":"Local stability for a class of piecewise affine Filippov systems","authors":"Xinyong Wang , Laurentiu Hetel , Ying Tang , Jimmy Lauber","doi":"10.1016/j.nahs.2025.101654","DOIUrl":"10.1016/j.nahs.2025.101654","url":null,"abstract":"<div><div>In this paper the local asymptotic stability problem is investigated for a class of piecewise affine (PWA) Filippov systems. We address a particular case of PWA systems with linear switching surfaces crossing at an equilibrium resulting from sliding dynamics (Filippov/pseudo equilibrium). The PWA systems may also present other unstable equilibria. Sufficient Lyapunov-based conditions are given for characterising the local asymptotic stability of the Filippov equilibrium. Methods are proposed to estimate the domain of attraction.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101654"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145465500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-02-01Epub Date: 2025-10-16DOI: 10.1016/j.nahs.2025.101652
Yifu Feng , Zonghai Hu , Jiancun Wu , Engang Tian
Remote state estimation systems are vulnerable to malicious attacks, particularly when operating over unreliable communication networks with nonlinear dynamics. This paper proposes a stochastic critical-packet-based (SCPB) attack strategy that selectively targets packets according to their impact on the estimation process. A criticality indicator is defined as the difference between prior and posterior local estimates. Based on this indicator, a probabilistic attack mechanism is designed in which the attack success probability (ASP) increases with both packet importance and the assigned attack strength. To enhance the effectiveness of the attack, an adaptive energy adjustment scheme is introduced, assigning higher attack intensity to more critical packets. Theoretical analysis establishes explicit relationships among packet criticality, attack strength, ASP, and estimation performance degradation. Simulation results demonstrate that the proposed strategy induces significantly larger estimation errors than baseline attacks under the same average attack probability.
{"title":"Stochastic critical-packet-based attack on remote state estimation: From attackers’ perspective","authors":"Yifu Feng , Zonghai Hu , Jiancun Wu , Engang Tian","doi":"10.1016/j.nahs.2025.101652","DOIUrl":"10.1016/j.nahs.2025.101652","url":null,"abstract":"<div><div>Remote state estimation systems are vulnerable to malicious attacks, particularly when operating over unreliable communication networks with nonlinear dynamics. This paper proposes a stochastic critical-packet-based (SCPB) attack strategy that selectively targets packets according to their impact on the estimation process. A criticality indicator is defined as the difference between prior and posterior local estimates. Based on this indicator, a probabilistic attack mechanism is designed in which the attack success probability (ASP) increases with both packet importance and the assigned attack strength. To enhance the effectiveness of the attack, an adaptive energy adjustment scheme is introduced, assigning higher attack intensity to more critical packets. Theoretical analysis establishes explicit relationships among packet criticality, attack strength, ASP, and estimation performance degradation. Simulation results demonstrate that the proposed strategy induces significantly larger estimation errors than baseline attacks under the same average attack probability.</div></div>","PeriodicalId":49011,"journal":{"name":"Nonlinear Analysis-Hybrid Systems","volume":"59 ","pages":"Article 101652"},"PeriodicalIF":3.7,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145324372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号