This article investigates observability of Boolean control networks (BCNs) and probabilistic Boolean networks (PBNs). First, weak observability of BCNs is discussed via the nonaugmented approach. The obtained result is then applied to determine (asymptotic) observability of PBNs. Finally, complexity of algorithms based on new criteria is analyzed. Compared with existing ones, time and space complexity do not get worse, even are improved under some mild conditions. 

　　Publication: 

　　IEEE Transactions on Automatic Control, 2022, Volume: 67, Issue 11, pp: 6248-6254. 

　　Author: 

　　Yongyuan Yu 

　　School of Mathematics, Shandong University, Jinan, China 

　　Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 

　　Min Meng 

　　Department of Control Science and Engineering, College of Electronics and Information Engineering, Tongji University, Shanghai, China 

　　Institute for Advanced Study, Tongji University, Shanghai, China 

　　Jun-e Feng 

　　School of Mathematics, Shandong University, Jinan, China 

　　Ge Chen 

　　National Center for Mathematics and Interdisciplinary Sciences and Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China 

　　Email: chenge@amss.ac.cn