6 citations · 13 across the 21 of their papers we have counts for
6 papers · 1 filter
Complexity of fixed point counting problems in Boolean Networks
Florian Bridoux, Amélia Durbec, Kévin Perrot +1
A Boolean network (BN) with components is a discrete dynamical system described by the successive iterations of a function . This model finds applica…
Sandpile toppling on Penrose tilings: identity and isotropic dynamics
Jérémy Fersula, Camille Noûs, Kévin Perrot
We present experiments of sandpiles on grids (square, triangular, hexagonal) and Penrose tilings. The challenging part is to program such simulator; and our javacript code is avail…
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…
#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…
Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures
Pedro P. B. de Oliveira, Enrico Formenti, Kévin Perrot +2
In [11] and [13] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugatio…
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…