Journal Articles Fundamenta Informaticae Year : 2021

On Boolean Automata Networks (de)Composition

De la (dé)composition de réseaux d'automates booléens

Kévin Perrot
  • Function : Author
Pacôme Perrotin
  • Function : Author
  • PersonId : 1347451
Sylvain Sené

Abstract

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 applied to a wide range of models of computation. In this paper we explore a way of working with BANs which involves adding external inputs to the base model (via modules), and more importantly, a way to link networks together using the above mentioned inputs (via wirings). Our aim is to develop a powerful formalism for BAN (de)composition. We formulate three results: the first one shows that our modules/wirings definition is complete; the second one uses modules/wirings to prove simulation results amongst BANs; the final one expresses the complexity of the relation between modularity and the dynamics of modules.
Fichier principal
Vignette du fichier
stagehal.pdf (442) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04440097 , version 1 (05-02-2024)

Identifiers

Cite

Kévin Perrot, Pacôme Perrotin, Sylvain Sené. On Boolean Automata Networks (de)Composition. Fundamenta Informaticae, 2021, 181 (2-3), pp.163-188. ⟨10.3233/FI-2021-2055⟩. ⟨hal-04440097⟩
221 View
70 Download

Altmetric

Share

More