Ruotian Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ruotian Liu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Maria Pia Fanti
Polytechnic University of Bari
18 shared publications - Zhiwu Li
Macau University of Science and Technology, Taipa
8 shared publications - Agostino Marcello Mangini
Polytechnic of Bari
7 shared publications - Yihui Hu
School of Automation, Xian University of Posts and Telecommunications, Xian, China
4 shared publications - Shaopeng Hu
School of Electro-Mechanical Engineering, Xidian University, Xian, China
3 shared publications Shu Zhang
Xidian University
3 shared publications
Latest Publications
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-8
Optimal Sensor Selection for $K$-Step Prognosability Verification and Enforcement of Unbounded Petri Nets
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.
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-8
Optimal Sensor Selection for $K$-Step Prognosability Verification and Enforcement of Unbounded Petri Nets
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.
- 1 April 2026
- Published by Springer Nature
- p. 17-31
Dead Transitions Analysis and Resolution in Dual-Time Petri Nets
- 1 April 2026
- Published by Springer Nature
- p. 17-31
Dead Transitions Analysis and Resolution in Dual-Time Petri Nets
- Open Access
- 30 March 2026
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 36 (1) , 13
A survey on performance evaluations in time-dependent Petri nets
Time-dependent Petri nets extend the classical Petri net formalism by incorporating timing constraints, enabling the modeling and analysis of temporal behavior in discrete event systems. This survey provides a comprehensive overview of the foundational concepts and major classes of time-dependent Petri nets, including both deterministic and stochastic variants. We explore their modeling capabilities, formal analysis techniques, and a range of performance evaluation methods. In particular, we aim to analyze the performance indices such as cycle time, throughput, and resource utilization, which are critical for assessing system efficiency and scalability. Examples are provided to demonstrate how system performance is evaluated. Additionally, we discuss current challenges and emerging trends in the field, highlighting open research problems and potential future directions.
- 30 March 2026
- Published by Springer Nature in Discrete Event Dynamic Systems
- Vol. 36 (1) , 13
Open AccessA survey on performance evaluations in time-dependent Petri nets
Time-dependent Petri nets extend the classical Petri net formalism by incorporating timing constraints, enabling the modeling and analysis of temporal behavior in discrete event systems. This survey provides a comprehensive overview of the foundational concepts and major classes of time-dependent Petri nets, including both deterministic and stochastic variants. We explore their modeling capabilities, formal analysis techniques, and a range of performance evaluation methods. In particular, we aim to analyze the performance indices such as cycle time, throughput, and resource utilization, which are critical for assessing system efficiency and scalability. Examples are provided to demonstrate how system performance is evaluated. Additionally, we discuss current challenges and emerging trends in the field, highlighting open research problems and potential future directions.
- Open Access
- 30 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 7409-7423
Securing Networked Discrete Event Systems for Diagnosability Under Attacks
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.
- 30 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 7409-7423
Open AccessSecuring Networked Discrete Event Systems for Diagnosability Under Attacks
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.
- Open Access
- 20 March 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (6) , 3000
A Survey on Recent Advances in the Integration of Discrete Event Systems and Artificial Intelligence
The increasing complexity and uncertain system of modern discrete event system (DES) challenge traditional model-based control approaches, while artificial intelligence (AI) techniques offer powerful data-driven decision-making capabilities but lack formal guarantees. This review surveys recent research on the integration of AI with DES and supervisory control theory. Following a systematic literature mapping methodology, the literature is organized using a taxonomy based on three orthogonal perspectives: control and decision paradigm, system capability and property, and application and operational objectives. The review highlights how learning-based methods enhance adaptability and performance in DES, while also exposing persistent challenges related to safety, nonblocking behavior, data efficiency, and interpretability. By structuring existing approaches and identifying open issues, this review provides a coherent overview of the current research landscape and outlines key directions for future work on AI-enabled DES.
- 20 March 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (6) , 3000
Open AccessA Survey on Recent Advances in the Integration of Discrete Event Systems and Artificial Intelligence
The increasing complexity and uncertain system of modern discrete event system (DES) challenge traditional model-based control approaches, while artificial intelligence (AI) techniques offer powerful data-driven decision-making capabilities but lack formal guarantees. This review surveys recent research on the integration of AI with DES and supervisory control theory. Following a systematic literature mapping methodology, the literature is organized using a taxonomy based on three orthogonal perspectives: control and decision paradigm, system capability and property, and application and operational objectives. The review highlights how learning-based methods enhance adaptability and performance in DES, while also exposing persistent challenges related to safety, nonblocking behavior, data efficiency, and interpretability. By structuring existing approaches and identifying open issues, this review provides a coherent overview of the current research landscape and outlines key directions for future work on AI-enabled DES.
- Open Access
Recent Advances in Fault Diagnosis and Opacity Analysis in Discrete Event Systems
This paper continues the historical and technical trajectory of fault diagnosis and opacity analysis in discrete event systems (DESs). Whereas the previous work reviewed the foundational developments of event diagnosis and opacity, this survey focuses on recent advances over the past decade by addressing modern challenges such as communication losses, delays, distributed architectures, and cyber-attack scenarios. Specifically, we present a structured overview of diagnosability verification and enforcement across automata, Petri nets, and other DES models under these scenarios. In parallel, we review contemporary results on opacity verification and enforcement, including complexity findings, reduction techniques, and robust or attack-resilient formulations. In addition, this survey provides an updated picture of the evolving research landscape and highlights emerging themes and open problems in diagnosis and opacity for DESs.
Open AccessRecent Advances in Fault Diagnosis and Opacity Analysis in Discrete Event Systems
This paper continues the historical and technical trajectory of fault diagnosis and opacity analysis in discrete event systems (DESs). Whereas the previous work reviewed the foundational developments of event diagnosis and opacity, this survey focuses on recent advances over the past decade by addressing modern challenges such as communication losses, delays, distributed architectures, and cyber-attack scenarios. Specifically, we present a structured overview of diagnosability verification and enforcement across automata, Petri nets, and other DES models under these scenarios. In parallel, we review contemporary results on opacity verification and enforcement, including complexity findings, reduction techniques, and robust or attack-resilient formulations. In addition, this survey provides an updated picture of the evolving research landscape and highlights emerging themes and open problems in diagnosis and opacity for DESs.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (10) , 1-14
Opacity Enforcement by Edit Functions Under Incomparable Observations
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (10) , 1-14
Opacity Enforcement by Edit Functions Under Incomparable Observations
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 8086-8096
Deep Reinforcement Learning for Near-Optimal Control Sequence in Discrete Event Systems
This work investigates the use of deep reinforcement learning to address the scheduling problem of identifying minimal control sequences while ensuring deadlock avoidance in transition-timed Petri nets. Traditional control strategies often depend on exhaustive search algorithms or heuristics, both of which tend to be computationally intensive and exhibit poor scalability as system complexity increases. In this study, we formulate the control sequence scheduling task as a Markov decision process and adopt the Deep Q-Network framework to learn control policies through interaction with an integrated timed Petri net simulation environment. The reward function is specifically designed to minimize total execution time, with penalties applied to extended durations, thereby guiding the learning process toward efficient and safe behaviors. In addition, we evaluate the robustness of the learned policy under structural perturbations (i.e., failed transitions) and temporal variations via scaled firing delays. Experimental results indicate that the proposed method consistently identifies control sequences with shorter makespans when compared to conventional approaches, offering significant improvements in both runtime and computational efficiency. Moreover, once the learned policy generalizes effectively, it can be reused to quickly generate feasible control sequences even under moderate perturbations, without requiring retraining. The comparative analysis further highlights these advantages, demonstrating the potential of the proposed reinforcement learning-based framework as a practical and scalable solution for optimizing control strategies in complex timed Petri net models. Two case studies on manufacturing systems are used to illustrated the efficiency of the proposed strategy.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 8086-8096
Open AccessDeep Reinforcement Learning for Near-Optimal Control Sequence in Discrete Event Systems
This work investigates the use of deep reinforcement learning to address the scheduling problem of identifying minimal control sequences while ensuring deadlock avoidance in transition-timed Petri nets. Traditional control strategies often depend on exhaustive search algorithms or heuristics, both of which tend to be computationally intensive and exhibit poor scalability as system complexity increases. In this study, we formulate the control sequence scheduling task as a Markov decision process and adopt the Deep Q-Network framework to learn control policies through interaction with an integrated timed Petri net simulation environment. The reward function is specifically designed to minimize total execution time, with penalties applied to extended durations, thereby guiding the learning process toward efficient and safe behaviors. In addition, we evaluate the robustness of the learned policy under structural perturbations (i.e., failed transitions) and temporal variations via scaled firing delays. Experimental results indicate that the proposed method consistently identifies control sequences with shorter makespans when compared to conventional approaches, offering significant improvements in both runtime and computational efficiency. Moreover, once the learned policy generalizes effectively, it can be reused to quickly generate feasible control sequences even under moderate perturbations, without requiring retraining. The comparative analysis further highlights these advantages, demonstrating the potential of the proposed reinforcement learning-based framework as a practical and scalable solution for optimizing control strategies in complex timed Petri net models. Two case studies on manufacturing systems are used to illustrated the efficiency of the proposed strategy.
- Open Access
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (2) , 2775-2788
On Diagnosability Consistency of Composed Labeled Petri Nets via Buffer Places
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.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (2) , 2775-2788
Open AccessOn Diagnosability Consistency of Composed Labeled Petri Nets via Buffer Places
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.