zbMATH — the first resource for mathematics

An abstract module concept for graph transformation systems. (English) Zbl 1263.68093
Bauderon, Michel (ed.) et al., GETGRATS closing workshop on graph transformation systems, Bordeaux, France, June 22–23, 2001. Proceedings. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 51, 290-303 (2002).
Summary: Graph transformation systems are a well-known formal specification technique that support the rule based specification of the dynamic behaviour of systems. Recently, many specification languages for graph transformation systems have been developed, and modularization techniques are then needed in order to deal with large and complex graph transformation specifications, to enhance the reuse of specifications, and to hide implementation details. In this paper we present an abstract categorical approach to modularization of graph transformation systems. Modules are called cat-modules and defined over a generic category cat of graph transformation specifications and morphisms. We describe the main characteristics and properties of cat-modules, their interconnection operations, namely union, composition and refinement of modules, and some compatibility properties between such operations.
For the entire collection see [Zbl 1262.68010].

68Q42 Grammars and rewriting systems
68Q60 Specification and verification (program logics, model checking, etc.)
PDF BibTeX Cite
Full Text: DOI
[1] Corradini, A.; Montanari, U.; Rossi, F., “graph processes”, Special issue of fundamenta informaticae, Vol. 26, 3,4, 241-266, (1996) · Zbl 0854.68054
[2] A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel, M. Löwe “Algebraic approaches to graph transformation part I: Basic concepts and double pushout approach” In [14], pp. 163-246
[3] H. Ehrig, G. Engels “Pragmatic and Semantic Aspects of a Module Concept for Graph Transformation Systems” Proc. 5th International Workshop on Graph Grammars and their application to Computer Science, Williamsburg ’94, LNCS 1073, pp. 137-154 (1996) · Zbl 1412.68105
[4] ()
[5] ()
[6] Ehrig, H.; Mahr, B., “fundamentals of algebraic specifications 2: module specifications and constraints”, () · Zbl 0759.68013
[7] C. Ermel, M. Rudolf, G. Taentzer “The AGG approach: Language and Environment” in [4], pp. 487-546 (1999)
[8] M. Große-Rhode, F. Parisi Presicce, M. Simeoni “Formal Software Specification with Refinements and Modules of Typed Graph Transformation Systems” Journal of Computer and System Sciences, to appear. · Zbl 1013.68066
[9] D. Janssens “Actor Grammars and Local Actions” In [5], pp.57-106 (1999)
[10] Kreowski, H-J.; Kuske, S., “on the interleaving semantics of transformation units - A step into GRACE”, Lncs 1073, 89-106, (1996) · Zbl 1412.68109
[11] H-J. Kreowski, S. Kuske “Graph Transformation Units and Modules” In [4], pp. 607-638
[12] F. Parisi Presicce “Inner and Mutual Compatibility of operations on module specifications” Technical Report 86-06 TU Berlin (1986) · Zbl 0589.68017
[13] Parisi Presicce, F., “transformation of graph grammars”, Lncs 1073, 428-442, (1996) · Zbl 1412.68113
[14] ()
[15] M. Simeoni “A Categorical Approach to Modularization of Graph Transformation Systems using Refinements” PhD Thesis, Universitá La Sapienza di Roma (2000)
[16] A. Schürr, A. Winter “UML Packages for PROgrammed Graph REwriting Systems” Proc. 6th international Workshop on Theory and Application of Graph Transformation (TAGT’98), Paderbon, LNCS 1764, pp. 396-409 (1999) · Zbl 0971.68642
[17] A. Schürr, A. Winter, A. Zündorf “The PROGRES approach: Language and Environment” in [4], pp. 547-668 (1999)
[18] G. Taentzer, A. Schürr “DIEGO, another step towards a module concept for graph transformation systems” Proc. Graph Rewriting and Communication, SEGRAGRA ’95 Electronic Notes of TCS, Vol. 2, (1995) http://www.elsevier.nl/locate/entcs/volume2.html · Zbl 0910.68121
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.