Skip to Main content Skip to Navigation
Journal articles

Concurrency in Boolean networks

Abstract : Boolean networks (BNs) are widely used to model the qualitative dynamics of biological systems. Besides the logical rules determining the evolution of each component with respect to the state of its regulators, the scheduling of component updates can have a dramatic impact on the predicted behaviours. In this paper, we explore the use of Read (contextual) Petri Nets (RPNs) to study dynamics of BNs from a concurrency theory perspective. After showing bi-directional translations between RPNs and BNs and analogies between results on synchronism sensitivity, we illustrate that usual updating modes for BNs can miss plausible behaviours, i.e., incorrectly conclude on the absence/impossibility of reaching specific configurations. We propose an encoding of BNs capitalizing on the RPN semantics enabling more behaviour than the generalized asynchronous updating mode. The proposed encoding ensures a correct abstraction of any multivalued refinement, as one may expect to achieve when modelling biological systems with no assumption on its time features.
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.inria.fr/hal-01893106
Contributor : Loïc Paulevé <>
Submitted on : Friday, May 31, 2019 - 11:12:23 AM
Last modification on : Wednesday, November 4, 2020 - 3:34:53 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Thomas Chatain, Stefan Haar, Juraj Kolčák, Loïc Paulevé, Aalok Thakkar. Concurrency in Boolean networks. Natural Computing, Springer Verlag, 2020, 19 (1), pp.91--109. ⟨10.1007/s11047-019-09748-4⟩. ⟨hal-01893106v2⟩

Share

Metrics

Record views

183

Files downloads

907