A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey
2012
Electronical Notes in Theoretical Computer Science
Boolean networks are discrete dynamical systems extensively used to model biological regulatory networks. The dynamical analysis of these networks suffers from the combinatorial explosion of the state space, which grows exponentially with the number n of components. To face this problem, a classical approach consists in deducing from the interaction graph of the network, which only contains n vertices, some information on the dynamics of the network. In this paper, we present results in this
doi:10.1016/j.entcs.2012.05.017
fatcat:jpamzaa7mfcejb7rko2cop2tpq