direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publications Prof. Hartmut Ehrig (TFS)

Categorical Foundations of Distributed Graph Transformation
Zitatschlüssel EOP06
Autor Ehrig, H. and Orejas, F. and Prange, U.
Buchtitel Proc. Third International Conference on Graph Transformation (ICGT'06)
Seiten 215 – 229
Jahr 2006
ISSN ISSN 0302-9743, ISBN 3-540-38870-2
Adresse Natal, Brazil
Jahrgang 4178
Monat September
Herausgeber Corradini, A. and Ehrig, H. and Montanari, U. and Ribeiro, L. and Rozenberg, G.
Verlag SPRINGER
Serie LNCS
Zusammenfassung 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.
Link zur Publikation [1] Download Bibtex Eintrag [2]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008