Table 1 Updates vs. number of states. Algorithm timings obtained with 32-bit version of Mathematica 7.0 running in a personal computer with Intel Xeon X5355 processor and 4Gb of RAM. For the simulations with 100, 200, 300 and 400 updates 30 initial conditions were used except for 500 updates where only initial condition was used given to its very long duration.

From: A method to identify important dynamical states in boolean models of regulatory networks: application to regulation of stomata closure by ABA in A. thaliana