Selected publications at LSV

Abstract:
As shown in [3], the usual update modes of Boolean networks (BNs), including synchronous and (generalized) asynchronous, fail to capture behaviours introduced by multivalued refinements. Thus, update modes do not allow a correct abstract reasoning on dynamics of biological systems, as they may lead to reject valid BN models.
    We introduce a new semantics for interpreting BNs which meets with a correct abstraction of any multivalued refinements, with any update mode. This semantics subsumes all the usual updating modes, while enabling new behaviours achievable by more concrete models. Moreover, it appears that classical dynamical analyses of reachability and attractors have a simpler computational complexity:
  • reachability can be assessed in a polynomial number of iterations (instead of being PSPACE-complete with update modes);
  • attractors are hypercubes, and deciding the existence of attractors with a given upper-bounded dimension is in NP (instead of PSPACE-complete with update modes).
The computation of iterations is in NP in the very general case, and is linear when local functions are monotonic, or with some usual representations of functions of BNs (binary decision diagrams, Petri nets, automata networks, etc.).
    In brief, the most permissive semantics of BNs enables a correct abstract reasoning on dynamics of BNs, with a greater tractability than previously introduced update modes.
    This technical report lists the main definitions and properties of the most permissive semantics of BNs, and draw some remaining open questions.

@techreport{CHP-arxiv18,
   author = {Chatain, {\relax Th}omas and Haar, Stefan and Paulev{\'e}, Lo{\"i}c},
   institution = {Computing Research Repository},
   month = aug,
   note = {15~pages},
   number = {1808.10240},
   type = {Research Report},
   title = {Most Permissive Semantics of Boolean Networks},
   url = {https://arxiv.org/abs/1808.10240},
   year = {2018},
}

About LSV

Select by Year