Chapter

Software Language Engineering

Volume 7745 of the series Lecture Notes in Computer Science pp 164-183

Guided Merging of Sequence Diagrams

  • Magdalena WidlAffiliated withLancaster UniversityInstitute of Information Systems, Vienna University of Technology
  • , Armin BiereAffiliated withCarnegie Mellon UniversityInstitute for Formal Models and Verification, Johannes Kepler University
  • , Petra BroschAffiliated withLancaster UniversityBusiness Informatics Group, Vienna University of Technology
  • , Uwe EglyAffiliated withLancaster UniversityInstitute of Information Systems, Vienna University of Technology
  • , Marijn HeuleAffiliated withCarnegie Mellon UniversityDepartment of Computer Science, University of Texas
  • , Gerti KappelAffiliated withLancaster UniversityBusiness Informatics Group, Vienna University of Technology
  • , Martina SeidlAffiliated withCarnegie Mellon UniversityInstitute for Formal Models and Verification, Johannes Kepler University
  • , Hans TompitsAffiliated withLancaster UniversityInstitute of Information Systems, Vienna University of Technology

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The employment of optimistic model versioning systems allows multiple developers of a team to work independently on their local copies of a software model. The merging process towards one consolidated version can be error-prone and time-consuming when performed without any tool support. Recently, several sophisticated approaches for model merging have been presented. However, even for multi-view modeling languages like UML, which distribute the information on the modeled system over different views, these views are merged independently of each other. Hence, inconsistencies are likely to be introduced into the merged model. We suggest to solve this problem by exploiting information stored in one view as constraint for the computation of a consolidated version of another view. More specifically, we demonstrate how state machines can guide the integration of parallel changes performed on a sequence diagram. We give a concise formal description of this problem and suggest a translation to the satisfiability problem of propositional logic.