Sesqui-pushout rewriting is an algebraic graph transforma- tion approach that provides mechanisms for vertex cloning. If a vertex gets cloned, the original and the copy obtain the same context, i.e. all incoming and outgoing edges of the original are copied as well. This behaviour is not satisfactory in practical examples which require more control over the context cloning process. In this paper, we provide such a control mechanism by allowing each transformation rule to refine the underlying type graph. We discuss the relation to the existing approaches to controlled sesqui-pushout vertex cloning, elaborate a basic theoretical framework, and demonstrate its applicability by a practical example.
CITATION STYLE
Löwe, M. (2016). Sesqui-pushout rewriting with type refinements. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9761, pp. 21–36). Springer Verlag. https://doi.org/10.1007/978-3-319-40530-8_2
Mendeley helps you to discover research relevant for your work.