Abstract
Rule-based languages attract more and more attention as a high-level mechanism for the description of complex transformation processes on graph-like data structures. Unfortunately, pure rule-based approaches are not well prepared for expressing any kind of procedural knowledge. Therefore, various extensions were proposed which regulate the application of rewrite rales. This paper compares already existing regulation mechanisms and proposes a new approach based on control flow graphs. This approach is the first one, where complex control structures inherit all the properties of single rewrite rules, thereby allowing a smooth transition from a rule-oriented to an imperative programming paradigm. Finally, we will show how all reviewed regulation mechanisms may be defined using a very small set of basic concepts and a recently developed new fixpoint theorem. Having such a common formal background offers the opportunity to combine different regulation mechanisms within the future multi-paradigm graph grammar programming environment GRACE.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bunke H.: Sequentielle und parallele programmierte Graphgrammatiken, Dissertation, Technical Report IMMD-7-7, Universität Erlangen, Germany (1974)
Bunke H.: Programmed Graph Grammars, in: Proc. Int. Workshop on Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, Springer Verlag, Germany (1979), 155–166
Dijkstra E.W.: Guarded Commands, Nondeterminacy, and Formal Derivation of Programs, in CACM, no. 18, acm Press, USA (1975), 453–457
Dassow J., Paun G.: Regulated Rewriting in Formal Language Theory, EATCS 18, Springer Verlag, Germany (1989)
Dörr H.: Efficient Graph Rewriting and Its Implementatiion, Dissertation, LNCS 922, Springer Verlag, Germany (1995)
Engels G., Lewerentz C., Nagl M., Schäfer W., Schürr A.: Building Integrated Software Development Environments, in: ACM TOSEM, vol. 1, no. 2, acm Press, USA (1992), 135–167
Göttler H.: Graphgrammatiken in der Softwaretechnik, IFB 178, Springer Verlag, Germany (1988)
Himsolt M.: GraphED: An Interactive Graph Editor, in: Proc. STACS 89, LNCS 349, Springer Verlag, Germany (1988), 532–533
Kreowski H.J., Kuske S.: On the Interleaving Semantics of Transformation Units A Step into GRACE, in: Proc. 5th Int. Workshop Workshop on Graph-Grammars and Their Application to Computer Science, same volume
Kreowski H.J.: Graph Grammars for Software Specification and Programming: An Eulology in the Praise of GRACE, in: Proc. Colloquium on Graph Transformations and its Applications in Computer Science, Technical Report B-19, Universitat de les Illes Balears, Departament de Ciencies Matematiques i Informatica (1994), 55–62
Löwe M., Beyer M.: AGG — An Implementation of Algebraic Graph Rewriting, LNCS 690, Proc. 5th Int. Conf. on Rewriting Techniques and Applications, Springer Verlag, Germany (1993)
Manna Z.: Mathematical Theory of Computation, New York: McGraw-Hill, USA (1974)
Maggiolo-Schettini A., Winkowski J.: Programmed Derivations of Relational Structures, in: Proc. 4th Int. Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 532, Springer Verlag, Germany (1991), 582–598
Nagl M.: Graphgrammatiken, Vieweg Verlag, Germany (1979)
Nelson G.: A Generalization of Dijkstra's Calculus, in ACM Transactions on Programming Languages and Systems, vol. 11, no. 4, acm Press, USA (1989), 517–561
Schürr A.: PROGRES: A VHL-Language Based on Graph Grammars, in: Proc. 4th Int. Workshop on Graph-Grammars and Their Application to Computer Science, LNCS 532, Springer Verlag, Germany (1991), 641–659
Schürr A.: Operationales Spezifizieren mit programmierten Graphgrammatiken, Dissertation, RWTH Aachen, Deutscher Universitätsverlag, Germany (1991)
Schürr A.: Logic Based Programmed Structure Rewriting Systems, appears in: Special Issue on Graph Transformation Systems, Fundamenta Informaticae, North-Holland
Schürr A., Zündorf A.: Nondeterministic Control Structures for Graph Rewriting Systems, in Proc. WG'91 Workshop in Graphtheoretic Concepts in Computer Science, LNCS 570, Springer Verlag, Germany (1992), 48–62
Westfechtel B.: Revisionskontrolle in einer integrierten Softwareentwicklungs-Umgebung, Dissertation, RWTH Aachen, Informatik-Fachberichte 280, Springer Verlag, Germany (1991)
Zündorf A.: Implementation of the Imperative/Rule Based Language PROGRES, Technical Report AIB 92-38, RWTH Aachen, Germany (1992)
Zündorf A.: Eine Entwicklungsumgebung für PROgrammierte GRaphErsetzungs-Systerne, Dissertation, RWTH Aachen (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schürr, A. (1996). Programmed graph transformations and graph transformation units in GRACE. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_83
Download citation
DOI: https://doi.org/10.1007/3-540-61228-9_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61228-5
Online ISBN: 978-3-540-68388-9
eBook Packages: Springer Book Archive