Graph Rewriting in Span-Categories
From MaRDI portal
Publication:4931317
DOI10.1007/978-3-642-15928-2_15zbMath1306.68081OpenAlexW1481448186WikidataQ63406195 ScholiaQ63406195MaRDI QIDQ4931317
Publication date: 4 October 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15928-2_15
Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Graphs, diagram schemes, precategories (18A10)
Related Items
Sesqui-Pushout Rewriting with Type Refinements, Deduction as reduction, from a categorical point of view, Polymorphic Sesqui-Pushout Graph Rewriting, AGREE – Algebraic Graph Rewriting with Controlled Embedding, Strategic port graph rewriting: an interactive modelling framework, Knowledge representation and update in hierarchies of graphs, Finitary -adhesive categories, Algebraic graph rewriting with controlled embedding, On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems, Single pushout rewriting in comprehensive systems of graph-like structures, Partial pullback complement rewriting along admissible matches, Model Transformation and Induced Instance Migration: A Universal Framework, Partial pullback complement rewriting
