Abstract
In graph transformation, a match just represents an occurrences of a rule’s left-hand side in the host graph. This is expressed by a morphism preserving the graph structure. However, there are situations where occurrences are bound by additional constraints. These can either be implicit, such as the gluing conditions of the DPO, or explicit such as negative application conditions.
In this paper we study another type of implicit condition based on the reflection of structure. Morphisms reflecting some of the structures of their targets are abstractly characterised as open maps in the sense of Joyal, Nielsen, and Winskel. We show that under certain restrictions on the rules, DPOs preserve open maps. We establish an encoding of open maps into negative application conditions and study concurrency properties of the new approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blostein, D.: Graph Transformation in Document Image Analysis: Approaches and Challenges. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 23–34. Springer, Heidelberg (2005)
Corradini, A., Heckel, R., Hermann, F., Gottmann, S., Nachtigall, N.: On the concurrent semantics of transformation systems with negative application conditions. In: Workshop on Algebraic Development Techniques, WADT 2012, Salamanca, Spain (2012) (Presentation and abstract)
Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Abstracting the differential semantics of rule-based models: Exact and automated model reduction. In: LICS, pp. 362–381. IEEE Computer Society (2010)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Comp. Sci. Springer (2006)
Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: an algebraic approach. In: 14th IEEE Symp. on Switching and Automata Theory, pp. 167–180. IEEE (1973)
Ehrig, H., Ehrig, K., Habel, A., Pennemann, K.H.: Theory of constraints and application conditions: From graphs to high-level structures. Fundam. Inf. 74(1), 135–166 (2006)
Habel, A., Heckel, R., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26(3,4), 287–313 (1996)
Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Inf. Comput. 127(2), 164–185 (1996)
Lack, S., Sobociński, P.: Adhesive Categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 273–288. Springer, Heidelberg (2004)
Lambers, L., Ehrig, H., Prange, U., Orejas, F.: Parallelism and concurrency in adhesive high-level replacement systems with negative application conditions. ENTCS 203(6), 43–66 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heckel, R. (2012). DPO Transformation with Open Maps. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Graph Transformations. ICGT 2012. Lecture Notes in Computer Science, vol 7562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33654-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-33654-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33653-9
Online ISBN: 978-3-642-33654-6
eBook Packages: Computer ScienceComputer Science (R0)