Concurrency theorems for non-linear rewriting theories

DOI10.1007/978-3-030-78946-6_1zbMath1489.68115arXiv2105.02842OpenAlexW3173342440MaRDI QIDQ2117255

Nicolas Behr, Russ Harmer, Jean Krivine

Publication date: 21 March 2022

Full work available at URL: https://arxiv.org/abs/2105.02842

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (8)

Fundamentals of compositional rewriting theory ⋮ Computational category-theoretic rewriting ⋮ Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes ⋮ Computational Category-Theoretic Rewriting ⋮ Termination of graph transformation systems using weighted subgraph counting ⋮ Fuzzy presheaves are quasitoposes ⋮ A living monograph for graph transformation ⋮ A generalized concurrent rule construction for double-pushout rewriting: generalized concurrency theorem and language-preserving rule applications

Uses Software

• AGREE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to delete categorically -- two pushout complement constructions
• Quasitopoi, logic and Heyting-valued models
• Exponentiable morphisms, partial products and pullback complements
• Restriction categories II: Partial map classification
• Fundamentals of algebraic graph transformation
• On the axioms for adhesive and quasiadhesive categories
• Polymorphic Sesqui-Pushout Graph Rewriting
• AGREE – Algebraic Graph Rewriting with Controlled Embedding
• Counting planar maps, coloured or uncoloured
• Reversible Sesqui-Pushout Rewriting
• Rule Algebras for Adhesive Categories
• Sesqui-Pushout Rewriting
• Quasitoposes, Quasiadhesive Categories and Artin Glueing
• Stochastic mechanics of graph rewriting
• Finitary $\mathcal{M}$ -Adhesive Categories
• Hereditary Pushouts Reconsidered
• Compositionality of Rewriting Rules with Conditions
• Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics
• Graph Transformations
• Foundations of Software Science and Computation Structures
• Adhesive and quasiadhesive categories
• -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
• Knowledge representation and update in hierarchies of graphs
• Restriction categories. I: Categories of partial maps

This page was built for publication: Concurrency theorems for non-linear rewriting theories