Lumpability Abstractions of Rule-based Systems

Jerome Feret
(INRIA, Paris, France)
Thomas Henzinger
(Institute of Science and Technology, Vienna, Austria)
Heinz Koeppl
(EPFL, Lausanne, Switzerland)
Tatjana Petrov
(EPFL, Lausanne, Switzerland)

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 preserving the deterministic semantics of the thermodynamic limit. Recently we proposed a quotienting that also preserves the stochastic semantics and that is complete in the sense that the semantics of individual species can be recovered from the aggregate semantics. In this paper we prove that this quotienting yields a sufficient condition for weak lumpability and that it gives rise to a backward Markov bisimulation between the original and aggregated transition system. We illustrate the framework on a case study of the EGF/insulin receptor crosstalk.

In Gabriel Ciobanu and Maciej Koutny: Proceedings Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi 2010 (MeCBIC 2010), Jena, Germany, 23 August 2010, Electronic Proceedings in Theoretical Computer Science 40, pp. 142–161.
Published: 30th October 2010.

ArXived at: https://dx.doi.org/10.4204/EPTCS.40.10 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org