Decomposition of Relations for Multi-model Consistency Preservation: Unterschied zwischen den Versionen
(Die Seite wurde neu angelegt: „{{Vortrag |vortragender=Aurélien Pepin |email=aurelien.pepin@student.kit.edu |vortragstyp=Masterarbeit |betreuer=Heiko Klare |termin=Institutsseminar/2019-11-…“) |
Keine Bearbeitungszusammenfassung |
||
| (Eine dazwischenliegende Version desselben Benutzers wird nicht angezeigt) | |||
| Zeile 5: | Zeile 5: | ||
|betreuer=Heiko Klare | |betreuer=Heiko Klare | ||
|termin=Institutsseminar/2019-11-29 | |termin=Institutsseminar/2019-11-29 | ||
|kurzfassung= | |kurzfassung=Consistency preservation between two metamodels can be achieved by defining a model transformation that repairs inconsistencies. In that case, there exists a consistency relation between metamodels. | ||
When there are multiple interrelated metamodels, consistency relations form a network. In multi-model consistency preservation, we are interested in methods to preserve consistency in a network of consistency relations. However, combinations of binary transformations can lead to specific interoperability issues. | |||
The purpose of this thesis is the decomposition of relations, an optimization | |||
technique for consistency relation networks. In this thesis, we design a decomposition procedure to detect independent and redundant subsets of consistency relations. The procedure aims to help developers find incompatibilities in consistency relation networks. | |||
}} | }} | ||
Aktuelle Version vom 21. November 2019, 12:01 Uhr
| Vortragende(r) | Aurélien Pepin | |
|---|---|---|
| Vortragstyp | Masterarbeit | |
| Betreuer(in) | Heiko Klare | |
| Termin | Fr 29. November 2019 | |
| Vortragsmodus | ||
| Kurzfassung | Consistency preservation between two metamodels can be achieved by defining a model transformation that repairs inconsistencies. In that case, there exists a consistency relation between metamodels.
When there are multiple interrelated metamodels, consistency relations form a network. In multi-model consistency preservation, we are interested in methods to preserve consistency in a network of consistency relations. However, combinations of binary transformations can lead to specific interoperability issues. The purpose of this thesis is the decomposition of relations, an optimization technique for consistency relation networks. In this thesis, we design a decomposition procedure to detect independent and redundant subsets of consistency relations. The procedure aims to help developers find incompatibilities in consistency relation networks. | |