CSpace

Browse/Search Results:  1-3 of 3 Help

Selected(0)Clear Items/Page:    Sort:
Observability of Finite Labeled Transition Systems 期刊论文
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 卷号: 63, 期号: 6, 页码: 1591-1602
Authors:  Zhang, Kuize;  Liu, Ting;  Cheng, Daizhan
Favorite  |  View/Download:6/0  |  Submit date:2018/07/30
Finite automaton  finite labeled transition system (FLTS)  observability  
The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete 期刊论文
AUTOMATICA, 2017, 卷号: 81, 页码: 217-220
Authors:  Zhang, Kuize
Favorite  |  View/Download:3/0  |  Submit date:2018/07/30
Discrete event system  Finite automaton  Weak (periodic) detectability  PSPACE-hardness  
A WEIGHTED PAIR GRAPH REPRESENTATION FOR RECONSTRUCTIBILITY OF BOOLEAN CONTROL NETWORKS 期刊论文
SIAM JOURNAL ON CONTROL AND OPTIMIZATION, 2016, 卷号: 54, 期号: 6, 页码: 3040-3060
Authors:  Zhang, Kuize;  Zhang, Lijun;  Su, Rong
Favorite  |  View/Download:8/0  |  Submit date:2018/07/30
Boolean control network  reconstructibility  weighted pair graph  finite automaton  formal language  semitensor product of matrices