Adhesive subcategories of functor categories with instantiation to partial triple graphs

DOI10.1007/978-3-030-23611-3_3MaRDI QIDQ2292967zbMATH OpenOpenAlexFDO

Authors Jens Kosiol, Lars Fritsche, Andy Schürr, Gabriele Taentzer

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-23611-3_3

zbMATH Keywords

adhesivenessdouble pushout rewritingfunctor categorytriple graphs

Mathematics Subject Classification ID

Functor categories, comma categories (18A25) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Grammars and rewriting systems (68Q42)

Recommendations

• Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
• Foundations of Software Science and Computation Structures
• Adhesivity with partial maps instead of spans
• Adhesive and quasiadhesive categories
• Categorical frameworks for graph transformation and HLR systems based on the DPO approach

Cited in

(7)

• Single pushout rewriting in comprehensive systems of graph-like structures
• Comprehensive systems: a formal foundation for multi-model consistency management
• A generalized concurrent rule construction for double-pushout rewriting
• Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
• Towards multiple model synchronization with comprehensive systems
• Single pushout rewriting in comprehensive systems
• A lattice-theoretical perspective on adhesive categories

This page was built for publication: Adhesive subcategories of functor categories with instantiation to partial triple graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292967)