Abstract
In this article we study some aspects about the graph associated with parallel and serial behavior of a Boolean network. We conclude that the structure of the associated graph can give some information about the attractors of the network. We show that the length of the attractors of Boolean networks with a graph by layers is a power of two and under certain conditions the only attractors are fixed points. Also, we show that, under certain conditions, dynamical cycles are not the same for parallel and serial updates of the same Boolean network.
Original language | English |
---|---|
Pages (from-to) | 247-253 |
Number of pages | 7 |
Journal | Theoretical Computer Science |
Volume | 396 |
Issue number | 1-3 |
DOIs | |
State | Published - 10 May 2008 |
Externally published | Yes |
Keywords
- Asynchronous update
- Attractor
- Boolean network
- Dynamical cycle
- Fixed point
- Synchronous update