Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Lumpability Abstractions of Rule-based Systems.

Author(s):

Jerome Feret, Thomas Henzinger, H. Koeppl, Tatjana Petrov
Conference/Journal:

Theoretical Computer Science, In Theoretical Computer Science, special issue MeCBIC 2009-2010. G. Ciobanu & M. Koutny (Ed.)
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.

Further Information
Year:

2012
Type of Publication:

(01)Article
Supervisor:

H. Koeppl

File Download:

Request a copy of this publication.
(Uses JavaScript)
@article{TCS-MeCBIC2012,
   author =    {J\'er\^ome Feret and Thomas Henzinger and  Heinz Koeppl and Tatjana Petrov},
   title =     {Lumpability Abstractions of Rule-based Systems},
   editor =    {G.~Ciobanu, M.~Koutny},
   journal =   {Theoretical Computer Science}, 
   year =      {2012},
}
Permanent link