The problem considered in this work concerns the control of hybrid systems, studied from the discrete event systems theory viewpoint. The objective is to compute a transient control trajectory for reaching a steady state from a given initial state. The hybrid systems are modeled by a class of hybrid Petri nets called controlled generalized batches Petri nets, which introduce variable delays on continuous flows for modeling and analysis of dynamical systems. The key contributions of this study are as follows: two event-driven control strategies are proposed for reaching a target steady state, offering advantages in terms of control actions and time performance. These strategies are based on ON/OFF state transitions, with the firing flow either limited to its steady flow or maximal flow; two algorithms are presented to implement these control strategies effectively; a case study of a bottling production line, a high throughput manufacturing system, is provided, demonstrating the application of the proposed methods and evaluating their efficiency in terms of time performance and the number of generated events.
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.
This letter addresses the problem of opacity enforcement by using edit functions in discrete event systems modeled as deterministic finite automata under partial observation. The edit function is an output interface of the system that manipulates actual observations to confuse a malicious intruder. We assume that the edit function simply knows whether the intruder observes a larger or smaller set of events than itself, but does not know the exact set of events observed by the intruder. In this uncertain observation setting, the edit function aims to confuse the intruder while relying on its own set of observable events, which requires the edit function to be u-enforcing. The opacity enforcement problem is then transformed to a two-player game between the system and the edit function under partial information. A so-called edit mechanism is proposed in a game scheme to enumerate all possible edited operations following the system behavior. We show that an edit function synthesized from the edit mechanism (if any) can be used to enforce opacity in the system under the uncertain observation setting.
1 August 2024 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
This research focuses on the forbidden state problem in the framework of labeled Petri nets (LPNs), i.e., to design a supervisor for a plant modeled by an LPN such that the closed-loop system cannot reach a set of predefined forbidden markings and does not contain any deadlock. Different from the traditional control scheme, the supervisor derived by this work can not only observe the observable transitions, but also the quiescence information. First, a new structure named an extended basis reachability graph (EBRG) is introduced to describe the reachability space of an LPN without computing all reachable markings. Based on an EBRG, a basis observer is then excogitated to represent the behavior of an LPN. Some states in the basis observer are defined as bad states and control-induced deadlocks, which relates to the undesirable behavior of the plant. Finally, an algorithm is introduced to compute a supervisor based on the basis observer. The consideration of system quiescence provides extra information on the marking estimation of the closed-loop system such that certain disabled transitions are re-enabled. Consequently, the developed supervisor in this article is generally more permissive than those do not observe the quiescence.
21 January 2025 in IEEE/CAA Journal of Automatica Sinica
In this work, we address the codiagnosability analysis problem of a networked discrete event system under malicious attacks. The considered system is modeled by a labeled Petri net and is monitored by a series of sites, in which each site possesses its own set of sensors, without requiring communication among sites or to any coordinators. A net is said to be codiagnosable with respect to a fault if at least one site could deduce the occurrence of this fault within finite steps. In this context, we focus on a type of malicious attack that is called stealthy intermittent replacement attack. The stealthiness demands that the corrupted observations should be consistent with the system's normal behavior, while the intermittent replacement setting entails that the replaced transition labels must be recovered within a bounded of consecutive corrupted observations (called as K-corruption intermittent attack). Particularly, there exists a coordination between attackers that are separately effected on different sites, which holds the same corrupted observation for each common transition under attacks. From an attacker viewpoint, this work aims to design K- corruption intermittent attacks for violating the codiagnosability of systems. For this purpose, we propose an attack automaton to analyze K-corruption intermittent attack for each site, and build a new structure called complete attack graph that is used to analyze all the potential attacked paths. Finally, an algorithm is inferred to obtain the K-corruption intermittent attacks, and examples are given to show the proposed attack strategy.
19 June 2025 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
The fault diagnosis problem in discrete event systems consists in detecting the occurrences of faults in a plant, which is essential for ensuring the reliability of the plant. In the literature, this problem has been widely studied by assuming that the communications between a plant and a diagnostic agent, i.e., a diagnoser, are reliable and instantaneous. However, for a networked system, the information generated by a plant is transmitted through a shared communication network such that communication delays and losses are inevitable. This article formulates and studies the fault diagnosis problem in networked discrete event systems (NDESs) modeled by labeled Petri nets, where communication delays and losses are considered. Such a problem is also called robust fault diagnosis in this article. An important notion closely related to robust diagnosis, named networked diagnosability, is introduced, indicating that any occurred fault in a NDES is definitely determined after a limited number of observations. For a NDES, a tool called a networked basis diagnoser is excogitated to solve the robust diagnosis problem. A necessary and sufficient condition for verifying the networked diagnosability of a plant is derived by using the developed diagnoser. Finally, a manufacturing system is presented to illustrate the developed approach.