Rewriting Fuzzy Graphs
Masao Mori, 雅生 森, Yasuo Kawahara, 康雄 河原 · Kyushu University Institutional Repository (QIR) (Kyushu University) · 1997
. This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a rigorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an "-matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy graphs are analyzed for pullback rewritings. 1. Introduction Since the late sixties the algebraic theory of graph grammar, motivated from the study of graph grammars, has been studied by many researchers, for example, Rosenfeld, Montanari, Courcelle, Schneider, Ehrig and Kreowski. Since then the idea to transform graphs with socalled double pushout derivations has been applied to various fields [3, 6, 7, 8] of computer science. In 1984 Raoult [16] proposed another idea for graph transformations, so-called single pushout rewritings [13, 2], making use of a notion of partial morphisms of term g...