Symbolic dynamics of Boolean control networks

Authors:
Gal Hochma;Michael Margaliot;Ettore Fornasini;Maria Elena Valcher
Affiliations:
-;-;-;-
Venue:
Automatica (Journal of IFAC)
Year:
2013

Citing 6
Cited 0

An introduction to symbolic dynamics and coding

An introduction to symbolic dynamics and coding
Fundamentals of Artificial Neural Networks

Fundamentals of Artificial Neural Networks
Dynamical analysis of a generic Boolean model for the control of the mammalian cell cycle

Bioinformatics
State-space analysis of Boolean networks

IEEE Transactions on Neural Networks
A remark on "Scalar equations for synchronous Boolean networks with biological Applications" by C. Farrow, J. Heidel, J. Maloney, and J. Rogers

IEEE Transactions on Neural Networks
Observability of Boolean networks: A graph-theoretic approach

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.14

Visualization

Abstract

We consider Boolean control networks (BCNs), and in particular Boolean networks (BNs), in the framework of symbolic dynamics (SD). We show that the set of state-space trajectories of a BCN is a shift space of finite type (SFT). This observation allows us to extend two important analysis tools from SD, namely, the Artin-Mazur zeta function and the topological entropy, to BNs and BCNs. Some of the theoretical results are illustrated using a BCN model of the core network regulating the mammalian cell cycle.