BNS

BNS is a software tool for computing attractors in Boolean Networks with Synchronous update.
Synchronous Boolean networks [1] are used for the modeling of genetic regulatory networks.

BNS implements the algorithm presented in [2]
which is based on a SAT-based bounded model checking.
BNS uses much less space compared to BooleNet or other BDD-based approaches for computing attractors.
It can handle several orders of magnitude larger networks.

BNS reads in a Boolean network description represented in a .cnet format similar to the
Berkeley Logic Interchange Format (BLIF) format commonly used in synthesis
and verification tools and prints out the set of network's attractors.

You can also test BNS on randomly generated graphs. Statistical features of randomly generated Boolean
networks on the critical line are believed to capture the dynamics of genetic regulatory networks
of living organisms [1]. The following simple program
will generate you an n-node random Boolean network on the critical line in the .cnet format.