Refinements of Graph Transformation Systems via Rule Expressions
Graph transformation systems are formal models of computational systems, specified by rules that describe the atomic steps of the system. A refinement of a graph transformation system is given by associating with each of its rules a composition of rules of a refining system, that has the same visible effect as the original rule. The basic composition operations on graph transformation rules are sequential and parallel composition, corresponding to temporal and spatial refinements respectively. Syntactically refinements are represented by rule expressions that describe how the refining rules shall be composed.
Unable to display preview. Download preview PDF.
- 3.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: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph transformation: Foundations, vol. 1, pp. 163–246. World Scientific, Singapore (1997)CrossRefGoogle Scholar
- 7.Grose–Rhode, M., Parisi Presicce, F., Simeoni, M.: Refinements and modules for typed graph transformation systems. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol. 1589, pp. 137–151. Springer, Heidelberg (1999)Google Scholar