Abstract
This paper deals with the exact reachability and controllability of probabilistic Boolean control networks (PBCNs). Exact controllability of PBCNs is the generalization of controllability of Boolean control networks (BCNs). Firstly, the maximum probability transfer matrix for PBCNs is constructed, and elements of the matrix denote the maximum probability with which one state transfer to another one. Secondly, sufficient conditions for exact controllability of PBCNs are given. Moreover, an algorithm is obtained to construct the control sequence, which force the initial state to the ideal state. Finally, a numerical example is presented to show the efficiency of the approach.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
