Properties of graphs preserved by relational graph rewritings

Information sciences

Volumn 119, Issue 3, 1999, Pages 289-299

  Mizoguchi, Yoshihiro ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; THEOREM PROVING;

RAOULT GRAPHS; RELATIONAL GRAPH REWRITINGS;

GRAPH THEORY;

EID: 0033357678     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00019-5     Document Type: Article

References (14)

1. H. Ehrig, M. Korff, M. Löwe, Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts, in: LNCS, vol. 532, 1990, pp. 24-37.
2. Kawahara Y. Pushout-complements and basic concepts of grammars in toposes. Theoretical Computer Science. 77:1990;267-289.
3. Y. Kawahara, Y. Mizoguchi, Relational structures and their partial morphisms in view of single pushout rewriting, in: LNCS, vol. 776, 1994, pp. 218-233.
4. Kennaway R. On graph rewritings. Theoretical Computer Science. 52:1987;37-58.
5. R. Kennaway, Graph rewriting in some categories of partial morphisms, in: LNCS, vol. 532, 1990, pp. 490-504.
6. D.E. Knuth, P. Bendix, Simple word problems in universal algebras, in: J. Leech (Ed.), Computational Problems in Abstract Algebras, Pergamon Press, Oxford, 1970.
7. M. Löwe, Extended algebraic graph transformation, Ph.D. Thesis, Technical University of Berlin, 1991.
8. M. Löwe, H. Ehrig, Algebraic approach to graph transformation based on single pushout derivations, in: LNCS, vol. 484, 1990, pp. 338-353.
9. M. Löwe, J. Müller, Critical pair analysis in single-pushout graph rewriting, Workshop on Graph Transformation on Mallorca, March 1993.
10. Mizoguchi Y. A graph structure over the category of sets and partial functions. Cahiers de topologie et géométrie différentielle catégoriques. 34:1993;2-12.
11. Mizoguchi Y., Kawahara Y. Relational graph rewritings. Theoretical Computer Science. 141:1995;311-328.
12. Y. Okada, M. Hayashi, Graph rewriting systems and their application to network reliability analysis, in: LNCS, vol. 570, pp. 36-47.
13. D. Plump, Hypergraph Rewriting: Critical Pairs and Undecidability of Confluence, Term Graph Rewriting: Theory and Practice, Wiley, New York, 1993.
14. Raoult J.C. On graph rewritings. Theoretical Computer Science. 32:1984;1-24.