Graph Rewriting and Relabeling with PBPO+ (Extended Version) release_y6ycrfwvive2xaclphaidfi45y

by Roy Overbeek, Jörg Endrullis

Released as a article .

2020  

Abstract

We extend the powerful Pullback-Pushout (PBPO) approach for graph rewriting with strong matching. Our approach, called PBPO+, exerts more control over the embedding of the pattern in the host graph, which is important for a large class of graph rewrite systems. We show that PBPO+ is well-suited for rewriting labeled graphs and certain classes of attributed graphs. For this purpose, we employ a lattice structure on the label set and use graph morphisms that respect the partial order on the labels. We argue that our approach is both simpler and more general than related approaches in the literature. Finally, we demonstrate that PBPO+ allows for an elegant modeling of linear term rewriting systems, such as string rewriting systems. This modeling preserves termination as a global system property without having to restrict the shape of the graphs.
In text/plain format

Archived Content

There are no accessible files associated with this release. You could check other releases for this work for an accessible version.

"Dark" Preservation Only
Save Paper Now!

Know of a fulltext copy of on the public web? Submit a URL and we will archive it

Type  article
Stage   submitted
Date   2020-10-16
Version   v1
Language   en ?
arXiv  2010.08230v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 05de923a-9275-464a-9d37-0c35bc8df411
API URL: JSON