4 papers
Creation of fixed points in block-parallel Boolean automata networks
Kévin Perrot, Sylvain Sené, Léah Tapin
In the context of discrete dynamical systems and their applications, fixed points often have a clear interpretation. This is indeed a central topic of gene regulatory mechanisms mo…
Foundations of block-parallel automata networks
Kévin Perrot, Sylvain Sené, Léah Tapin
We settle the theoretical ground for the study of automata networks under block-parallel update schedules, which are somehow dual to the block-sequential ones, but allow for repeti…
Complexity of Boolean automata networks under block-parallel update modes
Kévin Perrot, Sylvain Sené, Léah Tapin
Boolean automata networks (aka Boolean networks) are space-time discrete dynamical systems, studied as a model of computation and as a representative model of natural phenomena. A…
On countings and enumerations of block-parallel automata networks
Kévin Perrot, Sylvain Sené, Léah Tapin
When we focus on finite dynamical systems from both the computability/complexity and the modelling standpoints, automata networks seem to be a particularly appropriate mathematical…