Graph Transformations in Computer Science: International Workshop Dagstuhl Castle, Germany, January 4–8, 1993 Proceedings

Path-controlled graph grammars for multiresolution image processing and analysis....Pages 1-18
Syntax and semantics of hybrid database languages....Pages 19-36
Decomposability helps for deciding logics of knowledge and belief....Pages 37-50
Extending graph rewriting with copying....Pages 51-70
Graph-grammar semantics of a higher-order programming language for distributed systems....Pages 71-85
Abstract graph derivations in the double pushout approach....Pages 86-103
Note on standard representation of graphs and graph derivations....Pages 104-118
Jungle rewriting: An abstract description of a lazy narrowing machine....Pages 119-137
Recognizable sets of graphs of bounded tree-width....Pages 138-152
Canonical derivations for high-level replacement systems....Pages 153-169
A computational model for generic graph functions....Pages 170-187
Graphs and designing....Pages 188-202
ESM systems and the composition of their computations....Pages 203-217
Relational structures and their partial morphisms in view of single pushout rewriting....Pages 218-233
Single pushout transformations of equationally defined graph structures with applications to actor systems....Pages 234-247
Parallelism in single-pushout graph rewriting....Pages 248-264
Semantics of full statecharts based on graph rewriting....Pages 265-279
Contextual occurrence nets and concurrent constraint programming....Pages 280-295
Uniform-modelling in graph grammar specifications....Pages 296-311
Set-theoretic graph rewriting....Pages 312-325
On relating rewriting systems and graph grammars to event structures....Pages 326-340
Logic based structure rewriting systems....Pages 341-357
Guaranteeing safe destructive updates through a type system with uniqueness information for graphs....Pages 358-379
Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system....Pages 380-394