On the length of attractors in boolean networks with an interaction graph by layers

Abstract

We consider a boolean network whose interaction graph has no circuit of length >1. Under this hypothesis, we establish an upper bound on the length of the attractors of the network which only depends on its interaction graph.