On the cost of simulating a parallel Boolean automata network with a block-sequential one

Abstract : 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 introduce a graph that we call $\GNECC$ graph built from the BAN and the update schedule. We show the relation between $\kappa$ and the chromatic number of the $\GNECC$ graph. Thanks to this $\GNECC$ graph, we bound $\kappa$ in the worst case between $n/2$ and $2n/3+2$ ($n$ being the size of the BAN simulated) and we conjecture that this number equals $n/2$. We support this conjecture with two results: the clique number of a $\GNECC$ graph is always less than or equal to $n/2$ and, for the subclass of bijective BANs, $\kappa$ is always less than or equal to $n/2+1$.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01479439
Contributor : Kévin Perrot <>
Submitted on : Saturday, May 5, 2018 - 12:42:12 PM
Last modification on : Monday, March 4, 2019 - 2:04:22 PM
Document(s) archivé(s) le : Tuesday, September 25, 2018 - 12:12:16 AM

File

TAMC_2017_paper_39.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01479439, version 1

Citation

Florian Bridoux, Pierre Guillon, Kévin Perrot, Sylvain Sené, Guillaume Theyssier. On the cost of simulating a parallel Boolean automata network with a block-sequential one. Proceedings of TAMC'17, Apr 2017, Bern, Switzerland. pp.112--128. ⟨hal-01479439⟩

Share

Metrics

Record views

155

Files downloads

22