ANR project: Foundations of Automata Networks

Welcome to the webpage of ANR project FANs. The project started the 1st of January 2019 and will finish at the end of December 2023.

Project

Foundations of Automata Networks

Context

An increasing number of interaction systems is being understood as computational processes. At the foundation of these, interactions and dynamics do combine in a fascinating way. Our understanding of such processes sheds light on real interaction systems, omnipresent in physics, in biology, in daily life.

The objective of FANs is precisely to develop further our knowledge of automata networks (ANs), a reference abstract model for such systems, through fundamental and in-depth studies on the characteristics of computational processes that govern them. In other words, FANs aims at “augmenting the theory of ANs”, via approaches from fundamental computer science. Our motivation comes from : 1) the fact that we think that fundamental computer science gives an appropriate framework for the study of such networks, 2) our interest for real life networks, which drives us to study AN per se rather than as a tool for modelling. Indeed, we are convinced that this constructive and innovative approach perfectly fits the objective of finding general laws, necessary for understanding real systems.

Despite the (deliberate) simplicity of ANs, they can at the same time simulate a Turing machine in constant space, catch the natural way of designing interactions, and model their dynamics as observed in real networks. However, even though this model has been introduced in the 1940s, the state of the art assesses a form of paradox between the interest given to ANs from the applicative point of view and the current weaknesses from the theoretical point of view. Yet, it seems essential to boil down this paradox by the development of AN theory, in order to renew applicative fallouts. In this sense, FANs is in favour of a come-back to the roots of AN theory, by paying attention to fundamental problems of dynamics, complexity, and computability.

Main research directions

FANs offers to study the dynamics of ANs with a special concern on the concept of intrinsic simulation. Although largely examined in the framework of cellular automata, tilings and self-assembly, the concept of intrinsic simulation has not yet been seen in depth in the context of ANs. Nevertheless, it is central for the understanding of what founds/builds information transmissions and computations operated in discrete dynamical systems. Thereby, FANs proposes to develop this innovative concept in order to better understand the dynamical and computational complexity of ANs. Moreover, another objective of FANs is to establish formal relations between static characteristics (i.e., their interaction graphs and their local functions) and dynamics (i.e., their transition graphs) of ANs, with a particular care on the links between cycles of interactions and their attractors and basins. Here, we propose to lead works combining dynamical system theory and combinatorics, by improving the existing bound on the number of fixed points of ANs admitting a given interaction graph. Towards this aim, we will consider the influence of negative feedback cycles, which has never been done before. Furthermore, we will initiate studies regarding the counting of complex attractors, which hardly depend on update modes. The latter organise updates over discrete time, and their influence will also be studied in order to better understand causal relations within the dynamics of AN. In the long term, these developments will also surely participate in understanding problems related to the synthesis and composition of such networks, which have strong applicative impacts in biology, on the nowadays key questions of functional modularity in gene regulatory networks and cellular reprogramming.

Members

Consortium

Sylvain Sené (head), Professeur des universités, Laboratoire d’Informatique et Systèmes, Université d’Aix-Marseille.
Florian Bridoux, PhD, Laboratoire d’Informatique et Systèmes, Université d’Aix-Marseille (PhD obtained in July 2019), now a Maître de conférences at LORIA, Nancy.
Guilhem Gamard, Postdoc, Laboratoire d’Informatique et Systèmes, Université d’Aix-Marseille, now a Maître de conférences at LORIA, Nancy.
Pierre Guillon, Chargé de recherche, Institut de Mathématiques de Marseille, CNRS.
Kévin Perrot, Maître de conférences, Laboratoire d’Informatique et Systèmes, Université d’Aix-Marseille.
Pacôme Perrotin, PhD, Laboratoire d’Informatique et Systèmes, Université d’Aix-Marseille (PhD obtained in January 2021), now a freelance researcher looking for an academic position.
Adrien Richard, Chargé de recherche, Laboratoire d’Informatique, Signaux et Systèmes de Sophia Antipolis, CNRS.
Martín Ríos Wilson, PhD, Laboratoire d’Informatique et Systèmes, Universidad de Chile & Université d’Aix-Marseille (PhD obtained in May 2021), now an Assistant professor at University Adolfo Ibañez, Santiago, Chile.
Guillaume Theyssier, Chargé de recherche, Institut de Mathématiques de Marseille, CNRS.

Local collaborators

Amélia Durbec, PhD, Laboratoire d’Informatique et Systèmes, Université d’Aix-Marseille, now on an ATER position at LRI, Saclay.
Antonio E. Porreca, Maître de conférences, Laboratoire d’Informatique et Systèmes, Université d’Aix-Marseille.

Institutions

Events

