Constructing constraint-preserving interaction schemes in adhesive categories

DOI10.1007/978-3-030-23220-7_8zbMath1444.68086OpenAlexW2955911989MaRDI QIDQ2185892

Lars Fritsche, Nebras Nassar, Gabriele Taentzer, Andy Schürr, Jens Kosiol

Publication date: 8 June 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-23220-7_8

zbMATH Keywords

adhesive categoriesgraph constraintsalgebraic graph transformationcorrectness-by-constructioninteraction scheme

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)

Related Items (3)

Constructing constraint-preserving interaction schemes in adhesive categories ⋮ Graph Consistency as a Graduated Property ⋮ Constructing optimized constraint-preserving application conditions for model transformation rules

Uses Software

• OCL2AC

Cites Work

• Constructing constraint-preserving interaction schemes in adhesive categories
• Fundamentals of algebraic graph transformation
• Correctness of high-level transformation systems relative to nested conditions
• Graph Transformations
• Adhesive and quasiadhesive categories
• Finitary -adhesive categories
• Multi-amalgamation of rules with application conditions in -adhesive categories
• Specification of graph translators with triple graph grammars

This page was built for publication: Constructing constraint-preserving interaction schemes in adhesive categories