Abstract
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into consideration productions that change labels, however, may add ambiguity even in the case of injective graph productions. A well-known solution to this problem is restricting the categorical treatment to the underlying graphs, whereas the labels on the derived graph are defined by other means. In this paper, we resume the detailed results on arbitrary left-hand sides that Ehrig and Kreowski have already given in 1976. We apply these results to the case of relabeling such that we can retain the elegant categorical constructions at the level of labeled graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph Grammars 1978. LNCS, vol. 73. Springer, Berlin (1978)
Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.): ICGT 2002. LNCS, vol. 2505. Springer, Heidelberg (2002)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algrebraic approaches to graph transformation - Part I: Basic concepts and double pushout approach. In [14], pp. 163–245
Ehrig, H.: Introduction to the algebraic theory of graph grammars (a survey). In: [1], pp. 1–69
Ehrig, H., Engels, G., Kreowski, H.J., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Applications, Languages, and Tools, vol. 2. World Scientific, Singapore (1999)
Ehrig, H., Kreowski, H.J.: Categorical approach to graphic systems and graph grammars. Lect. Notes Economics Math. Systems, vol. 131, pp. 323–351 (1976)
Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism, and Distribution, vol. 3. World Scientific, Singapore (1999)
Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.): Graph Grammars 1986. LNCS, vol. 291. Springer, Heidelberg (1987)
Ehrig, H., Pfender, M., Schneider, H.J.: Graph-grammars - An algebraic approach. In: Proceed. Conf. Switching and Automata Theory, Iowa, pp. 167–180 (1973)
Habel, A., Plump, D.: Relabelling in graph transformation. In [2], pp. 135–147
Parisi-Presicce, F., Ehrig, H., Montanari, U.: Graph rewriting with unification and composition. In [8], pp. 496–514
Plump, D.: Term graph rewriting. In: [5], pp. 3–61
Rosen, B.K.: Deriving graphs from graphs by applying a production. Acta Informatica 4, 337–357 (1975)
Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation. Foundations, vol. 1. World Scientific, Singapore (1997)
Schneider, H.J.: Syntax-directed description of incremental compilers. LNCS, vol. 26, pp. 192–201. Springer, Berlin (1975)
Schneider, H.J.: Conceptual data base description using graph-grammars. In: Noltemeier, H. (ed.) Graphen, Algorithmen, Datenstrukturen, Hanser, München, pp. 77–97 (1976)
Schneider, H.J.: Describing distributed systems by categorical graph grammars. LNCS, vol. 411, pp. 121–135. Springer, Berlin (1990)
Schneider, H.J.: On categorical graph grammars integrating structural transformations and operations on labels. Theoretical Computer Science 109, 257–274 (1993)
Schneider, H.J.: Describing systems of processes by means of high-level replacement. In: [7], pp. 401–450
Schneider, H.J.: Graph Transformations – An Introduction to the Categorical Approach, Preliminary version, http://www2.informatik.uni-erlangen.de/~schneide/gtbook/index.xml (Link checked November 2, 2004)
Schneider, H.J., Ehrig, H.: Grammars on partial graphs. Acta Informatica 6(2), 297–316 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schneider, H.J. (2005). Changing Labels in the Double-Pushout Approach Can Be Treated Categorically. In: Kreowski, HJ., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds) Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, vol 3393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31847-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-31847-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24936-8
Online ISBN: 978-3-540-31847-7
eBook Packages: Computer ScienceComputer Science (R0)