23 January 2025 in IEEE Transactions on Automation Science and Engineering
This paper deals with the online fault diagnosis problem of discrete event systems under malicious external attacks. We consider a scenario where an attacker can intercept certain sensor measurements and alter them arbitrarily, potentially causing a diagnoser to malfunction. In the framework of labeled Petri nets, a novel integer linear programming problem is formulated by introducing binary variables to estimate the possible transition sequences of an observation that may have been tampered with by an attacker. The proposed approach makes two main contributions. The first one is that, by specifying two different objective functions to the integer linear programming problem, we can obtain the diagnosis results in the presence of attacks, which classic diagnosers may fail to achieve; the second is computational efficiency. In the absence of attacks, the proposed approach is experimentally verified to have lower computational overhead compared with the existing results that are based on integer linear programming and those using basis markings. Finally, the proposed approach is illustrated through a manufacturing system for assembling brake valves.
26 September 2025 in IEEE Transactions on Automation Science and Engineering
This paper addresses the online verification of current-state and k-step opacity in networked discrete event systems modeled with labeled Petri nets. In networked transmissions, there are two main communication disruptions, namely, delays and losses, which may result in incomplete observation sequences, thus affecting the accuracy of traditional online opacity verification methods. To solve such an issue, the notions of current-state and k-step opacity of an observation are generalized by incorporating the effects of the two disruptions. As shown in the literature, a secret is described as a subset of markings for the generality of the approach. Under the assumptions that the unobservable subnet is acyclic and the system is bounded, integer linear programming problems (ILPPs) are formulated. Then, online algorithms are designed by solving ILPPs to respectively verify the current-state and k-step opacity of an observation that may be incomplete due to communication delays and losses. Furthermore, in the absence of communication disruption, fewer constraints and variables are considered in the proposed ILPPs compared with the existing approaches, which contributes to a lower computational overhead. Finally, the efficiency and efficacy of the proposed methods are illustrated through an example and a case study.
30 March 2026 in IEEE Transactions on Automation Science and Engineering
This paper addresses the diagnosability analysis problem under malicious attacks of a networked discrete event system modeled by a labeled Petri net. A stealthy replacement attack is considered to alter or corrupt the observation of the system, in which the transition labels are replaced by others or the empty string, and its attack stealthiness requires that the corrupted observations should be contained in the behavior of system. The objective of this work is, from an attacker’s viewpoint, to design such an attack for compromising the attack-induced diagnosability of a system. Specifically, a new structure, called an attack verifier, is constructed by integrating the attack behavior to enumerate all the attack paths to be transformed into fundamental ones that violate the attack-induced diagnosability. Then an optimal attack synthesis problem in terms of minimum energy cost is formulated by integer linear programming problems. An example of an automated manufacturing system is provided to show the efficiency of the proposed attack strategy compared with the existing approaches.