DeepAI AI Chat
Log In Sign Up

Rule Algebras for Adhesive Categories

by   Nicolas Behr, et al.

We show that every adhesive category gives rise to an associative algebra of rewriting rules induced by the notion of double-pushout (DPO) rewriting and the associated notion of concurrent production. In contrast to the original formulation of rule algebras in terms of relations between (a concrete notion of) graphs, here we work in an abstract categorical setting. Doing this, we extend the classical concurrency theorem of DPO rewriting and show that the composition of DPO rules along abstract dependency relations is, in a natural sense, an associative operation. If in addition the adhesive category possesses a strict initial object, the resulting rule algebra is also unital. We demonstrate that in this setting the canonical representation of the rule algebras is obtainable, which opens the possibility of applying the concept to define and compute the evolution of statistical moments of observables in stochastic DPO rewriting systems.


page 1

page 2

page 3

page 4


Compositionality of Rewriting Rules with Conditions

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

Relating Apartness and Bisimulation

A bisimulation for a coalgebra of a functor on the category of sets can ...

Toward an Algebraic Theory of Systems

We propose the concept of a system algebra with a parallel composition o...

A Generalized Concurrent Rule Construction for Double-Pushout Rewriting

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

A canonical algebra of open transition systems

Feedback and state are closely interrelated concepts. Categories with fe...

Space-time tradeoffs of lenses and optics via higher category theory

Optics and lenses are abstract categorical gadgets that model systems wi...

Concurrency Theorems for Non-linear Rewriting Theories

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