Maximal Reduction of Deterministic Semantics of Rule-Based Models : Syntax- Independent Setup

Petrov, Tatjana; Koeppl, Heinz

Maximal Reduction of Deterministic Semantics of Rule-Based Models : Syntax- Independent Setup

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2010

Autor:innen

Petrov, Tatjana

Koeppl, Heinz

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

NYKTER, Matti, ed. and others. Seventh International Workshop on Computational Systems Biology : WCSB 2010 : June 16–18 : 2010 : Luxembourg. Tampere: Tampere International Center for Signal Processing, 2010, pp. 83-86. TICSP series. ISSN 1456-2774

Zusammenfassung

We develop a syntax-independent rule-based specification in a set-theoretical framework. The reactants of rules are usually defined as partially defined objects, called patterns, to denote that we can apply a reaction by substituting a pattern with any species that contains the context described by the pattern. We choose a very general data structure to represent the patterns: we write a pattern as a set of species which comply the pattern, and we call it a macro-species. We define the deterministic (ODE) semantics on such a rule set, and we define its reduction imposed by aggregation of species. We characterize for which aggregations we can correctly compute the reduced ODE semantics directly from the rule set, ie which aggregations are self-consistent. Finally, we propose an algorithm that, given a set of initial aggregates, computes the least-refined self-consistent aggregation which contains the initial aggregates.

Fachgebiet (DDC)

004 Informatik

Konferenz

WCSB 2010 : Seventh International Workshop on Computational Systems Biology, 16. Juni 2010 - 18. Juni 2010, Luxembourg

Zitieren

ISO 690

PETROV, Tatjana, Heinz KOEPPL, 2010. Maximal Reduction of Deterministic Semantics of Rule-Based Models : Syntax- Independent Setup. WCSB 2010 : Seventh International Workshop on Computational Systems Biology. Luxembourg, 16. Juni 2010 - 18. Juni 2010. In: NYKTER, Matti, ed. and others. Seventh International Workshop on Computational Systems Biology : WCSB 2010 : June 16–18 : 2010 : Luxembourg. Tampere: Tampere International Center for Signal Processing, 2010, pp. 83-86. TICSP series. ISSN 1456-2774

BibTex

@inproceedings{Petrov2010Maxim-42231,
  year={2010},
  title={Maximal Reduction of Deterministic Semantics of Rule-Based Models : Syntax- Independent Setup},
  issn={1456-2774},
  publisher={Tampere International Center for Signal Processing},
  address={Tampere},
  series={TICSP series},
  booktitle={Seventh International Workshop on Computational Systems Biology : WCSB 2010 : June 16–18 : 2010 : Luxembourg},
  pages={83--86},
  editor={Nykter, Matti},
  author={Petrov, Tatjana and Koeppl, Heinz}
}

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/42231">
    <dc:creator>Koeppl, Heinz</dc:creator>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T08:57:59Z</dc:date>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2018-05-02T08:57:59Z</dcterms:available>
    <dc:language>eng</dc:language>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:abstract xml:lang="eng">We develop a syntax-independent rule-based specification in a set-theoretical framework. The reactants of rules are usually defined as partially defined objects, called patterns, to denote that we can apply a reaction by substituting a pattern with any species that contains the context described by the pattern. We choose a very general data structure to represent the patterns: we write a pattern as a set of species which comply the pattern, and we call it a macro-species. We define the deterministic (ODE) semantics on such a rule set, and we define its reduction imposed by aggregation of species. We characterize for which aggregations we can correctly compute the reduced ODE semantics directly from the rule set, ie which aggregations are self-consistent. Finally, we propose an algorithm that, given a set of initial aggregates, computes the least-refined self-consistent aggregation which contains the initial aggregates.</dcterms:abstract>
    <dcterms:issued>2010</dcterms:issued>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Petrov, Tatjana</dc:contributor>
    <dc:creator>Petrov, Tatjana</dc:creator>
    <dc:contributor>Koeppl, Heinz</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/42231"/>
    <dcterms:title>Maximal Reduction of Deterministic Semantics of Rule-Based Models : Syntax- Independent Setup</dcterms:title>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein