Tools for Steady State Computation of Boolean Networks
A. Veliz-Cuba, B. Aguilar, F. Hinkelmann and R. Laubenbacher
BNReduction reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for large Boolean networks with high average connectivity remains an open problem.
More info about BNReduction: http://www.biomedcentral.com/1471-2105/15/221
Last update: May 26th, 2015