Abstract
This paper concerns the weak reachability of probabilistic Boolean control networks (PBCNs). Using semi-tensor product, PBCNs are expressed as discrete time bilinear systems with respect to states and controls. From the algebraic form of PBCNs, the maximum transfer probability matrix for PBCNs is constructed. From the matrix, necessary and sufficient condition for weak reachability of PBCNs is given. Also, a numerical example is presented to show the applicability of our approach.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
