Asynchronous simulation of Boolean networks by monotone Boolean networks

Abstract : We prove that the fully asynchronous dynamics of a Boolean network f : {0, 1}^n → {0, 1}^n without negative loop can be simulated, in a very specific way, by a monotone Boolean network with 2n components. We then use this result to prove that, for every even n, there exists a monotone Boolean network f : {0, 1}^n → {0, 1}^n , an initial configuration x and a fixed point y of f such that: (i) y can be reached from x with a fully asynchronous updating strategy, and (ii) all such strategies contains at least 2^{n/2} updates. This contrasts with the following known property: if f : {0, 1}^n → {0, 1}^n is monotone, then, for every initial configuration x, there exists a fixed point y such that y can be reached from x with a fully asynchronous strategy that contains at most n updates.
Liste complète des métadonnées

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01341136
Contributor : Adrien Richard <>
Submitted on : Monday, July 4, 2016 - 11:13:05 AM
Last modification on : Monday, March 4, 2019 - 2:04:14 PM

File

2016-06-16__embedding_in_monot...
Files produced by the author(s)

Identifiers

Citation

Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené. Asynchronous simulation of Boolean networks by monotone Boolean networks. Fourth International Workshop on Asynchronous Cellular Automata and Asynchronous Discrete Models, During the 12th International Conference on Cellular Automata for Research and Industry (ACRI 2016), Sep 2016, Fez, Morocco. pp.182--191, ⟨10.1007/978-3-319-44365-2_18⟩. ⟨hal-01341136⟩

Share

Metrics

Record views

253

Files downloads

67