3 papers
cs.LO2020
Optimising attractor computation in Boolean automata networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
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…
cs.DM2019
On the complexity of acyclic modules in automata networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Modules were introduced as an extension of Boolean automata networks. They have inputs which are used in the computation said modules perform, and can be used to wire modules with…
cs.DM2018
A framework for (de)composing with Boolean automata networks
Kévin Perrot, Pacôme Perrotin, Sylvain Sené
Boolean automata networks (BANs) are a generalisation of Boolean cellular automata. In such, any theorem describing the way BANs compute information is a strong tool that can be ap…