Compositionality of Rewriting Rules with Conditions

04/19/2019
by   Nicolas Behr, et al.
0

We extend the notion of compositional associative rewriting as recently studied in the rule algebra framework literature to the setting of rewriting rules with conditions. Our methodology is category-theoretical in nature, where the definition of rule composition operations is encoding the non-deterministic sequential concurrent application of rules in Double-Pushout (DPO) and Sesqui-Pushout (SqPO) rewriting with application conditions based upon M-adhesive categories. We uncover an intricate interplay between the category-theoretical concepts of conditions on rules and morphisms, the compositionality and compatibility of certain shift and transport constructions for conditions, and thirdly the property of associativity of the composition of rules without conditions.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/05/2021

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Double-pushout rewriting is an established categorical approach to the r...
07/02/2018

Rule Algebras for Adhesive Categories

We show that every adhesive category gives rise to an associative algebr...
04/29/2019

Tracelets and Tracelet Analysis Of Compositional Rewriting Systems

Taking advantage of a recently discovered associativity property of rule...
05/06/2021

Concurrency Theorems for Non-linear Rewriting Theories

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

Linear algorithm for solution n-Queens Completion problem

A linear algorithm is described for solving the n-Queens Completion prob...
12/05/2019

Linear algorithm for solutions n-Queens Completion problem

A linear algorithm is described for solving the n-Queens Completion prob...
05/22/2021

Homotopies in Multiway (Non-Deterministic) Rewriting Systems as n-Fold Categories

We investigate the algebraic and compositional properties of multiway (n...