  This paper details a method for optimising the size of Boolean automata
networks in order to compute their attractors under the parallel update
schedule. This method relies on the formalism of modules introduced recently
that allows for (de)composing such networks. We discuss the practicality of
this method by exploring examples. We also propose results that nail the
complexity of most parts of the process, while the complexity of one part of
the problem is left open.
