Skip to Main content Skip to Navigation
Conference papers

A framework for (de)composing with Boolean automata networks

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 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Pacôme Perrotin <>
Submitted on : Tuesday, April 10, 2018 - 12:34:10 PM
Last modification on : Thursday, November 5, 2020 - 3:12:31 AM


Files produced by the author(s)


  • HAL Id : hal-01654221, version 2
  • ARXIV : 1802.10400


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⟩



Record views


Files downloads