Lumpability abstractions of rule-based systems

  title={Lumpability abstractions of rule-based systems},
  author={J{\'e}r{\^o}me Feret and Thomas A. Henzinger and Heinz Koeppl and Tatjana Petrov},
  journal={Theor. Comput. Sci.},
The induction of a signaling pathway is characterized by transient complex formation and mutual posttranslational modification of proteins. To faithfully capture this combinatorial process in a mathematical model is an important challenge in systems biology. Exploiting the limited context on which most binding and modification events are conditioned, attempts have been made to reduce the combinatorial complexity by quotienting the reachable set of molecular species into species aggregates while… 

Figures from this paper

Formal reductions of stochastic rule-based models of biochemical systems
This thesis provides a general model reduction procedure, that is efficient – of complexity linear in the description of the rule-set, and automatic – it applies to any welldefined rule-based program.
Markov chain aggregation and its applications to combinatorial reaction networks
This work considers a continuous-time Markov chain (CTMC) whose state space is partitioned into aggregates, and each aggregate is assigned a probability measure, and shows how the applicability of de-aggregation depends on the initial distribution.
Exact maximal reduction of stochastic reaction networks by species lumping
An exact lumping method for stochastic reaction networks with mass-action kinetics that hinges on an equivalence relation between the species, resulting in a reduced network where the dynamics of each macro-species is stochastically equivalent to the sum of the original species in each equivalence class.
Reduction of dynamical biochemical reactions networks in computational biology
The application of model reduction to the problem of parameter identification, via backward pruning machine learning techniques is discussed, and the main approaches to model reduction of reaction networks are revisited, including quasi-steady state (QSS) and quasi-equilibrium approximations (QE).
Model Decomposition and Stochastic Fragments
Forward and Backward Bisimulations for Chemical Reaction Networks
A unified algorithm is provided that computes the coarsest refinement up to the authors' bisimulations in polynomial time and algorithms to compute quotient CRNs induced by a bisimulation are given.
Symbolic computation of differential equivalences
This work proposes differential equivalence relations for biochemical models from the literature that cannot be reduced using competing automatic techniques, and provides novel symbolic procedures to check an equivalence and compute the largest one via partition refinement algorithms that use satisfiability modulo theories.
Long lived transients in gene regulation
Free Energy of Petri Nets
It is shown that for the subclass of continuous-time MCs (ctMCs) corresponding to thermodynamically consistent stochastic mass action Petri nets (the standard model for chemical reactions for fast diffusing chemicals), one can construct in a systematic fashion concrete versions of the dynamics.


Internal coarse-graining of molecular systems
This work presents a formal (and automated) method for constructing a coarse-grained and self-consistent dynamical system aimed at molecular patterns that are distinguishable by the dynamics of the original system as posited by the rules.
Stochastic Fragments: A Framework for the Exact Reduction of the Stochastic Semantics of Rule-Based Models
This paper introduces an individual-based stochastic semantics (where each agent is identified by a unique identifier) for the programs of a rule-based language and uses this framework for deriving a sound population-based semantics and a sound fragments- based semantics.
Rule-Based Modelling, Symmetries, Refinements
This paper presents a method to refine rule sets in a way that preserves the implied stochastic semantics, and shows how to refine rules and which choice of refined rates will lead to a neutral refinement, i.e., one that has the same global activity as the original rule had.
Rules for Modeling Signal-Transduction Systems
Approaches to creation of mathematical models of signaling systems with strategies that keep the models from being unwieldy but still allow them to accurately reflect biological systems are reviewed.
Formal molecular biology
Exact model reduction of combinatorial reaction networks
This work provides techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization and discusses a new modeling approach that allows the direct generation of exactly reduced model structures.
Combining Model Reductions
Bisimulation for labelled Markov processes
The main result is that a notion of bisimulation for Markov processes on Polish spaces, which extends the Larsen-Skou definition for discrete systems, is indeed an equivalence relation.
Scalable Simulation of Cellular Signaling Networks
A radically different method which does not attempt to count species is presented, which uses a representation of the system together with a super-approximation of its 'event horizon' (all events that may happen next), and a specific correction scheme to obtain exact timings.
Sliding Window Abstraction for Infinite Markov Chains
An on-the-fly abstraction technique for infinite-state continuous -time Markov chains that are specified by a finite set of transition classes, which approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models.