Abstract
Although coalgebras are widely used to model dynamic systems with infinite behaviours, they are actually also a more natural tool than algebras to model the static systems that are the main subject of the “algebraic approach” to graph transformation and model transformation: many variants of graph structures and object webs are more easily modelled as coalgebras than as algebras. By characterising the kinds of coalgebras that give rise to different kinds of allegories, we make the tools of the relation-algebraic approach and also of the category-theoretic “adhesive” “algebraic approach” available to the transformations of coalgebras.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bird, R.S., de Moor, O.: Algebra of Programming. International Series in Computer Science, vol. 100. Prentice Hall, Upper Saddle River (1997)
de Roever, W.-P., Engelhardt, K.: Data Refinement: Model-Oriented Proof Methods and Their Comparison. Cambridge University Press, Cambridge (1998)
Ehrig, H., Habel, A., Kreowski, H.J., Parisi-Presicce, F.: From graph grammars to high level replacement systems. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 269–287. Springer, Heidelberg (1991)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Springer, Heidelberg (2006). doi:10.1007/3-540-31188-2
Freyd, P.J., Scedrov, A.: Categories, Allegories, vol. 39. North-Holland Mathematical Library, Amsterdam (1990)
Heckel, R., Küster, J.M., Taentzer, G.: Confluence of typed attributed graph transformation systems. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol. 2505, pp. 161–176. Springer, Heidelberg (2002). doi:10.1007/3-540-45832-8_14
Kahl, W.: A relation-algebraic approach to graph structure transformation, 2001. Habil thesis, Fakultät für Informatik, Univ. der Bundeswehr München, Technical report 2002–03. http://relmics.mcmaster.ca/~kahl/Publications/RelRew/
Kahl, W.: Refactoring heterogeneous relation algebras around ordered categories and converse. J. Relational Methods Comput. Sci. 1, 277–313 (2004). http://www.jormics.org/
Kahl, W.: Amalgamating pushout and pullback graph transformation in collagories. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 362–378. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15928-2_24
Kahl, W.: Collagories: relation-algebraic reasoning for gluing constructions. J. Logic Algebraic Programming 80(6), 297–338 (2011). doi:10.1016/j.jlap.2011.04.006
Kahl, W.: Categories of coalgebras with monadic homomorphisms. In: Bonsangue, M.M. (ed.) CMCS 2014. LNCS, vol. 8446, pp. 151–167. Springer, Heidelberg (2014). doi:10.1007/978-3-662-44124-4_9. Agda theories at http://RelMiCS.McMaster.ca/RATH-Agda/
Kahl, W.: Graph transformation with symbolic attributes via monadic coalgebra homomorphisms. ECEASST 71, 5.1–5.17 (2015). doi:10.14279/tuj.eceasst.71.999
Kawahara, Y.: Notes on the universality of relational functors. Mem. Fac. Sci. Kyushu Univ. Ser. A 27(2), 275–289 (1973)
Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366–390 (1994)
Kozen, D.: Typed Kleene algebra. Technical report 98–1669, Computer Science Department, Cornell University (1998)
Lack, S., Sobociński, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FoSSaCS 2004. LNCS, vol. 2987, pp. 273–288. Springer, Heidelberg (2004). doi:10.1007/978-3-540-24727-2_20
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. RAIRO Inform. Théor. Appl. 39(3), 511–545 (2005). doi:10.1051/ita:2005028
Löwe, M.: Algebraic approach to single-pushout graph transformation. Theoret. Comput. Sci. 109(1–2), 181–224 (1993). doi:10.1016/0304-3975(93)90068-5
Löwe, M., Korff, M., Wagner, A.: An algebraic framework for the transformation of attributed graphs. In: Sleep, M., Plasmeijer, M., van Eekelen, M. (eds.) Term Graph Rewriting: Theory and Practice, pp. 185–199. Wiley, Hoboken (1993)
Meijer, E., Fokkinga, M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol. 523, pp. 124–144. Springer, Heidelberg (1991). doi:10.1007/3540543961_7
Norell, U.: Towards a practical programming language based on dependent type theory. Ph.D. thesis, Department of Computer Science and Engineering, Chalmers University of Technology (2007). See also http://wiki.portal.chalmers.se/agda/pmwiki.php
Schmidt, G., Ströhlein, T.: Relations and Graphs, Discrete Mathematics for Computer Scientists. EATCS-Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kahl, W. (2017). Allegories and Collagories for Transformation of Graph Structures Considered as Coalgebras. In: Höfner, P., Pous, D., Struth, G. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2017. Lecture Notes in Computer Science(), vol 10226. Springer, Cham. https://doi.org/10.1007/978-3-319-57418-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-57418-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57417-2
Online ISBN: 978-3-319-57418-9
eBook Packages: Computer ScienceComputer Science (R0)