Graph Transformations in Computer Science International Workshop, Dagstuhl Castle, Germany, January 4 - 8, 1993. Proceedings / edited by Hans J. Schneider, Hartmut Ehrig.

The research area of graph grammars and graph transformations dates back only two decades. But already methods and results from the area of graph transformation have been applied in many fields of computer science, such as formal language theory, pattern recognition and generation, compiler construc...

Full description

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Schneider, Hans J. (Editor), Ehrig, Hartmut (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1994.
Edition:	1st ed. 1994.
Series:	Lecture Notes in Computer Science, 776 Springer eBook Collection.
Subjects:	Pattern recognition. Computers. Mathematical logic. Combinatorics. Software engineering. Data structures (Computer science). Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

Path-controlled graph grammars for multiresolution image processing and analysis
Syntax and semantics of hybrid database languages
Decomposability helps for deciding logics of knowledge and belief
Extending graph rewriting with copying
Graph-grammar semantics of a higher-order programming language for distributed systems
Abstract graph derivations in the double pushout approach
Note on standard representation of graphs and graph derivations
Jungle rewriting: An abstract description of a lazy narrowing machine
Recognizable sets of graphs of bounded tree-width
Canonical derivations for high-level replacement systems
A computational model for generic graph functions
Graphs and designing
ESM systems and the composition of their computations
Relational structures and their partial morphisms in view of single pushout rewriting
Single pushout transformations of equationally defined graph structures with applications to actor systems
Parallelism in single-pushout graph rewriting
Semantics of full statecharts based on graph rewriting
Contextual occurrence nets and concurrent constraint programming
Uniform-modelling in graph grammar specifications
Set-theoretic graph rewriting
On relating rewriting systems and graph grammars to event structures
Logic based structure rewriting systems
Guaranteeing safe destructive updates through a type system with uniqueness information for graphs
Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system.

Graph Transformations in Computer Science International Workshop, Dagstuhl Castle, Germany, January 4 - 8, 1993. Proceedings / edited by Hans J. Schneider, Hartmut Ehrig.

Similar Items