A re-post from Process Algebra Blog where Prof. Luca Aceto described this paper, that stems from discussions between Mattia D’Emidio (a researcher in algorithmics) and Ludovico Iovino (a researcher in software engineering) who were sharing a basement office at the Gran Sasso Science Institute at the time. Those exchanges of ideas led eventually to the development of a framework that uses classic shortest-path algorithms in the selection of optimal chains of model transformations in model-driven SE. More specifically, those colleagues of mine show how to reduce the problem of computing chains of model transformations
that maximize the coverage to a shortest-path problem on weighted graphs. More info at:

Shortest-path algorithms applied to software engineering: A tale of cross fertilization within CS