Lumpability Abstractions of Rule-based Systems

Feret, Jérôme; Henzinger, Thomas; Koeppl, Heinz; Petrov, Tatjana

Lumpability Abstractions of Rule-based Systems

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2010

Autor:innen

Feret, Jérôme

Henzinger, Thomas

Koeppl, Heinz

Petrov, Tatjana

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

BEHRE, Jörn, ed. and others. Proceedings compendium of the Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi : MeCBIC2010 : and of the First Workshop on Applications of Membrane Computing : Concurrency : and Agent-based Modelling in Population Biology : AMCA-POP2010 : satellite events of the Eleventh International Conference on Membrane Computing : CMC11 : Friedrich Schiller University Jena : Germany 23 and 25 August 2010. Berlin: Pro Business, 2010, pp. 135-154. ISBN 978-3-86805-767-6

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Konferenz

MeCBIC 2010 : Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi 2010 and AMCA-POP2010 : First Workshop on Applications of Membrane Computing : Concurrency : and Agent-based Modelling in Population Biology, 23. Aug. 2010 - 25. Aug. 2010, Jena

Zitieren

ISO 690

FERET, Jérôme, Thomas HENZINGER, Heinz KOEPPL, Tatjana PETROV, 2010. Lumpability Abstractions of Rule-based Systems. MeCBIC 2010 : Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi 2010 and AMCA-POP2010 : First Workshop on Applications of Membrane Computing : Concurrency : and Agent-based Modelling in Population Biology. Jena, 23. Aug. 2010 - 25. Aug. 2010. In: BEHRE, Jörn, ed. and others. Proceedings compendium of the Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi : MeCBIC2010 : and of the First Workshop on Applications of Membrane Computing : Concurrency : and Agent-based Modelling in Population Biology : AMCA-POP2010 : satellite events of the Eleventh International Conference on Membrane Computing : CMC11 : Friedrich Schiller University Jena : Germany 23 and 25 August 2010. Berlin: Pro Business, 2010, pp. 135-154. ISBN 978-3-86805-767-6

BibTex

@inproceedings{Feret2010Lumpa-42230,
  year={2010},
  title={Lumpability Abstractions of Rule-based Systems},
  isbn={978-3-86805-767-6},
  publisher={Pro Business},
  address={Berlin},
  booktitle={Proceedings compendium of the Fourth Workshop on Membrane Computing and Biologically Inspired Process Calculi : MeCBIC2010 : and of the First Workshop on Applications of Membrane Computing : Concurrency : and Agent-based Modelling in Population Biology : AMCA-POP2010 : satellite events of the Eleventh International Conference on Membrane Computing : CMC11 : Friedrich Schiller University Jena : Germany 23 and 25 August 2010},
  pages={135--154},
  editor={Behre, Jörn},
  author={Feret, Jérôme and Henzinger, Thomas and Koeppl, Heinz and Petrov, Tatjana}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/42230">
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:creator>Koeppl, Heinz</dc:creator>
    <dc:creator>Feret, Jérôme</dc:creator>
    <dc:creator>Henzinger, Thomas</dc:creator>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T08:55:41Z</dc:date>
    <dc:contributor>Koeppl, Heinz</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42230"/>
    <dcterms:issued>2010</dcterms:issued>
    <dcterms:title>Lumpability Abstractions of Rule-based Systems</dcterms:title>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T08:55:41Z</dcterms:available>
    <dc:language>eng</dc:language>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:creator>Petrov, Tatjana</dc:creator>
    <dc:contributor>Petrov, Tatjana</dc:contributor>
    <dc:contributor>Henzinger, Thomas</dc:contributor>
    <dc:contributor>Feret, Jérôme</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:abstract xml:lang="eng">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.</dcterms:abstract>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein