A framework for (de)composing with Boolean automata networks

@inproceedings{Perrot2018AFF,
  title={A framework for (de)composing with Boolean automata networks},
  author={K{\'e}vin Perrot and Pac{\^o}me Perrotin and Sylvain Sen{\'e}},
  booktitle={MCU},
  year={2018}
}
  • Kévin Perrot, Pacôme Perrotin, Sylvain Sené
  • Published in MCU 2018
  • Mathematics, Computer Science
  • 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… CONTINUE READING

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-3 OF 3 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES

    On the Flora of Asynchronous Locally Non-monotonic Boolean Automata Networks

    VIEW 3 EXCERPTS

    Universality in Elementary Cellular Automata

    • Matthew Cook
    • Mathematics, Computer Science
    • Complex Systems
    • 2004
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Updating Automata Networks

    VIEW 1 EXCERPT

    Limit cycles and update digraphs in Boolean networks

    VIEW 1 EXCERPT

    Dynamical and Structural Modularity of Discrete Regulatory Networks

    VIEW 1 EXCERPT

    Comparison between parallel and serial dynamics of Boolean networks

    VIEW 1 EXCERPT

    Boolean formalization of genetic control circuits.

    • R. Thomas
    • Mathematics, Medicine
    • Journal of theoretical biology
    • 1973

    Discrete iterations - a metric study

    VIEW 1 EXCERPT