Selected publications at LSV

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 components updates can have a dramatic impact on the predicted behaviours. In this paper, we explore the use of Contextual Petri Nets (CPNs) to study dynamics of BNs with a concurrency theory perspective. After showing bi-directional translations between CPNs and BNs and analogies between results on synchronism sensitivies, we illustrate that usual updating modes for BNs can miss plausible behaviours, i.e., incorrectly conclude on the absence/impossibility of reaching specific configurations. Taking advantage of CPN semantics enabling more behaviour than the generalized asynchronous updating mode, we propose an encoding of BNs ensuring a correct abstraction of any multivalued refinement, as one may expect to achieve when modelling biological systems with no assumption on its time features.

   author = {Chatain, {\relax Th}omas and Haar, Stefan and Kol{\v{c}}{\'a}k, Juraj and Thakkar, Aalok and Paulev{\'e}, Lo{\"i}c},
   institution = {HAL},
   month = oct,
   note = {33~pages},
   number = {hal-01893106},
   type = {Research Report},
   title = {{Concurrency in Boolean networks}},
   url = {},
   year = {2018},

About LSV

Select by Year