License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2012.276
URN: urn:nbn:de:0030-drops-38669
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3866/
Danos, Vincent ;
Feret, Jerome ;
Fontana, Walter ;
Harmer, Russell ;
Hayman, Jonathan ;
Krivine, Jean ;
Thompson-Walsh, Chris ;
Winskel, Glynn
Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
Abstract
In this paper, we introduce a novel way of constructing concise
causal histories (pathways) to represent how specified structures
are formed during simulation of systems represented by rule-based
models. This is founded on a new, clean, graph-based semantics
introduced in the first part of this paper for Kappa, a rule-based
modelling language that has emerged as a natural description of
protein-protein interactions in molecular biology [Bachman 2011]. The semantics is capable of capturing the whole of Kappa, including subtle side-effects on deletion of structure, and its structured presentation provides the basis for the translation of techniques to other models. In particular, we give a notion of trajectory compression, which restricts a trace culminating in the production of a given structure to the actions necessary for the structure to occur. This is central to the reconstruction of biochemical pathways due to the failure of traditional techniques to provide adequately concise causal histories, and we expect it to be applicable in a range of other modelling situations.
BibTeX - Entry
@InProceedings{danos_et_al:LIPIcs:2012:3866,
author = {Vincent Danos and Jerome Feret and Walter Fontana and Russell Harmer and Jonathan Hayman and Jean Krivine and Chris Thompson-Walsh and Glynn Winskel},
title = {{Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) },
pages = {276--288},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-47-7},
ISSN = {1868-8969},
year = {2012},
volume = {18},
editor = {Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2012/3866},
URN = {urn:nbn:de:0030-drops-38669},
doi = {10.4230/LIPIcs.FSTTCS.2012.276},
annote = {Keywords: concurrency, rule-based models, graph rewriting, pathways, causality}
}
|
Keywords: |
|
concurrency, rule-based models, graph rewriting, pathways, causality |
|
Collection: |
|
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) |
|
Issue Date: |
|
2012 |
|
Date of publication: |
|
14.12.2012 |
