Computer Science – Logic in Computer Science
Scientific paper
2010-08-12
EPTCS 32, 2010, pp. 26-41
Computer Science
Logic in Computer Science
In Proceedings SOS 2010, arXiv:1008.1906
Scientific paper
10.4204/EPTCS.32.3
Inspired by decomposition problems in rule-based formalisms in Computational Systems Biology and recent work on compositionality in graph transformation, this paper proposes to use arbitrary colimits to "deconstruct" models of reactions in which states are represented as objects of adhesive categories. The fundamental problem is the decomposition of complex reactions of large states into simpler reactions of smaller states. The paper defines the local decomposition problem for transformations. To solve this problem means to "reconstruct" a given transformation as the colimit of "smaller" ones where the shape of the colimit and the decomposition of the source object of the transformation are fixed in advance. The first result is the soundness of colimit decomposition for arbitrary double pushout transformations in any category, which roughly means that several "local" transformations can be combined into a single "global" one. Moreover, a solution for a certain class of local decomposition problems is given, which generalizes and clarifies recent work on compositionality in graph transformation.
No associations
LandOfFree
Structural Decomposition of Reactions of Graph-Like Objects 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 Structural Decomposition of Reactions of Graph-Like Objects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structural Decomposition of Reactions of Graph-Like Objects will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-587196