Finding a Universal Execution Strategy for Model Transformation Networks

@InProceedings{GKB21,
  author    = {Joshua Gleitze and
               Heiko Klare and
               Erik Burger},
  editor    = {Esther Guerra and
               Mari{\"{e}}lle Stoelinga},
  title     = {Finding a Universal Execution Strategy for Model
               Transformation Networks},
  booktitle = {24th International Conference on Fundamental Approaches
               to Software Engineering ({FASE} 2021) held as part of
               {ETAPS} 2021: European Joint Conferences on Theory and
               Practice of Software},
  venue     = {Luxembourg City, Luxembourg},
  eventdate = {2021-03-27/2021-04-01},
  series    = {Lecture Notes in Computer Science},
  volume    = {12649},
  pages     = {87--107},
  publisher = {Springer},
  year      = {2021},
  abstract  = {When using multiple models to describe a (software)
               system, one can use a network of model transformations
               to keep the models consistent after changes. No strategy
               exists, however, to orchestrate the execution of
               transformations if the network has an arbitrary topology.
               In this paper, we analyse how often and in which order
               transformations need to be executed. We argue why linear
               execution bounds are too restrictive to be useful in
               practice and prove that there is no upper bound for the
               number of necessary executions. To avoid non-termination,
               we propose a conservative strategy that makes execution
               failures easier to understand. These insights help
               developers and users of transformation networks to
               understand under which circumstances their networks can
               terminate. Additionally, the proposed strategy helps
               them to find the cause when a network cannot restore
               consistency.}
  doi       = {10.1007/978-3-030-71500-7_5}
}