Graph Grammars and Their Application to Computer Science 5th International Workshop, Williamsburg, VA, USA, November (13-18), 1995. Selected Papers.

This book contains a collection of 37 refereed full papers selected from the contributions presented at the 5th International Workshop on Graph Grammars and Their Applications to Computer Science, held in Williamsburg, Virginia, USA, in November 1994. The book covers the whole spectrum of methods an...

Full description

Bibliographic Details
Other Authors: Cuny, Janice (Editor), Ehrig, Hartmut (Editor), Engels, Gregor (Editor), Rozenberg, Grzegorz (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1996, 1996
Edition:1st ed. 1996
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 04734nmm a2200445 u 4500
001 EB000659315
003 EBX01000000000000000512397
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540683889 
100 1 |a Cuny, Janice  |e [editor] 
245 0 0 |a Graph Grammars and Their Application to Computer Science  |h Elektronische Ressource  |b 5th International Workshop, Williamsburg, VA, USA, November (13-18), 1995. Selected Papers.  |c edited by Janice Cuny, Hartmut Ehrig, Gregor Engels, Grzegorz Rozenberg 
250 |a 1st ed. 1996 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1996, 1996 
300 |a XI, 573 p  |b online resource 
505 0 |a The bounded degree problem for non-obstructing eNCE graph grammars -- Process specification and verification -- An event structure semantics for graph grammars with parallel productions -- Synchronized composition of graph grammar productions -- The decomposition of ESM computations -- Formal relationship between graph grammars and Petri nets -- Hierarchically distributed graph transformation -- On edge addition rewrite systems and their relevance to program analysis -- Graph automata for linear graph languages -- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed -- Concatenation of graphs -- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting -- Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence -- Chain-codepictures and collages generated by hyperedge replacement -- Transformations of graph grammars -- Drawing graphs with attribute graph grammars --  
505 0 |a Graph pattern matching in PROGRES -- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths -- The definition in monadic second-order logic of modular decompositions of ordered graphs -- Group based graph transformations and hierarchical representations of graphs -- Integrating lineage and interaction for the visualization of cellular structures -- Cellworks with cell rewriting and cell packing for plant morphogenesis -- Subapical bracketed L-systems 
505 0 |a A partial algebras approach to graph transformation -- The contractum in algebraic graph rewriting -- A category-theoretical approach to vertex replacement: The generation of infinite graphs -- Issues in the practical use of graph rewriting -- The category of typed graph grammars and its adjunctions with categories of derivations -- Graph unification and matching -- On the interleaving semantics of transformation units — A step into GRACE -- A graph rewriting framework for Statecharts semantics -- Programmed graph transformations and graph transformation units in GRACE -- Pragmatic and semantic aspects of a module concept for graph transformation systems -- Software integration problems and coupling of graph grammar specifications -- Using attributed flow graph parsing to recognize clichés in programs -- Reconfiguration Graph Grammar for massively parallel, fault tolerant computers -- The use of tree transducers to compute translations between graph algebras --  
653 |a Symbolic and Algebraic Manipulation 
653 |a Mathematics of Computing 
653 |a Computer science / Mathematics 
653 |a Mathematical logic 
653 |a Artificial Intelligence 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Artificial intelligence 
653 |a Discrete Mathematics 
653 |a Discrete mathematics 
653 |a Mathematical Logic and Foundations 
700 1 |a Ehrig, Hartmut  |e [editor] 
700 1 |a Engels, Gregor  |e [editor] 
700 1 |a Rozenberg, Grzegorz  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-61228-9 
856 4 0 |u https://doi.org/10.1007/3-540-61228-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.1 
520 |a This book contains a collection of 37 refereed full papers selected from the contributions presented at the 5th International Workshop on Graph Grammars and Their Applications to Computer Science, held in Williamsburg, Virginia, USA, in November 1994. The book covers the whole spectrum of methods and techniques for the investigation of the structure of graphs and graph transformations. The papers are divided into nine topical sections on rewriting techniques, specification and semantics, software engineering, algorithms and architectures, concurrency, graph languages, pattern and graphics, structure and logic of graphs, and biology