---
_id: '3168'
abstract:
- lang: eng
text: 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 (that is to say that the quotient
system is still Markovian for a given set of initial distributions) and that it
gives rise to a backward Markov bisimulation between the original and aggregated
transition system (which means that the conditional probability of being in a
given state in the original system knowing that we are in its equivalence class
is an invariant of the system). We illustrate the framework on a case study of
the epidermal growth factor (EGF)/insulin receptor crosstalk.
acknowledgement: "We would like to thank the anonymous reviewers for their comments
on the different versions of the paper. We would also like to thank Ferdinanda Camporesi
for her careful reading and the useful insights that she gave us about the paper.\r\nJérôme
Feret’s contribution was partially supported by the AbstractCell ANR-Chair of Excellence.
Heinz Koeppl’s research is supported by the Swiss National Science Foundation, grant
no. 200020-117975/1. Tatjana Petrov’s research is supported by SystemsX.ch (the
Swiss Initiative in Systems Biology)."
author:
- first_name: Jérôme
full_name: Feret, Jérôme
last_name: Feret
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Heinz
full_name: Koeppl, Heinz
last_name: Koeppl
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: Feret J, Henzinger TA, Koeppl H, Petrov T. Lumpability abstractions of rule
based systems. Theoretical Computer Science. 2012;431:137-164. doi:10.1016/j.tcs.2011.12.059
apa: Feret, J., Henzinger, T. A., Koeppl, H., & Petrov, T. (2012). Lumpability
abstractions of rule based systems. Theoretical Computer Science. Elsevier.
https://doi.org/10.1016/j.tcs.2011.12.059
chicago: Feret, Jérôme, Thomas A Henzinger, Heinz Koeppl, and Tatjana Petrov. “Lumpability
Abstractions of Rule Based Systems.” Theoretical Computer Science. Elsevier,
2012. https://doi.org/10.1016/j.tcs.2011.12.059.
ieee: J. Feret, T. A. Henzinger, H. Koeppl, and T. Petrov, “Lumpability abstractions
of rule based systems,” Theoretical Computer Science, vol. 431. Elsevier,
pp. 137–164, 2012.
ista: Feret J, Henzinger TA, Koeppl H, Petrov T. 2012. Lumpability abstractions
of rule based systems. Theoretical Computer Science. 431, 137–164.
mla: Feret, Jérôme, et al. “Lumpability Abstractions of Rule Based Systems.” Theoretical
Computer Science, vol. 431, Elsevier, 2012, pp. 137–64, doi:10.1016/j.tcs.2011.12.059.
short: J. Feret, T.A. Henzinger, H. Koeppl, T. Petrov, Theoretical Computer Science
431 (2012) 137–164.
date_created: 2018-12-11T12:01:47Z
date_published: 2012-05-04T00:00:00Z
date_updated: 2023-02-23T11:39:40Z
day: '04'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2011.12.059
intvolume: ' 431'
language:
- iso: eng
month: '05'
oa_version: None
page: 137 - 164
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '3515'
pubrep_id: '73'
quality_controlled: '1'
related_material:
record:
- id: '3719'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Lumpability abstractions of rule based systems
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 431
year: '2012'
...