×

From graph grammars to high level replacement systems. (English) Zbl 0765.68088

Graph grammars and their application to computer science, Proc. 4th Int. Workshop, Bremen/Ger. 1990, Lect. Notes Comput. Sci. 532, 269-291 (1991).
Summary: [For the entire collection see Zbl 0753.00023.]
The algebraic approach to graph grammars — well-known in the literature for several types of graphs and structures — is extended to include several new types of replacement systems, especially the replacement of algebraic specifications which were recently introduced for a rule-based approach to modular system design.
This leads to the new concept of high level replacement systems which is formulated in an axiomatic algebraic framework based on categories and double-pushouts. In this paper only basic notions like productions, derivations, parallel and sequential independence are introduced for high-level replacement systems leading to Church-Rosser and parallelism theorems previously shown in the literature for special cases only.

MSC:

68Q42 Grammars and rewriting systems
68Q60 Specification and verification (program logics, model checking, etc.)

Citations:

Zbl 0753.00023
PDFBibTeX XMLCite