Strong modules and asynchronous attractors of Boolean networks

Paul Ruet

We consider Boolean networks with interaction graphs partitioned into strongly connected components, which we call strong modules. This type of network decomposition has been consi…