论文信息 - Canonical Form of Boolean Networks

Canonical Form of Boolean Networks

Based on the algebraic state space representation of logical dynamic systems, a canonical form of Boolean networks is proposed. This form reveals the topological structure of Boolean networks. Two numerical algorithms are proposed. One is used for small networks and the other one is used for large scale networks. Some numerical examples are presented to demonstrate the normal form and the algorithms.

Daizhan Cheng | Zequn Liu

[1] Tianguang Chu,et al. State Feedback Stabilization for Boolean Control Networks , 2013, IEEE Transactions on Automatic Control.

[2] S. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.

[3] B. Samuelsson,et al. Superpolynomial growth in the number of attractors in Kauffman networks. , 2003, Physical review letters.

[4] Yuzhen Wang,et al. A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems , 2012, Autom..

[5] Michael Margaliot,et al. Observability of Boolean networks: A graph-theoretic approach , 2013, Autom..

[6] D. Cheng,et al. Analysis and control of Boolean networks: A semi-tensor product approach , 2010, 2009 7th Asian Control Conference.

[7] John Maloney,et al. Scalar equations for synchronous Boolean networks with biological applications , 2004, IEEE Transactions on Neural Networks.

[8] Daizhan Cheng,et al. A Linear Representation of Dynamics of Boolean Networks , 2010, IEEE Transactions on Automatic Control.

[9] D. Cheng,et al. An Introduction to Semi-Tensor Product of Matrices and Its Applications , 2012 .

[10] M. Aldana. Boolean dynamics of networks with scale-free topology , 2003 .