Abstract
The functional behaviour of a graph transformation system is a crucial property in several application domains including model transformations and visual language engineering. Termination is one of the ingredients of functional behaviour and thus equally important. However, the termination of graph transformation systems is generally undecidable. Hence, most of the published termination criteria focus on specific classes of graph transformations. Unfortunately graph transformations with lots of production rules usually do not fit into one of these classes. It would be advantageous if different sets of the production rules in the graph transformation system could be verified using different criteria. This paper addresses this problem by providing structural conditions on the rules enabling such combination of termination criteria.
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
AGG - Attributed Graph Grammar System Environment (2007), http://tfs.cs.tu-berlin.de/agg
Bottoni, P., Koch, M., Parisi-Presicce, F., Taentzer, G.: Termination of high-level replacement units with application to model transformation. Electronic Notes Theoretical Computer Science 127(4), 71–86 (2005)
Bognar, M.: A survey of abstract rewriting. Master’s thesis, VU University Amsterdam (1995)
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: Handbook of Graph Grammars, pp. 163–246 (1997)
Ehrig, H., Bisztray, D., Heckel, R.: Verification of architectural refactoring rules. Technical report, Department of Computer Science, University of Leicester (2008), http://www.cs.le.ac.uk/people/dab24/refactoring-techrep.pdf
Ehrig, H., Ehrig, K., de Lara, J., Taentzer, G., Varró, D., Varró-Gyapay, S.: Termination criteria for model transformation. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 49–63. Springer, Heidelberg (2005)
Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science). An EATCS Series. Springer, New York (2006)
Antony, C., Hoare, R.: Communicating Sequential Processes. Prentice Hall International Series in Computer Science. Prentice Hall, Englewood Cliffs (April 1985)
Levendovszky, T., Prange, U., Ehrig, H.: Termination criteria for dpo transformations with injective matches. Electron. Notes Theor. Comput. Sci. 175(4), 87–100 (2007)
OMG. Unified Modeling Language, version 2.1.1 (2006), http://www.omg.org/technology/documents/formal/uml.htm
Plump, D.: On termination of graph rewriting. In: Graph-Theoretic Concepts in Computer Science, pp. 88–100 (1995)
Schürr, A.: Specification of graph translators with triple graph grammars. In: Tinhofer (ed.) WG 1994, vol. 903, pp. 151–163. Springer, Heidelberg (1994)
Varró, D., Asztalos, M., Bisztray, D., Boronat, A., Dang, D.-H., Geiß, R., Greenyer, J., Gorp, P., Kniemeyer, O., Narayanan, A., Rencis, E., Weinell, E.: Transformation of uml models to csp: A case study for graph transformation tools, pp. 540–565 (2008)
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
Bisztray, D., Heckel, R. (2010). Combining Termination Criteria by Isolating Deletion. 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_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-15928-2_14
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)