<テクニカルレポート>
Relational Graph Rewritings

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 Relational Graph Rewritings: This note presents a new formalization of graph rewritings which generalizes traditional graph rewritings. Relational notions of graphs and their rewritings are introduced... and several properties about graph rewritings are discussed using relational calculus (theory of binary relations). Single pushout approaches to graph rewritings proposed by Raoult and Kennaway are compared with our rewritings of relational (labeled) graph. Moreover a more general sufficient condition for two rewritings to commute and a theorem concerning critical pairs useful to demonstrate the confluency of graph rewriting systems are also given.
Graph Rewritings without Gluing Conditions: This note presents a new formalization of graph rewritings which generalizes Ehrig's graph derivations and Raoult's graph rewritings. The graph rewritings, based on a primitive pushout construction in the category of graphs and partial functions preserving graph structures, can be alivays applied without gluing colditions only if a graph has a matching to a given rewriting rule. A more general suffincient condition for two rewritings to commute is also proved. The simplicity of our discussion cornes from the usage of relational calculus (theory of binary relations).
続きを見る

本文情報を非表示

42.ps.tar pdf 215 KB 81 Relational Graph Rewritings
42.ps tgz 104 KB 6 Relational Graph Rewritings
rifis-tr-42 pdf 1.26 MB 73 Graph Rewritings without Gluing Conditions

詳細

レコードID
査読有無
関連情報
注記
タイプ
登録日 2009.04.22
更新日 2017.01.20