Graph transformations in computer science : international workshop, Dagstuhl Castle, Germany, January 4-8, 1993 : proceedings
Author(s)
Bibliographic Information
Graph transformations in computer science : international workshop, Dagstuhl Castle, Germany, January 4-8, 1993 : proceedings
(Lecture notes in computer science, 776)
Springer-Verlag, c1994
- : us
- : gw
Available at 58 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references
Description and Table of Contents
Description
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 construction, software engineering, concurrent and distributed systems modelling, and database design and theory. This volume contains 24 selected and revised papers from an international seminar held in Dagstuhl, Germany, in 1993. The papers cover topics in the following areas: foundations of graph grammars and transformations; and applications of graph transformations to concurrent computing, specification and programming, and pattern generation and recognition.
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.
by "Nielsen BookData"