A framework for (de)composing with Boolean automata networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

A framework for (de)composing with Boolean automata networks

Kévin Perrot
Pacôme Perrotin


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 two results: the first one shows that our modules/wirings definition is complete; the second one uses modules/wirings to prove simulation results amongst BANs.
Fichier principal
Vignette du fichier
stage.pdf (283.33 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01654221 , version 1 (03-12-2017)
hal-01654221 , version 2 (10-04-2018)



Kévin Perrot, Pacôme Perrotin, Sylvain Sené. A framework for (de)composing with Boolean automata networks. International Conference on Machines, Computations, and Universality (MCU'2018), 2018, Fontainebleau, France. ⟨hal-01654221v2⟩
397 View
219 Download



Gmail Mastodon Facebook X LinkedIn More