DeepAI AI Chat
Log In Sign Up

Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework

by   Nicolas Behr, et al.

Sesqui-pushout (SqPO) rewriting provides a variant of transformations of graph-like and other types of structures that fit into the framework of adhesive categories where deletion in unknown context may be implemented. We provide the first account of a concurrency theorem for this important type of rewriting, and we demonstrate the additional mathematical property of a form of associativity for these theories. Associativity may then be exploited to construct so-called rule algebras (of SqPO type), based upon which in particular a universal framework of continuous-time Markov chains for stochastic SqPO rewriting systems may be realized.


page 1

page 2

page 3

page 4


On Stochastic Rewriting and Combinatorics via Rule-Algebraic Methods

Building upon the rule-algebraic stochastic mechanics framework, we pres...

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...

J. B. S. Haldane's Rule of Succession

After Bayes, the oldest Bayesian account of enumerative induction is giv...

Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics

The Kappa biochemistry and the MØD organo-chemistry frameworks are among...

Algebraic models of simple type theories: a polynomial approach

We develop algebraic models of simple type theories, laying out a framew...

Revisiting the generalized Łoś-Tarski theorem

We present a new proof of the generalized Łoś-Tarski theorem (GLT(k)) in...

Generic Programming with Combinators and Objects

We present a generic programming framework for OCAML which makes it poss...