Maximova, MariaEhrig, HartmutErmel, Claudia2020-06-112020-06-1120131436-9915https://depositonce.tu-berlin.de/handle/11303/11306http://dx.doi.org/10.14279/depositonce-10191Hypergraph transformation systems are examples ofM-adhesive transformation systems based on M-adhesive categories. For typed attributed graph transformation systems, the tool environment Agg allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper is to establish a formal relationship between the corresponding M- adhesive transformation systems, which allows us the translation of hypergraph transformations into typed attributed graph transformations with equivalent behavior, and, vice versa, the creation of hypergraph transformations from typed attributed graph transformations. This formal relationship is based on the general theory ofM-functors between differentM-adhesive transformation systems. We construct a functor between the M-adhesive categories of hypergraphs and of typed attributed graphs, and show that our construction yields an M-functor with suitable properties. We then use existing results for M-functors to show that analysis results for hypergraph transformation systems can be obtained using Agg by analysis of the translated typed attributed graph transformation system. This is shown in general and for a concrete example.en004 Datenverarbeitung; InformatikM-adhesive transformation systemgraph transformationhypergraph transformationM-adhesive categoryM-functorcritical pair analysisAGGResearch Paper