Input-state approach to boolean networks

Authors:
Daizhan Cheng
Affiliations:
Institute of Systems Science, Chinese Academy of Sciences, Beijing, China
Venue:
IEEE Transactions on Neural Networks
Year:
2009

Citing 5
Cited 11

Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling

Expert Systems with Applications: An International Journal
Scalar equations for synchronous Boolean networks with biological applications

IEEE Transactions on Neural Networks
Self-Organizing and Self-Evolving Neurons: A New Neural Network for Optimization

IEEE Transactions on Neural Networks
Self-Organizing Radial Basis Function Network for Real-Time Approximation of Continuous-Time Dynamical Systems

IEEE Transactions on Neural Networks
Global Convergence and Limit Cycle Behavior of Weights of Perceptron

IEEE Transactions on Neural Networks

Realization of Boolean control networks

Automatica (Journal of IFAC)
State-space analysis of Boolean networks

IEEE Transactions on Neural Networks
Brief paper: Controllability of Boolean control networks with time delays in states

Automatica (Journal of IFAC)
Identification of Boolean control networks

Automatica (Journal of IFAC)
Brief paper: Controllability of probabilistic Boolean control networks

Automatica (Journal of IFAC)
Brief paper: Controllability of Boolean control networks via the Perron-Frobenius theory

Automatica (Journal of IFAC)
Controller design for disturbance decoupling of Boolean control networks

Automatica (Journal of IFAC)
Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming

International Journal of Data Mining and Bioinformatics
Observability of Boolean networks: A graph-theoretic approach

Automatica (Journal of IFAC)
Algebraic formulation and strategy optimization for a class of evolutionary networked games via semi-tensor product method

Automatica (Journal of IFAC)
Controllability of Boolean control networks with time delays both in states and inputs

Neurocomputing

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper investigates the structure of Boolean networks via input-state structure. Using the algebraic form proposed by the author, the logic-based input-state dynamics of Boolean networks, called the Boolean control networks, is converted into an algebraic discrete-time dynamic system. Then the structure of cycles of Boolean control systems is obtained as compounded cycles. Using the obtained input-state description, the structure of Boolean networks is investigated, and their attractors are revealed as nested compounded cycles, called rolling gears. This structure explains why small cycles mainly decide the behaviors of cellular networks. Some illustrative examples are presented.