Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree

Autor: Florian Bridoux, Kévin Perrot, Aymeric Picard Marchetto, Adrien Richard

Publikováno v: Journal of Computer and System Sciences.

An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction graph of $f

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e55bf18d0d94839ee1b626b0af2c3023
https://doi.org/10.1016/j.jcss.2023.05.003

Complexity of fixed point counting problems in Boolean Networks

Autor: Florian Bridoux, Amélia Durbec, Kevin Perrot, Adrien Richard

A Boolean network (BN) with $n$ components is a discrete dynamical system described by the successive iterations of a function $f:\{0,1\}^n \to \{0,1\}^n$. This model finds applications in biology, where fixed points play a central role. For example,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46dec8a3596e284902bb7e45f002859a
http://arxiv.org/abs/2012.02513

Commutative automata networks

Autor: Maximilien Gadouleau, Florian Bridoux, Guillaume Theyssier

Publikováno v: Cellular Automata and Discrete Complex Systems ISBN: 9783030615871
Automata
International Workshop on Cellular Automata and Discrete Complex Systems
International Workshop on Cellular Automata and Discrete Complex Systems, pp.43-58, 2020, ⟨10.1007/978-3-030-61588-8_4⟩
Lecture Notes in Computer Science
26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA)
26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Aug 2020, Stockholm, Sweden. pp.43-58, ⟨10.1007/978-3-030-61588-8_4⟩

Automata networks are mappings of the form \(f: Q^Z \rightarrow Q^Z\), where Q is a finite alphabet and Z is a set of entities; they generalise Cellular Automata and Boolean networks. An update schedule dictates when each entity updates its state acc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0c63026933f0d3225358625e917d409
https://hal.archives-ouvertes.fr/hal-02548573/file/commuting_networks.pdf

Expansive Automata Networks

Autor: Maximilien Gadouleau, Florian Bridoux, Guillaume Theyssier

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2020, 843, pp.25-44. ⟨10.1016/j.tcs.2020.06.019⟩
Theoretical computer science, 2020, Vol.843, pp.25-44 [Peer Reviewed Journal]
Theoretical Computer Science, 2020, 843, pp.25-44. ⟨10.1016/j.tcs.2020.06.019⟩

An Automata Network is a map f : Q n → Q n where Q is a finite alphabet. It can be viewed as a network of n entities, each holding a state from Q, and evolving according to a deterministic synchronous update rule in such a way that each entity only

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c94be7a9b22003c3d2cf74a3297d85b4

On the Cost of Simulating a Parallel Boolean Automata Network by a Block-Sequential One

Autor: Sylvain Sené, Pierre Guillon, Guillaume Theyssier, Florian Bridoux, Kévin Perrot

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319559100
TAMC

In this article we study the minimum number \(\kappa \) of additional automata that a Boolean automata network (BAN) associated with a given block-sequential update schedule needs in order to simulate a given BAN with a parallel update schedule. We i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e786c04a448c35dc42c0a3d2ac9ff207
https://doi.org/10.1007/978-3-319-55911-7_9