A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

05/05/2021
by   Jens Kosiol, et al.
0

Double-pushout rewriting is an established categorical approach to the rule-based transformation of graphs and graph-like objects. One of its standard results is the construction of concurrent rules and the Concurrency Theorem pertaining to it: The sequential application of two rules can equivalently be replaced by the application of a concurrent rule and vice versa. We extend and generalize this result by introducing generalized concurrent rules (GCRs). Their distinguishing property is that they allow identifying and preserving elements that are deleted by their first underlying rule and created by the second one. We position this new kind of composition of rules among the existing ones and obtain a Generalized Concurrency Theorem for it. We conduct our work in the same generic framework in which the Concurrency Theorem has been presented, namely double-pushout rewriting in M-adhesive categories via rules equipped with application conditions.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

04/19/2019

Compositionality of Rewriting Rules with Conditions

We extend the notion of compositional associative rewriting as recently ...
05/06/2021

Concurrency Theorems for Non-linear Rewriting Theories

Sesqui-pushout (SqPO) rewriting along non-linear rules and for monic mat...
02/06/2019

Semantics-Preserving DPO-Based Term Graph Rewriting

Term graph rewriting is important as "conceptual implementation" of the ...
07/08/2019

Parallelism Theorem and Derived Rules for Parallel Coherent Transformations

An Independent Parallelism Theorem is proven in the theory of adhesive H...
10/29/2019

Equipartitions with Wedges and Cones

A famous result about mass partitions is the so called Ham-Sandwich theo...
01/12/2022

Representing catalytic mechanisms with rule composition

Reaction mechanisms are often presented as sequences of elementary steps...
03/24/2020

Commutators for Stochastic Rewriting Systems: Theory and Implementation in Z3

In the semantics of stochastic rewriting systems (SRSs) based on rule al...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.