Abstract
This paper investigates the controllability of Markovian jump Boolean control networks (MJBCNs) by using graphical approach. To solve this problem, a deterministic directed graph is constructed to describe the stochastic evolutionary process of the considered MJBCN under the framework of semi-tensor product of matrices. Then, combining with breadth-first search, the special subgraph with breadth-first tree as the principal part is obtained. Based on this, the necessary and sufficient conditions to verify the controllability of MJBCNs are deduced, and the problem of determining the minimal controllable time is solved completely. Subsequently, two examples are given to illustrate the validity and correctness of the method.
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.
