Abstract
The relation-algebraic approach to graph transformation replaces the universal category-theoretic characterisations of pushout and pullbacks with the local characterisations of tabulations and co-tabulations. The theory of collagories is a weak axiomatisation of relation-algebraic operations that closely corresponds to adhesive categories.
We show how to amalgamate double-pushout and double-pullback rewriting steps into a fused rewriting concept where rules can contain subgraph variables in a natural and flexible way, and rewriting can delete or duplicate the matched instances of such variables.
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
Bauderon, M., Jacquet, H.: Pullback as a Generic Graph Rewriting Mechanism. Applied Categorical Structures 9(1), 65–82 (2001)
Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., Löwe, M.: Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, ch. 3. Foundations, vol. 1, pp. 163–245. World Scientific, Singapore (1997)
Freyd, P.J., Scedrov, A.: Categories, Allegories, North-Holland Mathematical Library, vol. 39. North-Holland, Amsterdam (1990)
Jacquet, H.: Une approche catégorique de la réécriture de sommets dans les graphes. PhD thesis, Université Bordeaux 1 (1999)
Kahl, W.: A Relation-Algebraic Approach to Graph Structure Transformation, Habil. Thesis, Fakultät für Informatik, Univ. der Bundeswehr München, Techn. Report 2002-03 (2001), http://sqrl.mcmaster.ca/~kahl/Publications/RelRew/
Kahl, W.: A Relation-Algebraic Approach to Graph Structure Transformation. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 1–14. Springer, Heidelberg (2002)
Kahl, W.: Refactoring Heterogeneous Relation Algebras around Ordered Categories and Converse. J. Relational Methods in Comp. Sci. 1, 277–313 (2004)
Kahl, W.: Collagories for Relational Adhesive Rewriting. In: Berghammer, R., Jaoua, A.M., Möller, B. (eds.) RelMiCS 2009. LNCS, vol. 5827, pp. 211–226. Springer, Heidelberg (2009)
Kahl, W.: Collagory Notes, Version 1. SQRL Report 57, Software Quality Research Laboratory, Department of Computing and Software, McMaster University, 53 pages (2010), http://sqrl.mcmaster.ca/sqrl_reports.html
Kawahara, Y.: Pushout-Complements and Basic Concepts of Grammars in Toposes. Theoretical Computer Science 77, 267–289 (1990)
Kozen, D.: A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events. Inform. and Comput. 110(2), 366–390 (1994)
Lack, S., Sobociński, P.: Adhesive Categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 273–288. Springer, Heidelberg (2004)
Löwe, M., König, H., Peters, M., Schulz, C.: Refactoring Informations Systems. In: Software Evolution through Transformations. Electronic Communications of the EASST, vol. 3 (2006)
Schmidt, G., Ströhlein, T.: Relations and Graphs, Discrete Mathematics for Computer Scientists. EATCS-Monographs on Theoret. Comput. Sci. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kahl, W. (2010). Amalgamating Pushout and Pullback Graph Transformation in Collagories. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-15928-2_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15927-5
Online ISBN: 978-3-642-15928-2
eBook Packages: Computer ScienceComputer Science (R0)