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.DM2020
#P-completeness of counting update digraphs, cacti, and a series-parallel decomposition method
Camille Noûs, Kévin Perrot, Sylvain Sené +1
Automata networks are a very general model of interacting entities, with applications to biological phenomena such as gene regulation. In many contexts, the order in which entities…
cs.DM2020
Complexity of limit-cycle problems in Boolean networks
Florian Bridoux, Caroline Gaze-Maillot, Kévin Perrot +1
Boolean networks are a general model of interacting entities, with applications to biological phenomena such as gene regulation. Attractors play a central role, and the schedule of…