Dagstuhl Seminar Graph Transformations in Computer Science 1993

@proceedings{DBLP:conf/dagstuhl/1993gtcs,
  editor    = {Hans J{\"u}rgen Schneider and
               Hartmut Ehrig},
  title     = {Graph Transformations in Computer Science, International Workshop,
               Dagstuhl Castle, Germany, January 1993, Proceedings},
  booktitle = {Dagstuhl Seminar on Graph Transformations in Computer Science},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {776},
  year      = {1994},
  isbn      = {3-540-57787-4},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Kunio Aizawa, Akira Nakamura:
  Path-Controlled Graph Grammars for Mutliresolution Image Processing and Analysis. 1-18
  
• Marc Andries, Gregor Engels:
  Syntax and Semantics of Hybrid Database Languages. 19-36
  
• Stefan Arnborg:
  Decomposability Helps for Deciding Logics of Knowledge and Belief. 37-50
  
• Erik Barendsen, Sjaak Smetsers:
  Extending Graph Rewriting with Copying. 51-70
  
• Klaus Barthelmann, Georg Schied:
  Graph-Grammar Semantics of a Higher-Order Programming Language for Distributed Systems. 71-85
  
• Andrea Corradini, Hartmut Ehrig, Michael Löwe, Ugo Montanari, Francesca Rossi:
  Abstract Graph Derivations in the Double Pushout Approach. 86-103
  
• Andrea Corradini, Hartmut Ehrig, Michael Löwe, Ugo Montanari, Francesca Rossi:
  Jungle Rewriting: an Abstract Description of a Lazy Narrowing Machine. 119-137
  
• Bruno Courcelle, Jens Lagergren:
  Recognizable Sets of Graphs of Bounded Tree-Width. 138-152
  
• Hartmut Ehrig, Hans-Jörg Kreowski, Gabriele Taentzer:
  Canonical Derivaitons for High-Level Replacement Systems. 153-169
  
• Marc Gemis, Jan Paredaens, Peter Peelman, Jan Van den Bussche:
  A Computational Model for Generic Graph Functions. 170-187
  
• Ewa Grabska:
  Graphs and Designing. 188-202
  
• Dirk Janssens:
  ESM Systems and the Composition of Their Computations. 203-217
  
• Yasuo Kawahara, Yoshihiro Mizoguchi:
  Relational Structures and Their Partial Morphisms in View of Single Pushout Rewriting. 218-233
  
• Martin Korff:
  Single Pushout Transformation of Equationally Defined Graph Structures with Applications to Actor Systems. 234-264
  
• Andrea Maggiolo-Schettini, Adriano Peron:
  Semantics of Full Statecharts Based on Graph Rewriting. 265-279
  
• Ugo Montanari, Francesca Rossi:
  Contextual Occurence Nets and Concurrent Constraint Programming. 280-295
  
• Manfred Nagl:
  Uniform-Modelling in Graph Grammar Specifications. 296-311
  
• Jean-Claude Raoult, Frédéric Voisin:
  Set-Theoretic Graph Rewriting. 312-325
  
• Georg Schied:
  On Relating Rewriting Systems and Graph Grammars to Event Structures. 326-340
  
• Andy Schürr:
  Logic Based Structure Rewriting Systems. 341-357
  
• Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer:
  Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for Graphs. 358-379
  
• Gabriele Taentzer, Martin Beyer:
  Amalgamated Graph Transformations and Their Use for Specifying AGG - an Algebraic Graph Grammar System. 380-394
  

Last update Mon Feb 13 04:23:04 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page