Stability and stabilization of Boolean networks

394Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The stability of Boolean networks and the stabilization of Boolean control networks are investigated. Using semi-tensor product of matrices and the matrix expression of logic, the dynamics of a Boolean (control) network can be converted to a discrete time linear (bilinear) dynamics, called the algebraic form of the Boolean (control) network. Then the stability can be revealed by analyzing the transition matrix of the corresponding discrete time system. Main results consist of two parts: (i) Using logic coordinate transformation, the known sufficient condition based on incidence matrix has been improved. It can also be used in stabilizer design. (ii) Based on algebraic form, necessary and sufficient conditions for stability and stabilization, respectively, are obtained. Copyright © 2010 John Wiley & Sons, Ltd. Copyright © 2010 John Wiley & Sons, Ltd.

Cite

CITATION STYLE

APA

Cheng, D., Qi, H., Li, Z., & Liu, J. B. (2011). Stability and stabilization of Boolean networks. International Journal of Robust and Nonlinear Control, 21(2), 134–156. https://doi.org/10.1002/rnc.1581

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