Abstract
As presented in Ehrig et al. (Fundamentals of Algebraic Graph Transformation, EATCS Monographs, Springer, 2006), adhesive high-level replacement (HLR) categories and systems are an adequate framework for several kinds of transformation systems based on the double pushout approach. Since (weak) adhesive HLR categories are closed under product, slice, coslice, comma and functor category constructions, it is possible to build new (weak) adhesive HLR categories from existing ones. But for the general results of transformation systems, as additional properties initial pushouts, binary coproducts compatible with a special morphism class \(\cal{M}\) and a pair factorization are needed to obtain the full theory. In this paper, we analyze under which conditions these additional properties are preserved by the categorical constructions in order to avoid checking these properties explicitly.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brown, R., Janelidze, G.: Van Kampen theorems for categories of covering morphisms in lextensive categories. J. Pure Appl. Algebra 119, 255–263 (1997)
Ehrig, H.: Introduction to the algebraic theory of graph grammars (a survey). In: Claus, V., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars and Their Application to Computer Science and Biology. Lecture Notes in Computer Science, vol. 73, pp. 1–69 (1979)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation, EATCS Monographs. Springer (2006)
Ehrig, H., Habel, A., Kreowski, H., Parisi-Presicce, F.: Parallelism and concurrency in high-level replacement systems. Math. Structures Comput. Sci. 1(3), 361–404 (1991a)
Ehrig, H., Habel, A., Kreowski, H.-J., Parisi-Presicce, F.: From graph grammars to high level replacement systems. In: Ehrig, H., Kreowski, H.-J., R.G. (eds.) Graph Grammars and Their Application to Computer Science. Lecture Notes in Computer Science, vol. 532, pp. 269–291 (1991b)
Ehrig, H., Habel, A., Padberg, J., Prange, U.: Adhesive high-level replacement categories and systems. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) Proceedings of ICGT 2004, Lecture Notes in Computer Science, vol. 3256, pp. 144–160 (2004)
Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: an algebraic approach. In: Proceedings of FOCS 1973, pp. 167–180 (1973)
Ehrig, H., Prange, U.: Weak adhesive high-level replacement categories and systems: a unifying framework for graph and Petri net transformations. In: Futatsugi, K., Jouannaud, J., Meseguer, J. (eds.) Algebra, Meaning and Computation. Essays Dedicated to J.A. Goguen, vol. 4060 of LNCS, pp. 235–251 (2006)
Fiadeiro, J.: Categories for Software Engineering. Springer (2006)
Kreowski, H.: Manipulationen von Graphmanipulationen. Ph.D. thesis, TU Berlin (1978)
Lack, S., Sobociński, P.: Adhesive categories. In: Walukiewicz, I. (ed.) Proceedings of FOSSACS 2004. Lecture Notes in Computer Science, vol. 2987, pp. 273–288 (2004)
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications 39(3), 511–545 (2005)
MacLane, S.: Categories for the working mathematician.Graduate Texts in Mathematics, vol. 5. Springer (1971)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Prange, U., Ehrig, H. & Lambers, L. Construction and Properties of Adhesive and Weak Adhesive High-Level Replacement Categories. Appl Categor Struct 16, 365–388 (2008). https://doi.org/10.1007/s10485-007-9106-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10485-007-9106-3