{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:40:03Z","timestamp":1767339603987,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Sequential model synchronisation is the task of propagating changes from one\nmodel to another correlated one to restore consistency. It is challenging to\nperform this propagation in a least-changing way that avoids unnecessary\ndeletions (which might cause information loss). From a theoretical point of\nview, so-called short-cut (SC) rules have been developed that enable provably\ncorrect propagation of changes while avoiding information loss. However, to be\nable to react to every possible change, an infinite set of such rules might be\nnecessary. Practically, only small sets of pre-computed basic SC rules have\nbeen used, severely restricting the kind of changes that can be propagated\nwithout loss of information. In this work, we close that gap by developing an\napproach to compute more complex required SC rules on-the-fly during\nsynchronisation. These higher-order SC rules allow us to cope with more complex\nscenarios when multiple changes must be handled in one step. We implemented our\napproach in the model transformation tool eMoflon. An evaluation shows that the\noverhead of computing higher-order SC rules on-the-fly is tolerable and at\ntimes even improves the overall performance. Above that, completely new\nscenarios can be dealt with without the loss of information.<\/jats:p>","DOI":"10.46298\/lmcs-20(3:25)2024","type":"journal-article","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T19:10:06Z","timestamp":1726773006000},"source":"Crossref","is-referenced-by-count":1,"title":["Advanced Model Consistency Restoration with Higher-Order Short-Cut Rules"],"prefix":"10.46298","volume":"Volume 20, Issue 3","author":[{"given":"Lars","family":"Fritsche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Kosiol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Lauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"M\u00f6ller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Sch\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2024,9,18]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/14305\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/14305\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T19:10:07Z","timestamp":1726773007000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/12703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,18]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(3:25)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2312.09828v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2312.09828v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2312.09828","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2312.09828","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,9,18]]},"article-number":"12703"}}