Concurrency Theorems for Non-linear Rewriting Theories

by   Nicolas Behr, et al.

Sesqui-pushout (SqPO) rewriting along non-linear rules and for monic matches is well-known to permit the modeling of fusing and cloning of vertices and edges, yet to date, no construction of a suitable concurrency theorem was available. The lack of such a theorem, in turn, rendered compositional reasoning for such rewriting systems largely infeasible. We develop in this paper a suitable concurrency theorem for non-linear SqPO-rewriting in categories that are quasi-topoi (subsuming the example of adhesive categories) and with matches required to be regular monomorphisms of the given category. Our construction reveals an interesting "backpropagation effect" in computing rule compositions. We derive in addition a concurrency theorem for non-linear double pushout (DPO) rewriting in rm-adhesive categories. Our results open non-linear SqPO and DPO semantics to the rich static analysis techniques available from concurrency, rule algebra and tracelet theory.


page 1

page 2

page 3

page 4


A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

Double-pushout rewriting is an established categorical approach to the r...

Compositionality of Rewriting Rules with Conditions

We extend the notion of compositional associative rewriting as recently ...

Rule Algebras for Adhesive Categories

We show that every adhesive category gives rise to an associative algebr...

A Variety Theorem for Relational Universal Algebra

We develop an analogue of universal algebra in which generating symbols ...

Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics (Long version)

The Kappa biochemistry and the MØD organic chemistry frameworks are amon...

General non-linear Bellman equations

We consider a general class of non-linear Bellman equations. These open ...

Revisit the Fundamental Theorem of Linear Algebra

This survey is meant to provide an introduction to the fundamental theor...