Single vs. Double pushout derivations of graphs

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Graph grammars in which the generation of graphs using productions and restricting derivation sequences based on the double pushout, recently introduced by H. Ehrig and the author and motivated by modular software design, are shown to have strictly more expressive power than those using derivations based on the single pushout approach of [12]. Furthermore, not being based on the internal structure of graphs, the approach can be immediately generalized to other formalisms, such as algebraic specifications, jungles, etc.

Cite

CITATION STYLE

APA

Parisi-Presicce, F. (1993). Single vs. Double pushout derivations of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 657 LNCS, pp. 248–262). Springer Verlag. https://doi.org/10.1007/3-540-56402-0_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free