Lumpability Abstractions of Rule-based Systems

Details Lumpability Abstractions of Rule-based Systems Lumpability Abstractions of Rule-based Systems

2010-11-02

arxiv.org/abs/1011.0496v1

EPTCS 40, 2010, pp. 142-161

Computer Science

Computational Engineering, Finance, and Science

In Proceedings MeCBIC 2010, arXiv:1011.0051

Scientific paper

10.4204/EPTCS.40.10

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.

Affiliated with

Also associated with

No associations

Rating

Lumpability Abstractions of Rule-based Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lumpability Abstractions of Rule-based Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lumpability Abstractions of Rule-based Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-594443