Relational graph rewritings

Yoshihiro Mizoguchi, Yasuo Kawahara

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)311-328
Number of pages18
JournalTheoretical Computer Science
Volume141
Issue number1-2
DOIs
Publication statusPublished - Apr 17 1995
Externally publishedYes

Fingerprint

Graph Rewriting
Rewriting
Rewriting Systems
Binary relation
Commute
Graph in graph theory
Formalization
Calculus
Generalise
Sufficient Conditions
Theorem
Demonstrate

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Relational graph rewritings. / Mizoguchi, Yoshihiro; Kawahara, Yasuo.

In: Theoretical Computer Science, Vol. 141, No. 1-2, 17.04.1995, p. 311-328.

Research output: Contribution to journalArticle

Mizoguchi, Yoshihiro ; Kawahara, Yasuo. / Relational graph rewritings. In: Theoretical Computer Science. 1995 ; Vol. 141, No. 1-2. pp. 311-328.
@article{16d37f9b31594321aa655f8e00820cf4,
title = "Relational graph rewritings",
abstract = "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.",
author = "Yoshihiro Mizoguchi and Yasuo Kawahara",
year = "1995",
month = "4",
day = "17",
doi = "10.1016/0304-3975(94)00076-U",
language = "English",
volume = "141",
pages = "311--328",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Relational graph rewritings

AU - Mizoguchi, Yoshihiro

AU - Kawahara, Yasuo

PY - 1995/4/17

Y1 - 1995/4/17

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029289982&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029289982&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(94)00076-U

DO - 10.1016/0304-3975(94)00076-U

M3 - Article

AN - SCOPUS:0029289982

VL - 141

SP - 311

EP - 328

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -