Finite-Time Observability of Probabilistic Logical Control Systems  

作　　者：ZHOU Rongpei GUO Yuqian LIU Xinzhi GUI Weihua 

机构地区：[1]School of Information Engineering,Nanchang University,Nanchang 330031,China [2]School of Automation,Central South University,Changsha 410083,China [3]Department of Applied Mathematics,University of Waterloo,Waterloo,Ontario,N 2L 3G 1,Canada

出　　处：《Journal of Systems Science & Complexity》2023年第5期1905-1926,共22页系统科学与复杂性学报（英文版）

基　　金：jointly supported by the National Natural Science Foundation of China under Grant Nos.62103178,61873284 and 61321003;NSERC Canada。

摘　　要：This study investigates finite-time observability of probabilistic logical control systems(PLCSs)under three definitions(i.e.,finite-time observability with probability one,finite-time singleinput sequence observability with probability one,and finite-time arbitrary-input observability with probability one).The authors adopt a parallel extension technique to recast the finite-time observability problem of a PLCS as a finite-time set reachability problem.Then,the finite-time set reachability problem can be transferred to stabilization problem of a logic dynamical system by using the state transfer graph reconstruction method.Necessary and sufficient conditions for finite-time observability under the three definitions are derived respectively.Finally,the proposed methods are illustrated by numerical examples.

关 键 词：Finite-time observability finite-time set reachability probabilistic logical control systems semi-tensor products 

分 类 号：TP13[自动化与计算机技术—控制理论与控制工程]