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.

[1]  Yoshihiro Mizoguchi,et al.  A graph structure over the category of sets and partial functions , 1992 .

[2]  Yasuo Kawahara,et al.  Relational Structures and Their Partial Morphisms in View of Single Pushout Rewriting , 1993, Dagstuhl Seminar on Graph Transformations in Computer Science.

[3]  H. Kreowski,et al.  Pushout-Properties: An analysis of gluing constructions for graphs , 1979 .

[4]  Bruno Courcelle,et al.  A representation of graphs by algebraic expressions and its use for graph rewriting systems , 1986, Graph-Grammars and Their Application to Computer Science.

[5]  Masahiro Hayashi,et al.  Graph Rewriting Systems and their Application to Network Reliability Analysis , 1991, WG.

[6]  Hartmut Ehrig,et al.  Parallelism and Concurrency of Graph Manipulations , 1980, Theor. Comput. Sci..

[7]  Edmund Robinson,et al.  Categories of Partial Maps , 1988, Inf. Comput..

[8]  R. Goldblatt.  Topoi, the Categorial Analysis of Logic , 1979 .

[9]  Yasuo Kawahara,et al.  Categorical Assertion Semantics in Toposes , 1993 .

[10]  Jean-Claude Raoult,et al.  On graph rewritings , 1984, Bull. EATCS.

[11]  Hartmut Ehrig,et al.  Tutorial Introduction to the Algebraic Approach of Graph Grammars Based on Double and Single Pushouts , 1990, Graph-Grammars and Their Application to Computer Science.

[12]  Yasuo Kawahara.  Pushout-Complements and Basic Concepts of Grammars in Toposes , 1990, Theor. Comput. Sci..

[13]  Richard Kennaway,et al.  Graph Rewriting in Some Categories of Partial Morphisms , 1990, Graph-Grammars and Their Application to Computer Science.

[14]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[15]  Hartmut Ehrig,et al.  Parallel and Distributed Derivations in the Single-Pushout Approach , 1993, Theor. Comput. Sci..

[16]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[17]  Hartmut Ehrig,et al.  Algebraic Approach to Graph Transformation Based on Single Pushout Derivations , 1991, WG.

[18]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1991, Theor. Comput. Sci..

[19]  Michael Löwe,et al.  Extended algebraic graph transformation , 1991 .