2019 January 25th
Kick-off meeting in Marseille (France).
2019 February 15th
Internal meeting on sequential programming in Marseille (St Charles).
2019 February 25th - March 3rd
Julio Aracena, Professor at the University of Concepción (Chile), comes to Marseille to visit us.
2019 March 1st
Internal meeting on simulation definitions in Marseille (St Charles).
2019 March 4th - March 8th
Kévin Perrot gives a talk on maximum fixed point problem at the International Conference on Algorithms, optimization and Learning in Dynamic Environments, AOL’19 in Hanoi (Vietnam), and visits Ha Duong Phan at the Institute of Mathematics of the Vietnam Academy of Science and Technology.
2019 March 11th - March 14th
Nicolas Durbec presents a poster on maximum fixed point problem at the GDR IM annual days in Orléans (France).
2019 April 2nd
Internal meeting on complexity questions in Marseille (Luminy).
2019 April 2nd
Group seminary with Pedro Balbi de Oliveira on Could density determination be solved with one-dimensional binary cellular automata with asynchronous update?.
2019 April 30th
Group seminary with Sylvère Gangloff on The search for a complexity notion for organised dynamical systems.
2019 May 6th
Group seminary with Eurico Ruivo on Inference and of elementary cellular automata limit-graphs.
2019 May 16th - May 17th
Jacques Demongeot and François Robert, resp. Professor emeritus and former Professsor at Grenoble University, come to Marseille to visit us.
2019 May 18th
Kévin Perrot gives a popularisation talk on complexity and computability - on solving problems with computers at the regional day of association of mathematics teachers in public schools (APMEP) in Marseille (Saint-Charles).
2019 May 20th
Sylvain Sené gives a popularisation talk on natural computation for life sciences, and vice versa! at the MPCI thematic school 2019 in Marseille (Château-Gombert).
2019 May 23th
Group seminary with Sara Riva on Solving equations on discrete dynamical systems.
2019 July 1st
Adrien Richard and Sylvain Sené become members of the scientific committee of the International Workshop on Boolean Networks 2020 (IWBN’20) that will take place in 2020 January in Concepcíon, Chile.
2019 July 9th
Group seminary with Enrico Formenti on Computational complexity of finite asynchronous cellular automata.
2019 July 15th
Florian Bridoux defends his PhD thesis in Marseille.
2019 July 19th
Florian Bridoux gives a talk on complexity and fixed points in Boolean networks at the conference Computability in Europe in Durham (UK).
2019 September 1st - 2020 June 31st
Kévin Perrot leads a MATh.en.JEANS group (one year of research with a group of pupils supervised by a math teacher) with lycée Mendes-France (Vitrolles) on Un zéro surprenant… (identity of a finite dynamical system, the sandpile group).
2019 September 1st - 2020 December 31st
Kévin Perrot visits I3S Lab. at Sophia Antipolis, thanks to his CNRS delegation.
2019 October 10th
Internal meeting on complexity questions and Rice theorem in Marseille (Luminy).
2019 October 15th
Internal meeting on simulation definitions in Marseille (Luminy).
2019 October 22nd
Internal meeting on complexity questions and Rice theorem in Marseille (Luminy).
2019 November 14th
Participation to the Automata Factory 2 workshop at Universidad Adolfo Ibáñez (Santiago, Chile) of Kévin Perrot (talk on complexity of attractor problems in Boolean networks) and Pacôme Perrotin (talk on adding inputs to automata networks).
2019 November 25th - December 6th
Marco Montalva-Medel, Assistant Professor at the University Adolfo Ibañez (Chile), comes to Marseille to visit us.
2019 November 26th
Internal meeting on updating modes and clocks in Marseille (Luminy).
2019 November 28th
Internal meeting on complexity questions and Rice theorem in Marseille (Luminy).
2019 December 10th
Internal meeting on simulation definitions in Marseille (Luminy).
2019 December 20th
Internal meeting on simulation definitions in Marseille (St Charles).
2020 January 7th
Group seminary with Nicolas Schabanel on Simple intrinsic simulation of cellular automata in oritatami molecular folding model.
2020 January 8th
Florian Bridoux gives a talk on complexity of limit cycle problems in conjunctive networks with different schedules at the International Workshop on Boolean Networks, IWBN’20 in Concepcíon (Chile).
2020 January 8th
Adrien Richard gives a talk on synchronizing Boolean networks asynchronously at the International Workshop on Boolean Networks, IWBN’20 in Concepcíon (Chile).
2020 January 16th
Internal meeting on simulation definitions in Marseille (Luminy).
2020 February 3rd
Internal meeting on updating modes and complexity in Marseille (St Charles).
2020 February 7th
Internal meeting on simulation definitions in Marseille (Luminy).
2020 February 18th
Internal meeting on simulation definitions and complexity in Marseille (Luminy).
2020 March 1st - ...
COVID-19 pandemic constrains FANs activities.
2020 March 15th - 2020 May 15th
French COVID-19 1st confinement severely constrains FANs activities.
2020 April 14th
Group seminary with Marius Buliga on Molecular computers in artificial chemistry.
2020 June 12th
Internal meeting on complexity questions and Rice theorem in Marseille (St Charles).
2020 June 15th
Internal meeting on simulation questions in Marseille (St Charles).
2020 June 29th
Lucas Venturini gives an online talk on &sharp;P-completeness of counting update digraphs, cacti, and series-parallel decomposition method at the conference Computability in Europe, CiE’20 in Salerne (Italy).
2020 July 1st
Florian Bridoux gives an online talk on simulation in automata networks at the conference Computability in Europe, CiE’20 in Salerne (Italy).
2020 July 1st
Beginning of the organisation of the joint events AUTOMATA and WAN 2021.
2020 July 17th
Internal meeting on complexity questions and Rice theorem in Marseille (St Charles).
2020 August 11th
Florian Bridoux gives an online talk on commutative automata networks at the International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA’20 in Stockholm (Sweden).
2020 October 6th
Group seminary with Enrico Porreca on The semiring of dynamical systems.
2020 October 20th
Pacôme Perrotin gives an online talk on the complexity of acyclic modules in automata networks at the International Conference on Theory and Applications of Models of Computation, TAMC’20 in Changsha (China).
2020 October 27th
Group seminary with Guilhem Gamard on Rice-like theorems for automata networks.
2020 October 30th - 2020 December 15th
French COVID-19 2nd confinement severely constrains FANs activities.
2020 November 2nd
Online Meeting on AUTOMATA 2021 scientific organisation.
2020 November 20th
Online meeting on WAN scientific organisation.
2020 November 27th
Online participation to the Automata Factory 3 workshop organised by Universidad Adolfo Ibáñez (Santiago, Chile) of Guillaume Theyssier (talk on expansive automata networks).
2020 November 27th
Online participation to the SDA2 workshop organised by GREYC lab (Caen, France) of Guillaume Theyssier (talk on parametrized complexity of freezing dynamics).
2021 January 5th
Group seminary with Pacôme Perrotin on Simulation between natural computing models and automata network modularity.
2021 January 12th
Pacôme Perrotin defends his PhD thesis in Marseille.
2021 January 28th
Florian Bridoux gives an online talk on complexity of limit-cycle problems in Boolean networks at the International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM’21 in Bolzano-Bozen (Italy).
2021 February 2nd
Internal meeting on simulation in Marseille (St Charles).
2021 February 12th
Internal meeting on simulation in Marseille (St Charles).
2021 February 16th
Kévin Perrot gives a popularisation talk on some fun around cellular automata at C@fé de l’Association des Doctorants en Sciences et Technologies de l’Information et de la Communication (ADSTIC) (Université Côte d’Azur).
2021 March 12th
Internal meeting on simulation in Marseille (St Charles).
2021 March 18th
Guilhem Gamard gives an online talk on Rice-like theorems for automata networks at the International Symposium on Theoretical Aspects of Computer Science, STACS’21 in Saarbrücken (Germany).
2021 April 3rd - 2021 June 30th
French COVID-19 3rd confinement severely constrains FANs activities.
2021 May 31st
Martín Ríos Wilson defends his PhD thesis in Santiago (Chile).
2021 June 14th
Sylvain Sené gives a presentation on Boolean networks at the LACL Seminary in Créteil.
2021 July 12th - 2021 July 17th
AUTOMATA and WAN 2021
2021 July 13th
Amélia Durbec gives a presentation on graph subshifts at the International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA’21 in Marseille.
2021 July 14th
Pacôme Perrotin gives a presentation on associating parallel automata network dynamics and strictly one-way cellular automata at the International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA’21 in Marseille.
2021 July 14th
Sylvain Sené introduces the Workshop on Automata Networks, WAN’21 in Marseille.
2021 July 14th
Enrico Porreca gives a presentation on dynamical systems and their algebra at the Workshop on Automata Networks, WAN’21 in Marseille.
2021 July 15th
Pierre Guillon gives a presentation on the simulation notion at the International Workshop on Automata Networks, WAN’21 in Marseille.
2021 July 15th
Florian Bridoux gives a presentation on complete simulation in automata networks at the International Workshop on Automata Networks, WAN’21 in Marseille.
2021 July 16th
Guilhem Gamard gives a presentation on Rice-like theorems for automata networks at the International Workshop on Automata Networks, WAN’21 in Marseille.
2021 July 16th
Kévin Perrot gives a presentation on Complexities of block-sequential update modes at the International Workshop on Automata Networks, WAN’21 in Marseille.
2021 September 21st
Pacôme Perrotin gives an online presentation on optimising attractor computation in Boolean automata networks at International Conference on Language and Automata Theory and Applications, LATA’21 in Milan (Italy).
2021 November 4th
Group seminary with Shyan Shaer Akmal on Majority-3SAT (and related problems) in polynomial time.
2021 November 25th
Kévin Perrot gives a presentation on Sandpiles and Tutte polynomial at the seminar of ALMOST team from David laboratory, Université de Versailles Saint-Quentin-en-Yvelines.
2021 December 9th - 2021 July 10th
Online participation to the Automata Factory 4 workshop organised by Universidad Adolfo Ibáñez (Santiago, Chile) of Kévin Perrot (talk on Complexities of automata networks).
2022 March 8th
Kévin Perrot gives a presentation on Théorème du point fixe de Kleene en calculabilité at the seminar of CANA team.
2022 March 14th
Kévin Perrot gives a presentation on What computers cannot do at the internal seminar of CENTURI project.
2022 April 5th
Group seminary with Sara Riva on A pipeline for solving equations over discrete dynamical systems.
2022 May 21st - 2022 July 11th
Pablo Concha, PhD student from the University Adolfo Ibañez (Chile) in cotutelle with AMU co-supervised by Eric Goles, Pedro Montealegre and Kévin Perrot, comes to Marseille to visit us.
2022 June 3rd
Kévin Perrot gives a presentation on Automata network’s interaction graph and complexity at the GT Bioss seminar from GDR-IM.
2022 June 4th - 2022 July 14th
Eric Goles, Full Professor at the University Adolfo Ibañez (Chile), comes to Marseille to visit us.
2022 June 21st
Group seminary with Éric Rémila on Influence - a partizan scoring game on graphs.
2022 June 28th - 2022 July 12th
Martín Ríos Wilson, Assistant Professor at the University Adolfo Ibañez (Chile), comes to Marseille to visit us.
2022 July 5th
Dia Chileno at Luminy (blackboard exchanges gathering 11 people from the community) with our guests from Chile: Pablo Concha, Eric Goles and Martín Ríos Wilson.
2022 July 10th - 2022 July 17th
Lilian Salinas and Julio Aracena, resp. Associate and Full Professors at the University of Concepción (Chile), come to Marseille visit us.
2022 September 11th - 2022 October 28th
Ignacio Osorio, PhD student from the University of Concepción (Chile), come to Nice to visit Adrien Richard.
2022 October 4th
Group seminary with Aymeric Picard Marchetto on Interaction graphs of isomorphic automata networks.
2022 October 20th
Kévin Perrot gives a public talk on Le jeu de la vie : quand le complexe émerge du simple at the Alcazar library, for the outreach event La science pour tous of CENTURI project.
2023 February
The project FANs has been selected and will participate to the Festival On’R (ANR project FESTIV-On’R-1819 coordinated and obtained by AMU through the call SAPS-CSTI-Générique 18/19), which will take place in Marseille in May-June 2024 and will be dedicated to popularising science.
2023 March 13th
Group seminary with Ekaterina Timofeeva on Generation and decomposition of dynamical systems.
2023 March 22nd - 2023 March 23rd
ANs’ Days on finite dynamical systems and complexity in Marseille.
2023 May 2nd
Group seminary with Eurico Ruivo on An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata.
2023 May 30th
Group seminary with Van-Giang Trinh on Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding.
2023 June 5th - 2023 March 9th
Sylvain Sené is an invited Professor at the CNRS Bioregul thematic research school, and gives a course on automata networks.
2023 June 14th
Half-day on locality, grouping together members of FANs and members of the DALGO research group of LIS.
2023 June 20th
Group seminary with Enrico Formenti on An introduction on formal series I.
2023 July 4th
Group seminary with Enrico Formenti on An introduction on formal series II.
2023 October 8th
Kévin Perrot gives a public lecture on the Game of Life cellular automaton, at lycée Marseilleveyre (13008), for the national event Fête de la science.
2023 October 18th - 2023 October 20th
Two entire days in between Marseille and Nice, grouping together members of FANs to work on automata networks, far from the everyday life.
2023 October 23rd - 2023 October 27th
Kévin Perrot guides a group of two teenagers on the generation of Long cycles in Boolean automata networks, during the autumn Cigales school at CIRM.
2023 November 7th
Group seminary with Enrico Formenti on An introduction on formal series III.
2023 November 14th
Group seminary with Athénaïs Vaginay on From reaction networks to Boolean networks - why and how.
2023 November 28th
Group seminary with Augusto Modanese on tba.
2023 December 12th
Group seminary with Célia Biane on Biological networks - from Boolean models in computational precision oncology to experimental neurosciences.

