Abstracting the differential semantics of rule-based models: exact and automated model reduction

Rule-based approaches (as in our own Kappa, or the BNG language, or many other propositions allowing the consideration of "reaction classes'') offer new and more powerful ways to capture the combinatorial interactions that are typical of molecular biological systems. They afford relatively compact and faithful descriptions of cellular interaction networks despite the combination of two broad types of interaction: the formation of complexes (a biological term for the ubiquitous non-covalent binding of bio-molecules), and the chemical modifications of macromolecules (aka post-translational modifications). However, all is not perfect. This same combinatorial explosion that pervades biological systems also seems to prevent the simulation of molecular networks using systems of differential equations. In all but the simplest cases the generation (and even more the integration) of the explicit system of differential equations which is canonically associated to a rule set is unfeasible. So there seems to be a price to pay for this increase in clarity and precision of the description, namely that one can only execute such rule-based systems using their stochastic semantics as continuous time Markov chains, which means a slower if more accurate simulation. In this paper, we take a fresh look at this question, and, using techniques from the abstract interpretation framework, we construct a reduction method which generates (typically) far smaller systems of differential equations than the concrete/canonical one. We show that the abstract/reduced differential system has solutions which are linear combinations of the canonical ones. Importantly, our method: 1) does not require the concrete system to be explicitly computed, so it is intensional, 2) nor does it rely on the choice of a specific set of rate constants for the system to be reduced, so it is symbolic, and 3) achieves good compression when tested on rule-based models of significant size, so it is also realistic.

[1]  Aviv Regev,et al.  Representation and Simulation of Biochemical Processes Using the pi-Calculus Process Algebra , 2000, Pacific Symposium on Biocomputing.

[2]  Roberto Giacobazzi,et al.  Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking , 2001, SAS.

[3]  Vincent Danos,et al.  Rule Based Modeling and Model Refinement , 2010 .

[4]  Vincent Danos,et al.  Internal coarse-graining of molecular systems , 2009, Proceedings of the National Academy of Sciences.

[5]  Francesca Levi,et al.  Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation , 2009, FBTC@ICALP.

[6]  Flemming Nielson,et al.  Spatial Analysis of BioAmbients , 2004, SAS.

[7]  Jérôme Feret Reachability Analysis of Biological Signalling Pathways by Abstract Interpretation , 2008 .

[8]  Herbert Wiklicky,et al.  Probabilistic Abstract Interpretation and Statistical Testing , 2002, PAPM-PROBMIV.

[9]  Walter Fontana Systems biology, models, and concurrency , 2008, POPL '08.

[10]  Ernst Dieter Gilles,et al.  Exact model reduction of combinatorial reaction networks , 2008, BMC Systems Biology.

[11]  Julio Saez-Rodriguez,et al.  A domain-oriented approach to the reduction of combinatorial complexity in signal transduction networks , 2006, BMC Bioinformatics.

[12]  W. Lim,et al.  Rewiring cellular morphology pathways with synthetic guanine nucleotide exchange factors , 2007, Nature.

[13]  A. Girard,et al.  Efficient reachability analysis for linear systems using support functions , 2008 .

[14]  Jérôme Feret,et al.  Static Analysis of Digital Filters , 2004, ESOP.

[15]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[16]  Vincent Danos,et al.  Scalable Simulation of Cellular Signaling Networks , 2007, APLAS.

[17]  James R Faeder,et al.  Rule-based modeling of biochemical systems with BioNetGen. , 2009, Methods in molecular biology.

[18]  W. S. Hlavacek,et al.  A network model of early events in epidermal growth factor receptor signaling that accounts for combinatorial complexity. , 2006, Bio Systems.

[19]  Luca Cardelli,et al.  BioAmbients: an abstraction for biological compartments , 2004, Theor. Comput. Sci..

[20]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[21]  T. Kurtz Solutions of ordinary differential equations as limits of pure jump markov processes , 1970, Journal of Applied Probability.

[22]  Alexandre Chapoutot Simulation abstraite : une analyse statique de modèles Simulink , 2008 .

[23]  Roberto Giacobazzi,et al.  Making abstract interpretations complete , 2000, JACM.

[24]  Jane Hillston,et al.  Bio-PEPA: A framework for the modelling and analysis of biological systems , 2009, Theor. Comput. Sci..

[25]  Wendell A. Lim,et al.  Rapid Diversification of Cell Signaling Phenotypes by Modular Domain Recombination , 2010, Science.

[26]  D. Fell,et al.  Differential feedback regulation of the MAPK cascade underlies the quantitative differences in EGF and NGF signalling in PC12 cells , 2000, FEBS letters.

[27]  Roberto Giacobazzi,et al.  Non-Standard Semantics for Program Slicing , 2003, High. Order Symb. Comput..

[28]  Francesca Levi,et al.  A New Occurrence Counting Analysis for BioAmbients , 2005, APLAS.

[29]  E. Gilles,et al.  Computational modeling of the dynamics of the MAP kinase cascade activated by surface and internalized EGF receptors , 2002, Nature Biotechnology.

[30]  Corrado Priami,et al.  Beta Binders for Biological Interactions , 2004, CMSB.

[31]  Cosimo Laneve,et al.  Formal molecular biology , 2004, Theor. Comput. Sci..

[32]  Pawel Sobocinski,et al.  Adhesive Categories , 2004, FoSSaCS.

[33]  C. Bashor,et al.  References and Notes Supporting Online Material Using Engineered Scaffold Interactions to Reshape Map Kinase Pathway Signaling Dynamics , 2022 .

[34]  David Monniaux,et al.  Abstract Interpretation of Probabilistic Semantics , 2000, SAS.

[35]  William L. Hart,et al.  The Cauchy-Lipschitz Method for Infinite Systems of Differential Equations , 1921 .

[36]  Jérôme Feret Numerical Abstract Domains for Digital Filters ⋆ , 2007 .

[37]  T. Kurtz Limit theorems for sequences of jump Markov processes approximating ordinary differential processes , 1971, Journal of Applied Probability.

[38]  Jérôme Feret Analyse des systèmes mobiles par interprétation abstraite. (Analysis of mobile systems by abstract interpretation) , 2005 .

[39]  B. Kholodenko,et al.  Signaling through receptors and scaffolds: independent interactions reduce combinatorial complexity. , 2005, Biophysical journal.

[40]  Matthieu Martel,et al.  Abstract Interpretation of the Physical Inputs of Embedded Programs , 2008, VMCAI.

[41]  William S. Hlavacek,et al.  BioNetGen: software for rule-based modeling of signal transduction based on the interactions of molecular domains , 2004, Bioinform..

[42]  N. G. Parke,et al.  Ordinary Differential Equations. , 1958 .

[43]  Matthias Felleisen,et al.  The semantics of program dependence , 1989, PLDI '89.

[44]  O. Bouissou,et al.  GRKLib: a Guaranteed Runge Kutta Library , 2006, 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006).

[45]  David Monniaux An abstract Monte-Carlo method for the analysis of probabilistic programs , 2001, POPL '01.

[46]  T. Pawson,et al.  Assembly of Cell Regulatory Systems Through Protein Interaction Domains , 2003, Science.

[47]  Francesca Levi,et al.  An Analysis for Proving Temporal Properties of Biological Systems , 2006, APLAS.

[48]  Edda Klipp,et al.  Formal representation of the high osmolarity glycerol pathway in yeast. , 2010, Genome informatics. International Conference on Genome Informatics.

[49]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools , 1999 .

[50]  Martín Abadi,et al.  Secrecy by typing in security protocols , 1999, JACM.

[51]  B. Kholodenko,et al.  Domain-oriented reduction of rule-based network models. , 2008, IET systems biology.

[52]  嘉一 鷲沢,et al.  GNU Octave(前編) , 2011 .

[53]  Antoine Girard,et al.  Zonotope/Hyperplane Intersection for Hybrid Systems Reachability Analysis , 2008, HSCC.

[54]  Vincent Danos,et al.  Rule-Based Modelling of Cellular Signalling , 2007, CONCUR.