Universität Bremen  
  FB 3  
  AG BKB > Publikationen > Suche > Deutsch
English
 

Suche nach Veröffentlichungen - Detailansicht

 
Art der Veröffentlichung: Artikel
Autor: Hoffmann, Berthold
Titel: Graph Rewriting with Contextual Refinement
Band: 61
Seite(n): 20 pages
Zeitschrift: Electr. Comm. of the EASST
Erscheinungsjahr: 2013
Abstract / Kurzbeschreibung: In the standard theory of graph transformation, a rule modifies only subgraphs of constant size and fixed shape. The rules supported by the graph-rewriting tool GrGen are far more expressive: they may modify subgraphs of unbounded size and variable shape. Therefore properties like termination and confluence cannot be analyzed as for the standard case. In order to lift such results, we formalize the outstanding feature of GrGen rules by using plain rules on two levels: schemata are rules with variables; they are refined with meta-rules, which are based on contextual hyperedge replacement, before they are used for rewriting.

We show that every rule based on single pushouts, on neighborhood-controlled embedding, or on variable substitution can be modeled by a schema with appropriate meta-rules. It turns out that the question whether schemata may have overlapping refinements is not decidable.
ISSN: ISSN 1863-2122
Internet: http://journal.ub.tu-berlin.de/eceasst/article/view/828
PDF Version: http://www.informatik.uni-bremen.de/~hof/papers/gcm12EASST.pdf
Schlagworte: graph transformation, refinement
Status: Reviewed
Letzte Aktualisierung: 13. 08. 2013

 Zurück zum Suchergebnis
 
   
Autor: Automatisch generierte Seite
 
  AG BKB 
Zuletzt geändert am: 9. Mai 2023   impressum