quotation:[Copy]
Yue Luo1,Jianhong Ye1,Jiazhong Zhou2,Jia Liu1,Linping Jiang1.[en_title][J].Control Theory and Technology,2025,23(4):672~687.[Copy]
【Print page】 【Online reading】【Download PDF Full text】 View/Add CommentDownload reader Close

←Previous page|Page Next →

Back Issue    Advanced search

This Paper:Browse 44   Download 0 本文二维码信息
码上扫一扫!
PLC transition sequence identification based on logical reduction
YueLuo1,JianhongYe1,JiazhongZhou2,JiaLiu1,LinpingJiang1
0
(1 College of Computer Science and Technology, Huaqiao University, Xiamen 361021, Fujian, China;2 College of Information Science and Engineering, Huaqiao University, Xiamen 361021, Fujian, China)
摘要:
In industrial control systems, such as power transmission facilities andwater treatment plants, ProgrammableLogicControllers (PLCs) can work consistently and stably over long periods if there are no faults. Black-box identification aims to automatically construct Petri net models with the help of I/O signals from PLC devices only. The main challenge is how to convert the infinitely long PLC signals into an event sequence, which is the foundation for subsequent modeling. The current algorithms are confronted with a number of challenges, including an exponential increase in the number of transitions, high time complexity, and susceptibility to noisy signals. To solve these problems, this paper proposes a new method for converting PLC signals into a transition sequence. The method is based on the principles of Boolean absorption law, which filters out noise information in the I/O signals. Then firing functions representing input–output causality are constructed from the filtered signals. Finally, the original signal sequence is traversed to generate a transition sequence. The experimental results show that these methods can rapidly identify a transition sequence. Compared to traditional methods, the proposed algorithms have polynomial time complexity.
关键词:  PLC · Boolean logic · Transition sequence · Petri net
DOI:https://doi.org/10.1007/s11768-025-00263-9
基金项目:This work was supported by the Science and Technology Planning Project of Fujian Province, China, under Grant No. 2024H0014 (2024H01010100).
PLC transition sequence identification based on logical reduction
Yue Luo1,Jianhong Ye1,Jiazhong Zhou2,Jia Liu1,Linping Jiang1
(1 College of Computer Science and Technology, Huaqiao University, Xiamen 361021, Fujian, China;2 College of Information Science and Engineering, Huaqiao University, Xiamen 361021, Fujian, China)
Abstract:
In industrial control systems, such as power transmission facilities andwater treatment plants, ProgrammableLogicControllers (PLCs) can work consistently and stably over long periods if there are no faults. Black-box identification aims to automatically construct Petri net models with the help of I/O signals from PLC devices only. The main challenge is how to convert the infinitely long PLC signals into an event sequence, which is the foundation for subsequent modeling. The current algorithms are confronted with a number of challenges, including an exponential increase in the number of transitions, high time complexity, and susceptibility to noisy signals. To solve these problems, this paper proposes a new method for converting PLC signals into a transition sequence. The method is based on the principles of Boolean absorption law, which filters out noise information in the I/O signals. Then firing functions representing input–output causality are constructed from the filtered signals. Finally, the original signal sequence is traversed to generate a transition sequence. The experimental results show that these methods can rapidly identify a transition sequence. Compared to traditional methods, the proposed algorithms have polynomial time complexity.
Key words:  PLC · Boolean logic · Transition sequence · Petri net