Parameter space abstraction and unfolding semantics of discrete regulatory networks

DOI10.1016/J.TCS.2018.03.009zbMATH Open1423.68313arXiv1803.06157OpenAlexW2963933471WikidataQ129617527 ScholiaQ129617527MaRDI QIDQ2422012FDOQ2422012

Stefan Haar, Loïc Paulevé, Juraj Kolčák, D. Šafránek

Publication date: 18 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: The modelling of discrete regulatory networks combines a graph specifying the pairwise influences between the variables of the system, and a parametrisation from which can be derived a discrete transition system. Given the influence graph only, the exploration of admissible parametrisations and the behaviours they enable is computationally demanding due to the combinatorial explosions of both parametrisation and reachable state space. This article introduces an abstraction of the parametrisation space and its refinement to account for the existence of given transitions, and for constraints on the sign and observability of influences. The abstraction uses a convex sublattice containing the concrete parametrisation space specified by its infimum and supremum parametrisations. It is shown that the computed abstractions are optimal, i.e., no smaller convex sublattice exists. Although the abstraction may introduce over-approximation, it has been proven to be conservative with respect to reachability of states. Then, an unfolding semantics for Parametric Regulatory Networks is defined, taking advantage of concurrency between transitions to provide a compact representation of reachable transitions. A prototype implementation is provided: it has been applied to several examples of Boolean and multi-valued networks, showing its tractability for networks with numerous components.

Full work available at URL: https://arxiv.org/abs/1803.06157

zbMATH Keywords

systems biologyconcurrencyBoolean networksasynchronous systemsparametrised discrete dynamicsThomas networks

Mathematics Subject Classification ID

Systems biology, networks (92C42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Petri nets, event structures and domains. I
• Application of formal methods to biological regulatory networks: extending Thomas' asynchronous logical approach with temporal logic
• Branching processes of Petri nets
• Computational methods in systems biology. 10th international conference, CMSB 2012, London, UK, October 3--5, 2012. Proceedings
• A computational algebra approach to the reverse engineering of gene regulatory networks
• An improvement of McMillan's unfolding algorithm
• Dynamical behaviour of biological regulatory networks. II: Immunity control in bacteriophage lambda
• The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
• Unfolding of parametric Boolean networks
• Unfolding based alorithms for the reachability problem

Cited In (3)

• Property Preservation along Embedding of Biological Regulatory Networks
• Static analysis and stochastic search for reachability problem
• Static analysis of biological regulatory networks dynamics using abstract interpretation

This page was built for publication: Parameter space abstraction and unfolding semantics of discrete regulatory networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422012)