On controllability and stabilizability of probabilistic Boolean control networks

The controllability of probabilistic Boolean control networks (PBCNs) is first considered. Using the input-state incidence matrices of all models, we propose a reachability matrix to characterize the joint reachability. Then we prove that the joint reachability and the controllability of PBCNs are equivalent, which leads to a necessary and sufficient condition of the controllability. Then, the result of controllability is used to investigate the stability of probabilistic Boolean networks (PBNs) and the stabilization of PBCNs. A necessary and sufficient condition for the stability of PBNs is obtained first. By introducing the control-fixed point of Boolean control networks (BCNs), the stability condition has finally been developed into a necessary and sufficient condition of the stabilization of PBCNs. Both necessary and sufficient conditions for controllability and stabilizability are based on reachability matrix, which are easily computable. Hence the two necessary and sufficient conditions are straightforward verifiable. Numerical examples are provided from case to case to demonstrate the corresponding theoretical results.