Graph rewriting in span-categories
DOI10.1007/978-3-642-15928-2_15zbMATH Open1306.68081DBLPconf/gg/Lowe10OpenAlexW1481448186WikidataQ63406195 ScholiaQ63406195MaRDI QIDQ4931317FDOQ4931317
Authors: Michael Löwe 
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
Recommendations
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)
Cited In (15)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- AGREE -- algebraic graph rewriting with controlled embedding
- Algebraic graph rewriting with controlled embedding
- Refined Graph Rewriting in Span-Categories
- Sesqui-pushout rewriting with type refinements
- Reversible sesqui-pushout rewriting
- Graph Transformation by Computational Category Theory
- Single pushout rewriting in comprehensive systems of graph-like structures
- Partial pullback complement rewriting along admissible matches
- Partial pullback complement rewriting
- Strategic port graph rewriting: an interactive modelling framework
- Finitary \(\mathcal{M}\)-adhesive categories
- Deduction as reduction, from a categorical point of view
- Polymorphic sesqui-pushout graph rewriting
- Model transformation and induced instance migration: a universal framework
This page was built for publication: Graph rewriting in span-categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931317)
