title: Consistent stabilizability of switched Boolean networks.
abstract: This paper investigates the consistent stabilizability of switched Boolean networks (SBNs) by using the semi-tensor product method, and presents a number of new results. First, an algebraic expression of SBNs is obtained by the semi-tensor product, based on which the consistent stabilizability is then studied for SBNs and some necessary and sufficient conditions are presented for the design of free-form and state-feedback switching signals, respectively. Finally, the consistent stabilizability of SBNs with state constraints is considered and some necessary and sufficient conditions are proposed. The study of illustrative examples shows that the new results obtained in this paper are very effective in designing switching signals for the consistent stabilizability of SBNs.
authors.affiliation: School of Control Science and Engineering, Shandong University, Jinan 250061, PR China. haitaoli09@gmail.com
authors.forename: Haitao
authors.initials: H
authors.lastname: Li
authors.forename: Yuzhen
authors.initials: Y
authors.lastname: Wang
mesh_terms: D000465:Algorithms; D005246:Feedback; D008954:Models, Biological; D016571:Neural Networks, Computer; D013223:Statistics as Topic / Q000379:methods
keywords: Consistent stabilizability; Semi-tensor product; State constraint; Switched Boolean network