Stability and stabilization of Boolean networks

Abstract

AbstractThe 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.