Lin Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lin Cao has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Shaolong Shu
College of Electronics and Information Engineering, Tongji University, Shanghai, China
6 shared publications - Feng Lin
Department of Electrical and Computer Engineering, Wayne State University, Detroit, MI, USA
5 shared publications - Changchun Sun
Huadian Electric Power Research Institute Co., LTD., Hangzhou 310030, China
1 shared publication Chengju Liu
School of Electronics and Information Engineering, Tongji University, Shanghai, China
1 shared publication- Jiarui Li
Huadian Electric Power Research Institute Co., LTD., Hangzhou 310030, China
1 shared publication - Junsheng Zheng
Tongji University
1 shared publication
Latest Publications
- 19 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (7) , 4817-4824
Complex Event Recognition Within a Discrete Event System Framework
Recognizing complex events revealed by raw data is an increasingly crucial task that serves as one of the foundations for system monitoring and decision-making. Our goal is to accurately recognize the occurred complex events, that is, uniquely determine the occurred complex event sequence from the raw data. We abstract the outputs of data sources as a set of atomic events and then use an automaton to describe all atomic event sequences that can be generated by the given system. We represent a complex event as a set of atomic event sequences. For a given atomic event sequence and a complex event to be recognized, we introduce the notion of “partition” to stand for a possible single complex event sequence. By constructing an augmented automaton that includes all possible partitions, we derive a necessary and sufficient condition for the complex event recognition problem to be solvable. We then find an algorithm to check the condition. When the complex event recognition problem is solvable, any occurred complex event can be determined accurately and promptly online with existing methods like Aho–Corasick algorithm.
- 19 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (7) , 4817-4824
Complex Event Recognition Within a Discrete Event System Framework
Recognizing complex events revealed by raw data is an increasingly crucial task that serves as one of the foundations for system monitoring and decision-making. Our goal is to accurately recognize the occurred complex events, that is, uniquely determine the occurred complex event sequence from the raw data. We abstract the outputs of data sources as a set of atomic events and then use an automaton to describe all atomic event sequences that can be generated by the given system. We represent a complex event as a set of atomic event sequences. For a given atomic event sequence and a complex event to be recognized, we introduce the notion of “partition” to stand for a possible single complex event sequence. By constructing an augmented automaton that includes all possible partitions, we derive a necessary and sufficient condition for the complex event recognition problem to be solvable. We then find an algorithm to check the condition. When the complex event recognition problem is solvable, any occurred complex event can be determined accurately and promptly online with existing methods like Aho–Corasick algorithm.
- 14 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (8) , 4988-5003
Active Fault Isolation for Discrete Event Systems
In practice, a supervisor can often not only disable some events, but also enforce the occurrence of some events prior to the occurrence of other events. In this paper, we combine these two control mechanisms to synthesize a more powerful supervisor. The control goal is to design an isolation supervisor which ensures in the closed-loop system, faults are fault isolatable in the sense that after a fault occurs, we can determine which type the fault belongs to by observing the output of the closed-loop system. The isolation supervisor starts to work when the occurrence of faults is detected. We solve the isolation supervisor synthesis problem as follows. For a given discrete event system, we first construct a bipartite transition system which includes all feasible isolation supervisors. An isolation supervisor is feasible if it enforces only events that are physically possible. We then develop an algorithm to check whether the synthesis problem is solvable or not. The algorithm can also be used to find a valid isolation supervisor if the synthesis problem is solvable. The method of combining two control mechanisms can be used to synthesize more powerful supervisors for other supervisory control problems of discrete event systems as well.
- 14 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (8) , 4988-5003
Active Fault Isolation for Discrete Event Systems
In practice, a supervisor can often not only disable some events, but also enforce the occurrence of some events prior to the occurrence of other events. In this paper, we combine these two control mechanisms to synthesize a more powerful supervisor. The control goal is to design an isolation supervisor which ensures in the closed-loop system, faults are fault isolatable in the sense that after a fault occurs, we can determine which type the fault belongs to by observing the output of the closed-loop system. The isolation supervisor starts to work when the occurrence of faults is detected. We solve the isolation supervisor synthesis problem as follows. For a given discrete event system, we first construct a bipartite transition system which includes all feasible isolation supervisors. An isolation supervisor is feasible if it enforces only events that are physically possible. We then develop an algorithm to check whether the synthesis problem is solvable or not. The algorithm can also be used to find a valid isolation supervisor if the synthesis problem is solvable. The method of combining two control mechanisms can be used to synthesize more powerful supervisors for other supervisory control problems of discrete event systems as well.
- Open Access
Ultra Short-Term Power Load Forecasting Based on Similar Day Clustering and Ensemble Empirical Mode Decomposition
With the increasing demand of the power industry for load forecasting, improving the accuracy of power load forecasting has become increasingly important. In this paper, we propose an ultra short-term power load forecasting method based on similar day clustering and EEMD (Ensemble Empirical Mode Decomposition). In detail, the K-means clustering algorithm was utilized to divide the historical data into different clusters. Through EEMD, the load data of each cluster were decomposed into several sub-sequences with different time scales. The LSTNet (Long- and Short-term Time-series Network) was adopted as the load forecasting model for these sub-sequences. The forecast results for different sub-sequences were combined as the expected result. The proposed method predicts the load in the next 4 h with an interval of 15 min. The experimental results show that the proposed method obtains higher prediction accuracy than other comparable forecasting models.
Open AccessUltra Short-Term Power Load Forecasting Based on Similar Day Clustering and Ensemble Empirical Mode Decomposition
With the increasing demand of the power industry for load forecasting, improving the accuracy of power load forecasting has become increasingly important. In this paper, we propose an ultra short-term power load forecasting method based on similar day clustering and EEMD (Ensemble Empirical Mode Decomposition). In detail, the K-means clustering algorithm was utilized to divide the historical data into different clusters. Through EEMD, the load data of each cluster were decomposed into several sub-sequences with different time scales. The LSTNet (Long- and Short-term Time-series Network) was adopted as the load forecasting model for these sub-sequences. The forecast results for different sub-sequences were combined as the expected result. The proposed method predicts the load in the next 4 h with an interval of 15 min. The experimental results show that the proposed method obtains higher prediction accuracy than other comparable forecasting models.
- Open Access
Active Fault Isolation for Discrete Event Systems
In practice, we can not only disable some events, but also enforce the occurrence of some events prior to the occurrence of other events by external control. In this paper, we combine these two control mechanisms to synthesize a more powerful supervisor. Here our control goal is to design an isolation supervisor which ensures in the closed-loop system, faults are isolatable in the sense that after a fault occurs, we can determine which type the fault belongs to by observing the output of the closed-loop system. The isolation supervisor starts to work when the occurrence of faults is detected. We then solve the isolation supervisor synthesis problem as follows. For a given discrete event system, we firstly construct a bipartite transition system which includes all feasible isolation supervisors. An isolation supervisor is feasible if it enforces only events that are physically possible. We then develop an algorithm to check whether the synthesis problem is solvable or not. The algorithm can also be used to find a valid isolation supervisor if the synthesis problem is solvable. The method of combining two control mechanisms can be used to synthesize more powerful supervisors for other supervisory control problems of discrete event systems as well.
Open AccessActive Fault Isolation for Discrete Event Systems
In practice, we can not only disable some events, but also enforce the occurrence of some events prior to the occurrence of other events by external control. In this paper, we combine these two control mechanisms to synthesize a more powerful supervisor. Here our control goal is to design an isolation supervisor which ensures in the closed-loop system, faults are isolatable in the sense that after a fault occurs, we can determine which type the fault belongs to by observing the output of the closed-loop system. The isolation supervisor starts to work when the occurrence of faults is detected. We then solve the isolation supervisor synthesis problem as follows. For a given discrete event system, we firstly construct a bipartite transition system which includes all feasible isolation supervisors. An isolation supervisor is feasible if it enforces only events that are physically possible. We then develop an algorithm to check whether the synthesis problem is solvable or not. The algorithm can also be used to find a valid isolation supervisor if the synthesis problem is solvable. The method of combining two control mechanisms can be used to synthesize more powerful supervisors for other supervisory control problems of discrete event systems as well.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (1) , 184-196
Weak Diagnosability of Discrete-Event Systems
This article investigates weak diagnosability of discrete-event systems. Although diagnosability has been extensively investigated in the literature, weak diagnosability is a new concept introduced in this article. While diagnosability requires that a fault can be diagnosed along all trajectories after its occurrence, weak diagnosability requires that there always exists at least one trajectory along which the fault can be diagnosed at any time after its occurrence. Weak diagnosability ensures that any fault can be diagnosed eventually (with probability 1) but requires less sensors. We develop algorithms to check weak diagnosability. We further investigate weak diagnosability under communication delays and packet losses. We show that while packet losses may impact negatively on weak diagnosability, communication delays will not. We illustrate the results using a practical example.
- 2 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (1) , 184-196
Weak Diagnosability of Discrete-Event Systems
This article investigates weak diagnosability of discrete-event systems. Although diagnosability has been extensively investigated in the literature, weak diagnosability is a new concept introduced in this article. While diagnosability requires that a fault can be diagnosed along all trajectories after its occurrence, weak diagnosability requires that there always exists at least one trajectory along which the fault can be diagnosed at any time after its occurrence. Weak diagnosability ensures that any fault can be diagnosed eventually (with probability 1) but requires less sensors. We develop algorithms to check weak diagnosability. We further investigate weak diagnosability under communication delays and packet losses. We show that while packet losses may impact negatively on weak diagnosability, communication delays will not. We illustrate the results using a practical example.
- 17 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (5) , 2312-2318
Lossless Event Compression of Discrete Event Systems
This paper investigates the lossless event compression problem of discrete event systems which is, given a discrete event system and a source string generated by it, to find a minimal recoverable compressed string by removing as many events as possible. In order for the problem to be well post, two compression protocols are introduced. One requires that the last event is always kept. The other requires that, for any loop substring, at least one event is kept. We say a compressed string is recoverable if we can uniquely determine the source string based on the knowledge of the given discrete event system. We first construct an automaton to present all the possible source strings for a given compressed string. Based on the automaton, an algorithm is proposed to check whether the given compressed string is recoverable or not. We then propose an algorithm to calculate a minimal recoverable compressed string for a source string. The compressed string satisfies monotonicity which can significantly reduce the computational complexity of the algorithm. Finally we use a practical example to illustrate these results.
- 17 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 66 (5) , 2312-2318
Lossless Event Compression of Discrete Event Systems
This paper investigates the lossless event compression problem of discrete event systems which is, given a discrete event system and a source string generated by it, to find a minimal recoverable compressed string by removing as many events as possible. In order for the problem to be well post, two compression protocols are introduced. One requires that the last event is always kept. The other requires that, for any loop substring, at least one event is kept. We say a compressed string is recoverable if we can uniquely determine the source string based on the knowledge of the given discrete event system. We first construct an automaton to present all the possible source strings for a given compressed string. Based on the automaton, an algorithm is proposed to check whether the given compressed string is recoverable or not. We then propose an algorithm to calculate a minimal recoverable compressed string for a source string. The compressed string satisfies monotonicity which can significantly reduce the computational complexity of the algorithm. Finally we use a practical example to illustrate these results.