SHShaopeng Hu

Shaopeng Hu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shaopeng Hu has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Optimal Sensor Selection for $K$-Step Prognosability Verification and Enforcement of Unbounded Petri Nets

    by Shaopeng Hu, Ruotian Liu, Maria Pia Fanti, Zhiwu Li

    This paper addresses the enforcement of prognosability and $K$-step prognosability in discrete event systems modeled with unbounded Petri nets that may enter deadlocks. Given an unbounded labeled Petri net, a simplified basis coverability graph is established to encode deadlock information without enumerating all basis markings. The enforcement of prognosability and $K$-step prognosability is achieved via optimal sensor selection using a relabeling function that maximizes the achievable $K$. Considering the cost of relabeling sensors, the proposed relabeling function is optimal by solving an integer linear programming problem. Examples are presented to demonstrate the proposed method.


  • Open Access

    Securing Networked Discrete Event Systems for Diagnosability Under Attacks

    by Ruotian Liu, Tengbo Li, Shaopeng Hu, Agostino Marcello Mangini, Maria Pia Fanti

    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.


  • Supervisory Control for Active Diagnosis in Labeled Petri Nets Under Observation and Control Delays

    by Shaopeng Hu, Wei Duan, Ding Liu, Zhiwu Li

    This paper formalizes and addresses the problems of diagnosability verification and enforcement in discrete event systems modeled with labeled Petri nets under observation and control delays. Given a system with observation delays that may disorder the generated observations, delay diagnosability is introduced to characterize whether all faults remain diagnosable under the observation delays. A delayed verifier is established to test the delay diagnosability of the considered system. It is shown that a labeled Petri net under observation delays is diagnosable if and only if the verifier does not contain the confused cycles composed exclusively of pairs of faulty states and normal states. Considering the existence of control delays in the channel between the plant and its supervisor, a delayed supervisor is designed such that the closed-loop system is diagnosable under observation and control delays. Furthermore, the designed supervisor is maximally permissive, i.e., there does not exist another diagnosability enforcement supervisor that is strictly more permissive than the designed one. Examples are presented to demonstrate the proposed method.


  • Asynchronous Fault Diagnosis in Discrete Event Systems Subject to Intermittent Sensor Failures

    by Shengli Cao, Yihui Hu, Shaopeng Hu, Jun Li, Yao Lu, Wei Duan, Jinrui Ren

    The classical asynchronous fault diagnosis method requires that the communications between a plant and a diagnoser are reliable, i.e., the diagnoser can receive all information recorded by sensors. However, in some practical networked systems, it is possible that some observations generated by the system are lost, due to sensor failure or communication malfunction between the sensors and the diagnoser. In such a case, the traditional asynchronous fault diagnosis approach is not applicable. In this work, we study the asynchronous diagnosis problem subject to intermittent sensor failures, which is called robustly asynchronous diagnosis. An important property related to robustly asynchronous diagnosis, named robustly asynchronous diagnosability, is introduced, which implies that in the presence of intermittent loss of observations, any fault occurrence is asynchronously detected after a limited number of observations. Given a plant modeled by an automaton, a tool called a robustly asynchronous diagnoser is developed and utilized for asynchronous diagnosis against intermittent sensor failures. Moreover, a necessary and sufficient condition for determining the robustly asynchronous diagnosability is established by using the developed diagnoser structure. Finally, a manufacturing process example is presented to illustrate the introduced approach.

  • Open Access

    On Diagnosability Consistency of Composed Labeled Petri Nets via Buffer Places

    by Ruotian Liu, Shaopeng Hu, Yihui Hu, Agostino Marcello Mangini, Maria Pia Fanti

    Fault diagnosis in internet of things systems, where multiple distributed components interact asynchronously through communication buffers, poses significant challenges due to system scalability and communication uncertainties. To address this, this paper studies the problem of diagnosability consistency in a discrete event system modeled using a labeled Petri net composed of several interconnected subnets via buffer places. Due to the state explosion problem, the diagnosability analysis by a centralized approach for large-scale systems is computationally demanding and sometimes even impossible. In this work, we assume that Petri net modules are connected through buffer places according to predefined rules and do not share transitions or resources, offering a complementary and computationally efficient alternative to existing modular approaches for large-scale systems. The diagnosability of subnets is analyzed with a particular automaton, called an unfolded verifier, by determining whether there exists a fundamental path that leads to the violation of the diagnosability. The proposed approach investigates the diagnosability of large systems with modular structures (namely global diagnosability), without constructing a global unfolded verifier, by analyzing the diagnosability of each module only (namely local diagnosability). More precisely, the consistency between the local diagnosability and the global diagnosability is addressed by determining whether all the fundamental paths of subnets survive in the global net due to the composition of subnets. Finally, an algorithm is given to deduce the diagnosability of a monolithic system. Compared with the existing centralized approaches, the complexity is practically mitigated by using the proposed one.


  • Supervisory Control for Active Diagnosis in Labeled Petri Nets Under Coordinated Sensor and Actuator Attacks

    by Shaopeng Hu, Yihui Hu, Jan Komenda, Zhiwu Li

    In this article, we formalize and solve the problems of active diagnosis for discrete event systems modeled with labeled Petri nets that may enter deadlocks under coordinated sensor and actuator attacks. Given a plant, a sensor attacker has the ability to edit certain sensor readings to conceal the faults to confuse the operator. An actuator attacker may exist in the control channel between a plant and its supervisor, and has the ability to tamper with the control actions commanded by the supervisor such that the plant remains nondiagnosable under the control of the supervisor. Furthermore, sensor and actuator attackers collaborate to attack a plant and maintain furtivity, i.e., their presence should not be discovered by the operator. In order to test the diagnosability under such attacks, a structure, called an extended verifier, is established. It is shown that a labeled Petri net that may enter deadlocks under coordinated sensor and actuator attacks is diagnosable if and only if the verifier does not contain the confused cycles composed exclusively of pairs of faulty states and normal states. This result also provides necessary and sufficient conditions for active diagnosis under coordinated sensor and actuator attacks by designing a maximally resilient supervisor. Examples are presented to demonstrate the proposed method.


  • Diagnosability Verification and Enforcement in Labeled Petri Nets Under Sensor Attacks

    by Shaopeng Hu, Zhiwu Li, Ding Liu

    This article formalizes and solves the problems of diagnosability verification and enforcement in discrete event systems modeled with labeled Petri nets (LPNs) under sensor attacks. Given a plant, attackers work as a group in the framework of a coordinated distributed architecture and have the ability to edit some sensor readings to conceal the faults to confuse the operator. Furthermore, attackers necessarily remain furtive, i.e., their presence should not be discovered by the operator. In order to describe the set of all possible furtive attacks, a joint furtive diagnoser is established. We prove that an LPN under the above attacks is diagnosable if and only if its joint furtive diagnoser does not have the cycles composed of pairs of either faulty states and normal states, or faulty states and uncertain states. A new labeling function is proposed to enforce a plant to be diagnosable against as many attacks as possible. Examples are provided to illustrate the proposed method.


  • Design of Online Supervisors for Enforcing Diagnosability in Petri Nets With Unknown Initial Markings

    by Shaopeng Hu, Zhiwu Li, Ziliang Zhang

    This paper formalizes and solves the problem of diagnosability verification and enforcement of discrete event systems that are modeled by Petri nets with unknown initial markings, i.e., the number of tokens in part or all of the places is unknown or uncertain at an initial marking. A revised topology of the original net with a certain initial marking, called an acceptable initial-model, is constructed to verify the diagnosability of such a system without testing diagnosability for each possible initial marking. The process applies a diagnosability verification agent, called an extended verifier that is obtained from the proposed acceptable initial-model. We prove that a Petri net with unknown initial markings is diagnosable if and only if there does not exist any uncertain fault path in the verifier. The result also provides sufficient and necessary conditions for enforcing diagnosability by developing an online supervisor. Examples are presented to demonstrate the proposed method.


  • Diagnosability Verification and Enforcement for Unbounded Petri Nets by Online Supervisors

    by Shaopeng Hu, Yihui Hu, Ding Liu, Maria Pia Fanti, Zhiwu Li

    This paper addresses the problems of diagnosability verification and enforcement of discrete event systems modeled with unbounded Petri nets. Diagnosability in such systems is critical for ensuring reliability and maintaining operational integrity, yet current methods often struggle with the complexity introduced by unboundedness and potential deadlocks. Given an unbounded labeled Petri net that may reach deadlocks, a quiescent basis coverability graph is established to verify the diagnosability of the considered system. This procedure employs a deterministic finite state automaton, called an extended verifier, derived from the proposed quiescent basis coverability graph. It is shown that an unbounded Petri net is diagnosable if and only if the verifier does not contain a class of cycles, called repetitive $F$ -cycles. This result also provides necessary and sufficient conditions for diagnosability enforcement by developing an online supervisor. Further, the designed supervisor is maximally permissive and also circumvents a plant entering deadlocks by firing non-fault sequences. Examples are presented to demonstrate the proposed method. Note to Practitioners —Fault diagnosis and diagnosability enforcement are critical for the development and operation of highly automated systems covering computer-integrated production processes, intelligent traffic, computer and communication networks, smart gird, etc. This work touches upon this problem from the perspective of discrete event systems that are modeled with unbounded labeled Petri nets. The feasibility and applicability of the reported method stem from the usage of a structurally compact representation of a considered plant such that the computational cost of a real-world system is acceptable. The graphical representation of Petri nets as well as the proposed quiescent basis coverability graph make the method easy to use and manipulate. Moreover the sufficient and necessary conditions of diagnosability enforcement can be readily verified by the supervisory theory, facilitating its adoption by practitioners.