Lumpability Abstractions of Rule-based Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2012

Lumpability Abstractions of Rule-based Systems

Heinz Koeppl
  • Function : Author
  • PersonId : 922078
Tatjana Petrov
  • Function : Author

Abstract

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 \emph{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.

Dates and versions

hal-00677894 , version 1 (10-03-2012)

Identifiers

Cite

Jérôme Feret, Thomas Henzinger, Heinz Koeppl, Tatjana Petrov. Lumpability Abstractions of Rule-based Systems. Theoretical Computer Science, 2012, Modelling and Analysis of Biological Systems -- Based on papers presented at the Workshop on Membrane Computing and Bio-logically Inspired Process Calculi (MeCBIC) held in 2008 (Iasi), 2009 (Bologna) and 2010 (Jena), 431, pp.137-164. ⟨10.1016/j.tcs.2011.12.059⟩. ⟨hal-00677894⟩
5476 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More