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 observabili...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.展开更多
基金jointly supported by the National Natural Science Foundation of China under Grant Nos.62103178,61873284 and 61321003NSERC 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.
