Partial pullback complement rewriting along admissible matches

DOI10.1016/j.tcs.2021.11.007zbMath1478.68114OpenAlexW3212896643MaRDI QIDQ2055979

L. Yeganeh, S. N. Hosseini

Publication date: 1 December 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.11.007

zbMATH Keywords

graph rewritinggraph transformationadhesive categoryextensive categorypartial morphismpullback complementadmissible morphismco-universal morphism

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Extensive, distributive, and adhesive categories (18B50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic approach to single-pushout graph transformation
• Exponentiable morphisms, partial products and pullback complements
• Sheaves in geometry and logic: a first introduction to topos theory
• Introduction to extensive and distributive categories
• Partial pullback complement rewriting
• Reversible Sesqui-Pushout Rewriting
• Sesqui-Pushout Rewriting
• Toposes Are Adhesive
• Graph Rewriting in Span-Categories
• Adhesive and quasiadhesive categories
• Double-pullback transitions and coalgebraic loose semantics for graph transformation systems