Abstract
Stabilization and set stabilization of switched Boolean control networks are investigated by using flipping mechanism in this paper. Firstly, with the help of Warshall algorithm, an explicit criterion for the stabilization of switched Boolean control networks is derived. Secondly, the necessary and sufficient condition for the solvability of stabilization of switched Boolean control networks, by flipping some elements of perturbation set once, is presented. Thirdly, a search algorithm is proposed to calculate the minimum number of stabilization flipped nodes and what exactly they are. Furthermore, a necessary and sufficient condition is established for the solvability of set stabilization of switched Boolean control networks by flipping some elements of perturbation set once. Analogously, an algorithm is given to find the minimum number of set stabilization flipped nodes. Finally, examples are shown to demonstrate the feasibility of the above results.
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.
