Multilevel typed graph transformations

DOI10.1007/978-3-030-51372-6_10MaRDI QIDQ5100732zbMATHOpenAlexFDO

Authors Fernando Macías, Adrian Rutle, Uwe Wolter

Publication date 1 September 2022

Published in Graph Transformation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.14612

zbMATH Keywords

pushoutpullback complementmultilevel typed graph transformationtyping chain

Mathematics Subject Classification ID

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

Abstract: Multilevel modeling extends traditional modeling techniques with a potentially unlimited number of abstraction levels. Multilevel models can be formally represented by multilevel typed graphs whose manipulation and transformation are carried out by multilevel typed graph transformation rules. These rules are cospans of three graphs and two inclusion graph homomorphisms where the three graphs are multilevel typed over a common typing chain. In this paper, we show that typed graph transformations can be appropriately generalized to multilevel typed graph transformations improving preciseness, flexibility and reusability of transformation rules. We identify type compatibility conditions, for rules and their matches, formulated as equations and inequations, respectively, between composed partial typing morphisms. These conditions are crucial presuppositions for the application of a rule for a match---based on a pushout and a final pullback complement construction for the underlying graphs in the category Graph---to always provide a well-defined canonical result in the multilevel typed setting. Moreover, to formalize and analyze multilevel typing as well as to prove the necessary results, in a systematic way, we introduce the category Chain of typing chains and typing chain morphisms.

Recommendations

• scientific article; zbMATH DE number 969071
• Publication:4941931
• Graph Transformations
• Fundamental theory for typed attributed graphs and graph transformation based on adhesive HLR categories
• Fundamentals of algebraic graph transformation

Cites work

• scientific article; zbMATH DE number 5606347 (Why is no real title available?)
• scientific article; zbMATH DE number 2006476 (Why is no real title available?)
• A formal approach to the specification and transformation of constraints in MDE
• A formalisation of deep metamodelling
• ATL: A model transformation tool
• Fibred amalgamation, descent data, and Van Kampen squares in topoi
• Multi-level model product lines. Open and closed variability for modelling language families
• Multilevel coupled model transformations for precise and reusable definition of model behaviour
• Sesqui-Pushout Rewriting

Cited in

(7)

• Composition of multilevel domain-specific modelling languages
• A generalized concurrent rule construction for double-pushout rewriting
• Graph Transformations
• scientific article; zbMATH DE number 1512612 (Why is no real title available?)
• Transformation of typed composite graphs with inheritance and containment structures
• scientific article; zbMATH DE number 2016074 (Why is no real title available?)
• Language family engineering with product lines of multi-level models

Describes a project that uses

Uses Software

• ATL
• Melanee

This page was built for publication: Multilevel typed graph transformations

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