A directed path-decomposition approach to exactly identifying attractors of boolean networks

We propose an approach to the problem of identifying all the attractors of a given boolean network, which is based on the directed path decomposition of the network. Experiments show that the approach enables us to exactly solve the problem for networks of moderate size, say of 100 nodes, drawn fro a certain probability distribution, for which the traditional approaches are only able to sample some of the attractors.