Compositionality of Rewriting Rules with Conditions
arXiv:1904.09322 · doi:10.32408/compositionality-3-2
Abstract
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 encodes the non-deterministic sequential concurrent application of rules in Double-Pushout (DPO) and Sesqui-Pushout (SqPO) rewriting with application conditions based upon -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.
64 pages
References in corpus (2)
Cited by in corpus (5)
- Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics
- Efficient Computation of Graph Overlaps for Rule Composition: Theory and Z3 Prototyping
- Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics (Long version)
- Stochastic Graph Transformation For Social Network Modeling
- Rule Algebras for Adhesive Categories