Consistent stabilizability of switched Boolean networks

0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

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. © 2013 Elsevier Ltd.

Cite

CITATION STYLE

APA

Li, H., & Wang, Y. (2013). Consistent stabilizability of switched Boolean networks. Neural Networks, 46, 183–189. https://doi.org/10.1016/j.neunet.2013.05.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free