FANs publications

List

Bridoux, Florian. “Intrinsic Simulations and Complexities in Automata Networks.” PhD thesis, Université d’Aix-Marseille, 2019. In French. eprint-link
```
@phdthesis{b19,
  author = {Bridoux, Florian},
  title = {{Intrinsic simulations and complexities in automata networks}},
  school = {Universit{\'e} d'Aix-Marseille},
  year = {2019},
  note = {In French},
  optdoi = {},
  eprint = {https://hal.archives-ouvertes.fr/tel-02436228/document}
}
```

Bridoux, Florian, Nicolas Durbec, Kévin Perrot, and Adrien Richard. “Complexity of Maximum Fixed Point Problem in Boolean Networks.” In Proceedings of CiE’19, 11558:132–43. LNCS, 2019. DOI-link eprint-link

@inproceedings{bdpr19,
  author = {Bridoux, Florian and Durbec, Nicolas and Perrot, K{\'e}vin and Richard, Adrien},
  title = {{Complexity of maximum fixed point problem in Boolean networks}},
  booktitle = {Proceedings of CiE'19},
  pages = {132-143},
  year = {2019},
  volume = {11558},
  series = {LNCS},
  doi = {10.1007/978-3-030-22996-2_12},
  eprint = {https://webusers.i3s.unice.fr/%7Ebridoux/articles/BridouxDPR19.pdf}
}

Richard, Adrien. “Nilpotent Dynamics on Signed Interaction Graphs and Weak Converses of Thomas’ Rules.” Discrete Applied Mathematics 267 (2019): 160–75. DOI-link eprint-link

@article{r19a,
  author = {Richard, Adrien},
  title = {{Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules}},
  journal = {Discrete Applied Mathematics},
  year = {2019},
  volume = {267},
  pages = {160-175},
  doi = {10.1016/j.dam.2019.04.025},
  eprint = {https://webusers.i3s.unice.fr/%7Erichard/PUBLICATIONS/JOURNALS/2018_DBS.pdf}
}

———. “Positive and Negative Cycles in Boolean Networks.” Journal of Theoretical Biology 463 (2019): 67–76. DOI-link eprint-link

@article{r19b,
  author = {Richard, Adrien},
  title = {{Positive and negative cycles in Boolean networks}},
  journal = {Journal of Theoretical Biology},
  year = {2019},
  volume = {463},
  pages = {67-76},
  doi = {10.1016/j.jtbi.2018.11.028},
  eprint = {https://www.i3s.unice.fr/~richard/PUBLICATIONS/JOURNALS/2019_Rene_Thomas.pdf}
}

Aracena, Julio, Maximilien Gadouleau, Adrien Richard, and Lilian Salinas. “Fixing Monotone Boolean Networks Asynchronously.” Information and Computation 274 (2020): 104540. DOI-link eprint-link
```
@article{agrs20,
  author = {Aracena, Julio and Gadouleau, Maximilien and Richard, Adrien and Salinas, Lilian},
  title = {{Fixing monotone Boolean networks asynchronously}},
  journal = {Information and Computation},
  year = {2020},
  volume = {274},
  pages = {104540},
  doi = {10.1016/j.ic.2020.104540},
  eprint = {https://arxiv.org/abs/1802.02068}
}
```

Balbi, Pedro P., Enrico Formenti, Kévin Perrot, Sara Riva, and Eurico L. P. Ruivo. “Non-Maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures.” In Proceedings of AUTOMATA’20, 12286:14–28. LNCS. Springer, 2020. DOI-link eprint-link

@inproceedings{bfprr20,
  author = {Balbi, Pedro P. and Formenti, Enrico and Perrot, K{\'e}vin and Riva, Sara and Ruivo, Eurico L. P.},
  title = {{Non-maximal sensitivity to synchronism in periodic elementary cellular automata: exact asymptotic measures}},
  booktitle = {Proceedings of AUTOMATA'20},
  pages = {14-28},
  year = {2020},
  volume = {12286},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-61588-8_2},
  eprint = {https://arxiv.org/abs/2004.07128}
}

Bridoux, Florian, Alfonso Castillo-Ramirez, and Maximilien Gadouleau. “Complete Simulation in Automata Networks.” Journal of Computer and System Sciences 109 (2020): 1–21. DOI-link eprint-link
```
@article{bcrg20,
  author = {Bridoux, Florian and Castillo-Ramirez, Alfonso and Gadouleau, Maximilien},
  title = {{Complete simulation in automata networks}},
  journal = {Journal of Computer and System Sciences},
  year = {2020},
  volume = {109},
  pages = {1-21},
  doi = {10.1016/j.jcss.2019.12.001},
  eprint = {https://arxiv.org/pdf/1504.00169.pdf}
}
```

Bridoux, Florian, Maximilien Gadouleau, and Guillaume Theyssier. “On Simulation in Automata Networks.” In Proceedings of CiE’20, 12098:277–88. LNCS. Springer, 2020. DOI-link eprint-link

@inproceedings{bgt20a,
  author = {Bridoux, Florian and Gadouleau, Maximilien and Theyssier, Guillaume},
  title = {{On simulation in automata networks}},
  booktitle = {Proceedings of CiE'20},
  pages = {277-288},
  year = {2020},
  volume = {12098},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-51466-2_24},
  eprint = {https://arxiv.org/pdf/2001.09198.pdf}
}

———. “Commutative Automata Networks.” In Proceedings of AUTOMATA’20, 12286:43–58. LNCS. Springer, 2020. DOI-link eprint-link

@inproceedings{bgt20b,
  author = {Bridoux, Florian and Gadouleau, Maximilien and Theyssier, Guillaume},
  title = {{Commutative automata networks}},
  booktitle = {Proceedings of AUTOMATA'20},
  pages = {43-58},
  year = {2020},
  volume = {12286},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-61588-8_4},
  eprint = {https://arxiv.org/pdf/2004.09806.pdf}
}

———. “Expansive Automata Networks.” Theoretical Computer Science 843 (2020): 25–44. DOI-link eprint-link

@article{bgt20c,
  author = {Bridoux, Florian and Gadouleau, Maximilien and Theyssier, Guillaume},
  title = {{Expansive automata networks}},
  journal = {Theoretical Computer Science},
  year = {2020},
  volume = {843},
  pages = {25-44},
  doi = {10.1016/j.tcs.2020.06.019},
  eprint = {https://arxiv.org/pdf/1902.08007.pdf}
}

Demongeot, Jacques, and Sylvain Sené. “About Block-Parallel Boolean Networks: a Position Paper.” Natural Computing 19 (2020): 5–13. DOI-link eprint-link
```
@article{ds20,
  author = {Demongeot, Jacques and Sen{\'e}, Sylvain},
  title = {{About block-parallel Boolean networks: a position paper}},
  journal = {Natural Computing},
  year = {2020},
  volume = {19},
  pages = {5-13},
  doi = {10.1007/s11047-019-09779-x},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/ds20.pdf}
}
```
Formenti, Enrico, and Kévin Perrot. “How Hard Is It to Predict Sandpiles on Lattices? A Survey.” Fondamenta Informaticae 171 (2020): 189–219. DOI-link eprint-link
```
@article{fp20,
  author = {Formenti, Enrico and Perrot, K{\'e}vin},
  title = {{How hard is it to predict sandpiles on lattices? A survey}},
  journal = {Fondamenta Informaticae},
  volume = {171},
  pages = {189--219},
  numpages = {31},
  year = {2020},
  doi = {10.3233/FI-2020-1879},
  eprint = {https://arxiv.org/pdf/1909.12150.pdf}
}
```

Goles, Eric, Fabiola Lobos, Gonzalo A. Ruz, and Sylvain Sené. “Attractor Landscapes in Boolean Networks with Firing Memory.” Natural Computing 19 (2020): 295–319. DOI-link eprint-link

@article{glrs20,
  author = {Goles, Eric and Lobos, Fabiola and Ruz, Gonzalo A. and Sen{\'e}, Sylvain},
  title = {{Attractor landscapes in Boolean networks with firing memory}},
  journal = {Natural Computing},
  year = {2020},
  volume = {19},
  pages = {295-319},
  doi = {10.1007/s11047-020-09789-0},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/glrs20.pdf}
}

Nguyen, Viet-Ha, Kévin Perrot, and Mathieu Vallet. “NP-Completeness of the Game KingdominoTM.” Theoretical Computer Science 822 (2020): 23–35. DOI-link eprint-link
```
@article{npv20,
  author = {Nguyen, Viet-Ha and Perrot, K{\'e}vin and Vallet, Mathieu},
  title = {{NP-completeness of the game KingdominoTM}},
  journal = {Theoretical Computer Science},
  year = {2020},
  volume = {822},
  pages = {23-35},
  doi = {10.1016/j.tcs.2020.04.007},
  eprint = {https://arxiv.org/pdf/1909.02849.pdf}
}
```
Perrot, Kévin, Marco Montalva-Medel, Pedro P. B. de Oliveira, and Eurico L. P. Ruivo. “Maximum Sensitivity to Update Schedule of Elementary Cellular Automata over Periodic Configurations.” Natural Computing 19 (2020): 51–90. DOI-link eprint-link
```
@article{pmmor20,
  author = {Perrot, K{\'e}vin and Montalva-Medel, Marco and de Oliveira, Pedro P. B. and Ruivo, Eurico L. P.},
  title = {{Maximum sensitivity to update schedule of elementary cellular automata over periodic configurations}},
  journal = {Natural Computing},
  year = {2020},
  volume = {19},
  pages = {51-90},
  doi = {10.1007/s11047-019-09743-9},
  eprint = {https://hal.archives-ouvertes.fr/hal-02179732v1}
}
```

Perrot, Kévin, Pacôme Perrotin, and Sylvain Sené. “On the Complexity of Acyclic Modules in Automata Networks.” In Proceedings of TAMC’20, 12337:168–80. LNCS. Springer, 2020. DOI-link eprint-link

@inproceedings{pps20,
  author = {Perrot, K{\'e}vin and Perrotin, Pac{\^o}me and Sen{\'e}, Sylvain},
  title = {{On the complexity of acyclic modules in automata networks}},
  booktitle = {Proceedings of TAMC'20},
  pages = {168-180},
  year = {2020},
  volume = {12337},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-59267-7_15},
  eprint = {https://arxiv.org/pdf/1910.07299.pdf}
}

Noûs, Camille, Kévin Perrot, Sylvain Sené, and Lucas Venturini. “#P-Completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method.” In Proceedings of CiE’20, 12098:326–38. LNCS. Springer, 2020. DOI-link eprint-link

@inproceedings{psv20,
  author = {No{\^u}s, Camille and Perrot, K{\'e}vin and Sen{\'e}, Sylvain and Venturini, Lucas},
  title = {{\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method}},
  booktitle = {Proceedings of CiE'20},
  pages = {326-338},
  year = {2020},
  volume = {12098},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-51466-2_30},
  eprint = {https://arxiv.org/pdf/2004.02129.pdf}
}

Perrot, Kévin, and Éric Rémila. “On the Emergence of Regularities on One-Dimensional Decreasing Sandpiles.” Theoretical Computer Science 843 (2020): 1–24. DOI-link eprint-link

@article{pr20,
  author = {Perrot, K{\'evin} and R{\'e}mila, {\'E}ric},
  title = {{On the emergence of regularities on one-dimensional decreasing sandpiles}},
  journal = {Theoretical Computer Science},
  year = {2020},
  volume = {843},
  pages = {1--24},
  numpages = {24},
  publisher = {Elsevier},
  doi = {10.1016/j.tcs.2020.06.018},
  eprint = {https://shs.hal.science/halshs-02884875v1/document}
}

Ruivo, Eurico L. P., Pedro P. Balbi, Marco Montalva-Medel, and Kévin Perrot. “Maximum Sensitivity to Update Schedules of Elementary Cellular Automata over Infinite Configurations.” Information and Computation 274 (2020): 104538. DOI-link eprint-link

@article{rbmmp20,
  author = {Ruivo, Eurico L. P. and Balbi, Pedro P. and Montalva-Medel, Marco and Perrot, K{\'e}vin},
  title = {{Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations}},
  journal = {Information and Computation},
  year = {2020},
  volume = {274},
  pages = {104538},
  doi = {10.1016/j.ic.2020.104538},
  eprint = {https://hal.science/hal-02179732/file/ECA-synchronismSensibility.pdf}
}

Bridoux, Florian, Caroline Gaze-Maillot, Kévin Perrot, and Sylvain Sené. “Complexity of Limit-Cycle Problems in Boolean Networks.” In Proceedings of SOFSEM’21, 12607:135–46. LNCS. Springer, 2021. DOI-link eprint-link

@inproceedings{bgmps21,
  author = {Bridoux, Florian and Gaze-Maillot, Caroline and Perrot, K{\'e}vin and Sen{\'e}, Sylvain},
  title = {{Complexity of limit-cycle problems in Boolean networks}},
  booktitle = {{Proceedings of SOFSEM'21}},
  pages = {135-146},
  year = {2021},
  volume = {12607},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-67731-2_10},
  eprint = {https://arxiv.org/pdf/2001.07391.pdf}
}

Castillo-Ramirez, Alonso, Pierre Guillon, and Kévin Perrot, eds. 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems. Vol. 90. OASIcs. Schloss Dagstuhl Publishing, 2021. DOI-link eprint-link

@proceedings{automata21,
  title = {{27th IFIP WG 1.5 International Workshop on Cellular Automata
  and Discrete Complex Systems}},
  year = {2021},
  editor = {Castillo-Ramirez, Alonso and Guillon, Pierre and Perrot, K{\'e}vin},
  volume = {90},
  series = {OASIcs},
  publisher = {Schloss Dagstuhl Publishing},
  doi = {10.4230/OASIcs.AUTOMATA.2021.0},
  eprint = {https://drops.dagstuhl.de/opus/volltexte/2021/14009/pdf/OASIcs-AUTOMATA-2021-0.pdf}
}

Gamard, Guilhem, Pierre Guillon, Kévin Perrot, and Guillaume Theyssier. “Rice-like Theorem for Automata Networks.” In Proceedings of STACS’21, 187:32:1–32:17. LIPIcs. Schloss Dagstuhl, 2021. DOI-link eprint-link

@inproceedings{ggpt21,
  author = {Gamard, Guilhem and Guillon, Pierre and Perrot, K{\'e}vin and Theyssier, Guillaume},
  title = {{Rice-like theorem for automata networks}},
  booktitle = {Proceedings of STACS'21},
  pages = {32:1-32:17},
  year = {2021},
  volume = {187},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl},
  doi = {10.4230/LIPIcs.STACS.2021.32},
  eprint = {https://drops.dagstuhl.de/opus/volltexte/2021/13677/pdf/LIPIcs-STACS-2021-32.pdf}
}

Goles, Eric, Andrew Adamatzky, Pedro Montealegre, and Martín Ríos Wilson. “Generating Boolean Functions on Totalistic Automata Networks.” International Journal of Unconventional Computing 16 (2021): 343–91. eprint-link

@article{gamrw21,
  author = {Goles, Eric and Adamatzky, Andrew and Montealegre, Pedro and R{\'i}os Wilson, Mart{\'i}n},
  title = {{Generating Boolean functions on totalistic automata networks}},
  journal = {International Journal of Unconventional Computing},
  year = {2021},
  volume = {16},
  pages = {343--391},
  numpages = {49},
  publisher = {Old City Publishing},
  optdoi = {},
  eprint = {https://arxiv.org/pdf/2107.14799.pdf}
}

Goles, Eric, Diego Maldonado, Pedro Montealegre, and Martín Ríos Wilson. “On the Complexity of Asynchronous Freezing Cellular Automata.” Information and Computation 281 (2021): 104764. DOI-link eprint-link

@article{gmmrw21,
  author = {Goles, Eric and Maldonado, Diego and Montealegre, Pedro and R{\'i}os Wilson, Mart{\'i}n},
  title = {{On the complexity of asynchronous freezing cellular automata}},
  journal = {Information and Computation},
  year = {2021},
  volume = {281},
  pages = {104764},
  numpages = {28},
  publisher = {Elsevier},
  doi = {10.1016/j.ic.2021.104764},
  eprint = {https://arxiv.org/pdf/1910.10882.pdf}
}

Goles, Eric, Pedro Montealegre, and Kévin Perrot. “Freezing Sandpiles and Boolean Threshold Networks: Equivalence and Complexity.” Advances in Applied Mathematics 125 (2021): 102161. DOI-link eprint-link
```
@article{gmp21,
  author = {Goles, Eric and Montealegre, Pedro and Perrot, K{\'e}vin},
  title = {{Freezing sandpiles and Boolean threshold networks: equivalence and complexity}},
  journal = {Advances in Applied Mathematics},
  year = {2021},
  volume = {125},
  pages = {102161},
  doi = {10.1016/j.aam.2020.102161},
  eprint = {https://arxiv.org/pdf/2101.04204.pdf}
}
```

Goles, Eric, Pedro Montealegre, Martín Ríos Wilson, and Guillaume Theyssier. “On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics.” In Proceedings of CiE’21, 12813:260–72. LNCS. Springer, 2021. DOI-link eprint-link

@inproceedings{gmmrt21,
  author = {Goles, Eric and Montealegre, Pedro and R{\'i}os Wilson, Mart{\'i}n and Theyssier, Guillaume},
  title = {{On the impact of treewidth in the computational complexity of freezing dynamics}},
  booktitle = {Proceedings of CiE'21},
  pages = {260--272},
  year = {2021},
  volume = {12813},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-80049-9_24},
  eprint = {https://arxiv.org/pdf/2005.11758.pdf}
}

Paulevé, Loïc, and Sylvain Sené. “Non-Deterministic Updates of Boolean Networks.” In Proceedings of AUTOMATA’21, 90:10:1–10:16. OASIcs. Schloss Dagstuhl Publishing, 2021. DOI-link eprint-link

@inproceedings{ps21,
  author = {Paulev\'{e}, Lo\"{i}c and Sen\'{e}, Sylvain},
  title = {{Non-deterministic updates of Boolean networks}},
  booktitle = {Proceedings of AUTOMATA'21},
  pages = {10:1--10:16},
  year = {2021},
  volume = {90},
  series = {OASIcs},
  publisher = {Schloss Dagstuhl Publishing},
  doi = {10.4230/OASIcs.AUTOMATA.2021.10},
  eprint = {https://arxiv.org/pdf/2106.15372.pdf}
}

Perrot, Kévin, Pacôme Perrotin, and Sylvain Sené. “Optimising Attractor Computation in Boolean Automata Networks.” In Proceedings of LATA’21, 12638:68–80. LNCS. Springer, 2021. DOI-link eprint-link

@inproceedings{pps21a,
  author = {Perrot, K{\'e}vin and Perrotin, Pac{\^o}me and Sen{\'e}, Sylvain},
  title = {{Optimising attractor computation in Boolean automata networks}},
  booktitle = {Proceedings of LATA'21},
  pages = {68-80},
  year = {2021},
  volume = {12638},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-030-68195-1_6},
  eprint = {https://arxiv.org/pdf/2005.14531.pdf}
}

———. “On Boolean Automata Networks (De)Composition.” Fundamenta Informaticae 181 (2021): 163–88. DOI-link eprint-link

@article{pps21b,
  author = {Perrot, K{\'e}vin and Perrotin, Pac{\^o}me and Sen{\'e}, Sylvain},
  title = {{On Boolean automata networks (de)composition}},
  journal = {Fundamenta Informaticae},
  year = {2021},
  volume = {181},
  pages = {163--188},
  doi = {10.3233/FI-2021-2055},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/pps21b.pdf}
}

Perrotin, Pacôme. “Simulation between Natural Computational Models and Modularity in Automata Networks.” PhD thesis, Université d’Aix-Marseille, 2021. In French. eprint-link
```
@phdthesis{p21,
  author = {Perrotin, Pac{\^o}me},
  title = {{Simulation between natural computational models and modularity in automata networks}},
  school = {Universit{\'e} d'Aix-Marseille},
  year = {2021},
  note = {In French},
  optdoi = {},
  eprint = {https://tel.archives-ouvertes.fr/tel-03188307/document}
}
```
———. “Associating Parallel Automata Network Dynamics and Strictly One-Way Cellular Automata.” In Proceedings of AUTOMATA’21 (Exploratory Papers), 8:1–8:15, 2021. eprint-link
```
@inproceedings{p21b,
  author = {Perrotin, Pac{\^o}me},
  title = {{Associating parallel automata network dynamics and strictly one-way cellular automata}},
  booktitle = {Proceedings of AUTOMATA'21 (Exploratory papers)},
  pages = {8:1--8:15},
  year = {2021},
  eprint = {https://hal.science/hal-03237179v1/document}
}
```
Picard Marchetto, Aymeric, and Adrien Richard. “Isomorphic Boolean Networks and Dense Interaction Graphs.” In Proceedings of AUTOMATA’21 (Exploratory Papers), 9:1–9:13, 2021. eprint-link
```
@inproceedings{pmr21,
  author = {Picard Marchetto, Aymeric and Richard, Adrien},
  title = {{Isomorphic Boolean networks and dense interaction graphs}},
  booktitle = {Proceedings of AUTOMATA'21 (Exploratory papers)},
  pages = {9:1--9:13},
  year = {2021},
  eprint = {https://hal.archives-ouvertes.fr/hal-03235769/document}
}
```
Ríos Wilson, Martín. “On Automata Networks Dynamics: an Approach Based on Computational Complexity Theory.” PhD thesis, Université d’Aix-Marseille, 2021. In English. eprint-link
```
@phdthesis{rw21,
  author = {R{\'i}os Wilson, Mart{\'i}n},
  title = {{On automata networks dynamics: an approach based on computational complexity theory}},
  school = {Universit{\'e} d'Aix-Marseille},
  year = {2021},
  note = {In English},
  eprint = {https://tel.archives-ouvertes.fr/tel-03264167/document}
}
```

Bridoux, Florian. “Sequentialization and Procedural Complexity in Automata Networks.” Theoretical Computer Science 898 (2022): 92–109. DOI-link eprint-link

@article{b22,
  author = {Bridoux, Florian},
  title = {{Sequentialization and procedural complexity in automata networks}},
  journal = {Theoretical Computer Science},
  year = {2022},
  volume = {898},
  pages = {92--109},
  numpages = {18},
  publisher = {Elsevier},
  doi = {10.1016/j.tcs.2021.11.001},
  eprint = {https://hal.archives-ouvertes.fr/hal-01718527/document}
}

Bridoux, Florian, Amélia Durbec, Kévin Perrot, and Adrien Richard. “Complexity of Fixed Point Counting Problems in Boolean Networks.” Journal of Computer and System Sciences 126 (2022): 138–64. DOI-link eprint-link

@article{b22b,
  author = {Bridoux, Florian and Durbec, Am{\'e}lia and Perrot, K{\'e}vin and Richard, Adrien},
  title = {{Complexity of fixed point counting problems in Boolean networks}},
  journal = {Journal of Computer and System Sciences},
  year = {2022},
  volume = {126},
  pages = {138--164},
  numpages = {27},
  publisher = {Elsevier},
  doi = {10.1016/j.jcss.2022.01.004},
  eprint = {https://arxiv.org/pdf/2012.02513.pdf}
}

Demongeot, Jacques, Tarek Melliti, Mathilde Noual, Damien Regnault, and Sylvain Sené. “On Boolean Automata Isolated Cycles and Tangential Double-Cycles Dynamics.” Chapter of Automata and Complexity 42 (2022): 145–78. Springer Series on Emergence, Complexity, Computation. DOI-link eprint-link

@article{dmnrs22,
  author = {Demongeot, Jacques and Melliti, Tarek and Noual, Mathilde and Regnault, Damien and Sen{\'e}, Sylvain},
  title = {{On Boolean automata isolated cycles and tangential double-cycles dynamics}},
  journal = {Chapter of Automata and Complexity},
  year = {2022},
  volume = {42},
  publisher = {Springer},
  pages = {145--178},
  note = {Springer Series on Emergence, Complexity, Computation},
  doi = {10.1007/978-3-030-92551-2_11},
  eprint = {https://arxiv.org/pdf/2204.10686.pdf}
}

Goles, Eric, Marco Montalva-Medel, Pedro Montealegre, and Martín Ríos-Wilson. “On the Complexity of Generalized Q2R Automaton.” Advances in Applied Mathematics 138 (2022): 102355. DOI-link eprint-link
```
@article{gmmmrw22,
  author = {Goles, Eric and Montalva-Medel, Marco and Montealegre, Pedro and R{\'i}os-Wilson, Mart{\'i}n},
  title = {{On the complexity of generalized Q2R automaton}},
  journal = {Advances in Applied Mathematics},
  year = {2022},
  volume = {138},
  pages = {102355},
  doi = {10.1016/j.aam.2022.102355},
  eprint = {https://arxiv.org/pdf/2108.03335.pdf}
}
```

Fersula, Jérémy, Camille Noûs, and Kévin Perrot. “Sandpile Toppling on Penrose Tilings: Identity and Isotropic Dynamics.” Chapter of Automata and Complexity 42 (2022): 117–43. Springer Series on Emergence, Complexity, Computation. DOI-link eprint-link

@article{fnp22,
  author = {Fersula, J{\'e}r{\'e}my and No{\^u}s, Camille and Perrot, K{\'e}vin},
  title = {{Sandpile toppling on Penrose tilings: identity and isotropic dynamics}},
  journal = {Chapter of Automata and Complexity},
  year = {2022},
  volume = {42},
  publisher = {Springer},
  pages = {117--143},
  note = {Springer Series on Emergence, Complexity, Computation},
  doi = {10.1007/978-3-030-92551-2_10},
  eprint = {https://arxiv.org/pdf/2006.06254.pdf}
}

Perrot, Kévin. “Études De La Complexité Algorithmique Des Réseaux d’Automates.” Aix-Marseille Université, 2022. Habilitation à diriger des recherches. eprint-link
```
@misc{p22,
  author = {Perrot, K{\'e}vin},
  title = {{{\'E}tudes de la complexit{\'e} algorithmique des r{\'e}seaux d'automates}},
  howpublished = {Aix-Marseille Universit{\'e}},
  year = {2022},
  note = {Habilitation {\`a} diriger des recherches},
  optdoi = {},
  eprint = {https://theses.hal.science/tel-03611794/document}
}
```
———. “On the Complexity of Counting Feedback Arc Sets.” Chicago Journal of Theoretical Computer Science 2022, no. 1 (2022): 1–8. DOI-link eprint-link
```
@article{p22b,
  author = {Perrot, K{\'e}vin},
  title = {{On the complexity of counting feedback arc sets}},
  journal = {Chicago Journal of Theoretical Computer Science},
  year = {2022},
  volume = {2022},
  number = {1},
  pages = {1--8},
  doi = {10.4086/cjtcs.2022.001},
  eprint = {https://arxiv.org/pdf/1909.03339.pdf}
}
```

Paulevé, Loïc, and Sylvain Sené. “Boolean Networks and Their Dynamics: the Impact of Updates.” Systems Biology Modelling and Analysis: Formal Bioinformatics Methods and Tools, 2022, 173–250. DOI-link eprint-link

@article{ps22,
  author = {Paulev{\'e}, Lo{\"i}c and Sen{\'e}, Sylvain},
  title = {{Boolean networks and their dynamics: the impact of updates}},
  journal = {Systems biology modelling and analysis: formal bioinformatics methods and tools},
  year = {2022},
  publisher = {Wiley},
  pages = {173--250},
  doi = {https://doi.org/10.1002/9781119716600.ch6},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/ps22.pdf}
}

Perrot, Kévin, and Sylvain Sené. “Les Réseaux d’Automates Booléens Au Coeur Du Calcul Naturel.” 1024 – Bulletin De La Socété Informatique De France 20 (2022): 171–82. DOI-link eprint-link

@article{ps22b,
  author = {Perrot, K{\'e}vin and Sen{\'e}, Sylvain},
  title = {{Les r{\'e}seaux d'automates bool{\'e}ens au coeur du calcul naturel}},
  journal = {1024 -- Bulletin de la Soc{\'e}t{\'e} informatique de France},
  year = {2022},
  volume = {20},
  pages = {171--182},
  doi = {10.48556/SIF.1024.20.171},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/ps22b.pdf}
}

Theyssier, Guillaume. “The Mirage of Universality in Cellular Automata.” Chapter of Automata and Complexity 42 (2022): 57–70. Springer Series on Emergence, Complexity, Computation. DOI-link eprint-link

@article{t22,
  author = {Theyssier, Guillaume},
  title = {{The mirage of universality in cellular automata}},
  journal = {Chapter of Automata and Complexity},
  year = {2022},
  publisher = {Springer},
  volume = {42},
  note = {Springer Series on Emergence, Complexity, Computation},
  pages = {57--70},
  doi = {10.1007/978-3-030-92551-2_5},
  eprint = {https://arxiv.org/pdf/2112.01090.pdf}
}

Aracena, Julio, Florian Bridoux, Luis Gómez, and Lilian Salinas. “Complexity of Limit Cycles with Block-Sequential Update Schedules in Conjunctive Networks.” Natural Computing 22 (2023): 411–29. DOI-link eprint-link
```
@article{abgs23,
  author = {Aracena, Julio and Bridoux, Florian and G{\'o}mez, Luis and Salinas, Lilian},
  title = {{Complexity of limit cycles with block-sequential update schedules in conjunctive networks}},
  journal = {Natural Computing},
  year = {2023},
  volume = {22},
  pages = {411--429},
  doi = {10.1007/s11047-023-09947-0},
  eprint = {https://arxiv.org/pdf/2203.11361.pdf}
}
```
Aracena, Julio, Adrien Richard, and Lilian Salinas. “Synchronizing Boolean Networks Asynchronously.” Journal of Computer and System Sciences 136 (2023): 249–79. DOI-link eprint-link
```
@article{ars23,
  author = {Aracena, Julio and Richard, Adrien and Salinas, Lilian},
  title = {{Synchronizing Boolean networks asynchronously}},
  journal = {Journal of Computer and System Sciences},
  year = {2023},
  volume = {136},
  pages = {249--279},
  doi = {10.1016/j.jcss.2023.04.001},
  eprint = {https://arxiv.org/pdf/2203.05298.pdf}
}
```
Bridoux, Florian, Kévin Perrot, Aymeric Picard Marchetto, and Adrien Richard. “Interaction Graphs of Isomorphic Automata Networks I: Complete Digraph and Minimum in-Degree.” Journal of Computer and System Sciences 138 (2023): 103458. DOI-link eprint-link
```
@article{bppmr23,
  author = {Bridoux, Florian and Perrot, K{\'e}vin and Picard Marchetto, Aymeric and Richard, Adrien},
  title = {{Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree}},
  journal = {Journal of Computer and System Sciences},
  year = {2023},
  volume = {138},
  pages = {103458},
  doi = {10.1016/j.jcss.2023.05.003},
  eprint = {https://arxiv.org/pdf/2301.01958.pdf}
}
```
Naldi, Aurélien, Adrien Richard, and Elisa Tonello. “Linear Cuts in Boolean Networks.” Natural Computing 22 (2023): 431–51. DOI-link eprint-link
```
@article{nrt23,
  author = {Naldi, Aur{\'e}lien and Richard, Adrien and Tonello, Elisa},
  title = {{Linear cuts in Boolean networks}},
  journal = {Natural Computing},
  year = {2023},
  volume = {22},
  pages = {431--451},
  doi = {10.1007/s11047-023-09945-2},
  eprint = {https://arxiv.org/pdf/2203.01620.pdf}
}
```
Perrotin, Pacôme. Natural Computing 22 (2023): 453–61. DOI-link eprint-link
```
@article{p23,
  author = {Perrotin, Pac{\^o}me},
  title = {{}},
  journal = {Natural Computing},
  year = {2023},
  volume = {22},
  pages = {453--461},
  doi = {10.1007/s11047-023-09948-z},
  eprint = {https://hal.science/hal-03237179v1/document}
}
```

Perrotin, Pacôme, and Sylvain Sené. “Turning Block-Sequential Automata Networks into Smaller Parallel Networks with Isomorphic Limit Dynamics.” In Proceedings of CiE’23, 13967:214–28. LNCS. Springer, 2023. DOI-link eprint-link

@inproceedings{ps23,
  author = {Perrotin, Pac{\^o}me and Sen{\'e}, Sylvain},
  title = {{Turning block-sequential automata networks into smaller parallel networks with isomorphic limit dynamics}},
  booktitle = {Proceedings of CiE'23},
  pages = {214--228},
  year = {2023},
  volume = {13967},
  series = {LNCS},
  publisher = {Springer},
  doi = {10.1007/978-3-031-36978-0_18},
  eprint = {https://arxiv.org/pdf/2304.13550.pdf}
}

Richard, Adrien, and Elisa Tonello. “Attractor Separation and Signed Cycles in Asynchronous Boolean Networks.” Theoretical Computer Science 947 (2023): 113706. DOI-link eprint-link
```
@article{rt23,
  author = {Richard, Adrien and Tonello, Elisa},
  title = {{Attractor separation and signed cycles in asynchronous Boolean networks}},
  journal = {Theoretical Computer Science},
  year = {2023},
  volume = {947},
  pages = {113706},
  doi = {10.1016/j.tcs.2023.113706},
  eprint = {https://arxiv.org/pdf/2206.11651.pdf}
}
```

Siegel, Pierre, Andrei Doncescu, Vincent Risch, and Sylvain Sené. “Representation of Gene Regulation Networks by Hypothesis Logic-Based Boolean Systems.” The Journal of Supercomputing 79 (2023): 4556–81. DOI-link eprint-link

@article{sdrs23,
  author = {Siegel, Pierre and Doncescu, Andrei and Risch, Vincent and Sen{\'e}, Sylvain},
  title = {{Representation of gene regulation networks by hypothesis logic-based Boolean systems}},
  journal = {The Journal of Supercomputing},
  year = {2023},
  volume = {79},
  pages = {4556--4581},
  doi = {10.1007/s11227-022-04809-5},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/sdrs22.pdf}
}

Doré, François, Enrico Formenti, Antonio E. Porreca, and Sara Riva. “Decomposition and Factorisation of Transients in Functional Graphs,” 2023. Submitted. eprint-link
```
@article{dfpr23,
  author = {Dor{\'e}, Fran\c cois and Formenti, Enrico and Porreca, Antonio E. and Riva, Sara},
  title = {{Decomposition and factorisation of transients in functional graphs}},
  optjournal = {},
  year = {2023},
  optvolume = {},
  optpages = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://arxiv.org/pdf/2208.08310.pdf}
}
```

Gamard, Guilhem, Pierre Guillon, Kévin Perrot, and Guillaume Theyssier. “Hardness of Monadic Second-Order Formulae over Succinct Graphs,” 2023. Submitted. eprint-link

@inproceedings{ggpt23,
  author = {Gamard, Guilhem and Guillon, Pierre and Perrot, K{\'e}vin and Theyssier, Guillaume},
  title = {{Hardness of monadic second-order formulae over succinct graphs}},
  optbooktitle = {},
  optpages = {},
  year = {2023},
  optvolume = {},
  optseries = {},
  optpublisher = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://arxiv.org/pdf/2302.04522.pdf}
}

Goles, Eric, Pedro Montealegre, Martín Ríos-Wilson, and Sylvain Sené. “Dynamical Stability of Threshold Networks over Undirected Signed Graphs,” 2023. Submitted. eprint-link

@inproceedings{gmrws23,
  author = {Goles, Eric and Montealegre, Pedro and R{\'i}os-Wilson, Mart{\'i}n and Sen{\'e}, Sylvain},
  title = {{Dynamical stability of threshold networks over undirected signed graphs}},
  optbooktitle = {},
  optpages = {},
  year = {2023},
  optvolume = {},
  optseries = {},
  optpublisher = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/gmrws24.pdf}
}

Perrot, Kévin, Sylvain Sené, and Léah Tapin. “Combinatorics of Block-Parallel Automata Networks,” 2023. Submitted. eprint-link

@inproceedings{pst23,
  author = {Perrot, K{\'e}vin and Sen{\'e}, Sylvain and Tapin, L{\'e}ah},
  title = {{Combinatorics of block-parallel automata networks}},
  optbooktitle = {},
  optpages = {},
  year = {2023},
  optvolume = {},
  optseries = {},
  optpublisher = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://pageperso.lis-lab.fr/sylvain.sene/files/publi_pres/pst24.pdf}
}

Porreca, Antonio E., and Ekaterina Timofeeva. “Polynomial-Delay Generation of Functional Digraphs up to Isomorphism,” 2023. Submitted. eprint-link
```
@article{pt23,
  author = {Porreca, Antonio E. and Timofeeva, Ekaterina},
  title = {{Polynomial-delay generation of functional digraphs up to isomorphism}},
  optjournal = {},
  year = {2023},
  optvolume = {},
  optpages = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://arxiv.org/pdf/2302.13832.pdf}
}
```
Ríos-Wilson, Martín, and Guillaume Theyssier. “Intrinsic Universality in Automata Networks I: Families and Simulations,” 2023. Submitted. eprint-link
```
@article{rwt23a,
  author = {R{\'i}os-Wilson, Mart{\'i}n and Theyssier, Guillaume},
  title = {{Intrinsic universality in automata networks I: families and simulations}},
  optjournal = {},
  year = {2023},
  optvolume = {},
  optpages = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://hal.science/hal-04199842/file/TCS.pdf}
}
```

———. “Intrinsic Universality in Automata Networks II: Glueing and Gadgets,” 2023. Submitted. eprint-link

@article{rwt23b,
  author = {R{\'i}os-Wilson, Mart{\'i}n and Theyssier, Guillaume},
  title = {{Intrinsic universality in automata networks II: glueing and gadgets}},
  optjournal = {},
  year = {2023},
  optvolume = {},
  optpages = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://hal.science/hal-04199857/file/TCS.pdf}
}

———. “Intrinsic Universality in Automata Networks III: on Symmetry versus Asynchrony,” 2023. Submitted. eprint-link

@article{rwt23c,
  author = {R{\'i}os-Wilson, Mart{\'i}n and Theyssier, Guillaume},
  title = {{Intrinsic universality in automata networks III: on symmetry versus asynchrony}},
  optjournal = {},
  year = {2023},
  optvolume = {},
  optpages = {},
  note = {Submitted},
  optdoi = {},
  eprint = {https://hal.science/hal-03225820v2/file/TCS.pdf}
}

Julio Aracena, Adrien Richard, and Lilian Salinas. Maximum number of fixed points in AND-OR-NOT networks. Journal of Computer and System Sciences, 80:1175–1190, 2014.
Julio Aracena, Adrien Richard, and Lilian Salinas. Number of fixed points and disjoint cycles in monotone Boolean networks. SIAM Journal on Discrete Mathematics, 31:1702–1725, 2017.
Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, and Guillaume Theyssier. On the cost of simulating a parallel Boolean automata network by a block-sequential one. Proceedings of TAMC’17, LNCS 10185, 112–128, 2017.
Jacques Demongeot, Mathilde Noual, and Sylvain Sené. Combinatorics of Boolean automata circuits dynamics. Discrete Applied Mathematics, 160: 398–415, 2012.
Maximilien Gadouleau and Adrien Richard. Simple dynamics on graphs. Theoretical Computer Science, 628:62–77, 2016.
Tarek Melliti, Damien Regnault, Adrien Richard, and Sylvain Sené. Asynchronous simulation of Boolean networks by monotone Boolean networks. Proceedings of ACRI’16, LNCS 9863, 182–191, Springer, 2016.
Tarek Melliti, Mathilde Noual, Damien Regnault, Sylvain Sené, and Jérémy Sobieraj. Asynchronous dynamics of Boolean automata double-cycles. Proceedings of UCNC’15, LNCS 9252, 250–262, Springer, 2015.
Tarek Melliti, Damien Regnault, Adrien Richard, and Sylvain Sené. On the convergence of Boolean automata networks without negative cycles. Proceedings of AUTOMATA’13, LNCS 8155, 124–138, Springer, 2013.
Mathilde Noual and Sylvain Sené. Synchronism vs asynchronism in monotonic Boolean automata networks. Natural Computing, 17:393–402, 2018.