Abstract
This paper tackles the controllability problem of Boolean control networks (BCNs). By resorting to the semi-tensor product technique and the Warshall algorithm, several improved novel reachability and controllability criteria are obtained for the BCNs. Through constructing a sequence of rigorous Boolean matrices, controllability matrix of the considered BCNs is derived iteratively. It is worth pointing out that the proposed method has lower computational complexity, and thus facilitates the reachability and controllability analysis for BCNs. In addition, the issue concerning controllability of BCNs with undesirable interior states is investigated by checking a set of designated Boolean matrices. Finally, to test the effectiveness of the obtained theoretical results, a genetic network model known as the $\lambda$ switch is used as an example for numerical simulation.
Sign-in/Register to access full text options 
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.
