@inproceedings{EOP06,
Title = {{ Categorical Foundations of Distributed Graph Transformation}},
Author = {Ehrig, H. and Orejas, F. and Prange, U.},
Booktitle = {Proc. Third International Conference on Graph Transformation (ICGT'06)},
Pages = {215 -- 229},
Year = {2006},
Issn = {ISSN 0302-9743, ISBN 3-540-38870-2},
Address = {Natal, Brazil},
Volume = {4178},
Month = {September},
Editor = {Corradini, A. and Ehrig, H. and Montanari, U. and Ribeiro, L. and Rozenberg, G.},
Publisher = {SPRINGER},
Series = {LNCS},
Abstract = {A distributed graph $(N,D)$ consists of a network graph $N$ and a commutative diagram $D$ over the scheme $N$ which associates local graphs $D(n_i)$ and graph morphisms $D(e) : D(n1) \to D(n2)$ to nodes $n1, n2$ and edges $e : n1 \to n2 in N$. Although there are several interesting applications of distributed graphs and transformations, even the basic pushout constructions for the double pushout approach of distributed graph transformation could be shown up to now only in very special cases. In this paper we show that the category of distributed graphs can be considered as a Grothendieck category over a specific indexed category, which assigns to each network $N$ the category of all diagrams $D$ of shape N. In this framework it is possible to give a free construction which allows to construct for each diagram $D1$ over $N1$ and network morphism $h : N1 \to N2$ a free extension $F_h(D1)$ over $N2$ and to show that the Grothendieck category is complete and cocomplete if the underlying category of local graphs has these properties. Moreover, an explicit construction for general pushouts of distributed graphs is given. This pushout construction is based on the free construction. The non-trivial proofs for free constructions and pushouts are the main contributions of this paper and they are compared with the special cases known up to now.},
Url = {http://tfs.cs.tu-berlin.de/publikationen/Papers06/EOP06.pdf},
Keywords = {graph transformation approach, SPO rewriting, DPO rewriting, Sesqui Pushout}
}