Modal Transition Systems (MTS) are an extension of Labelled Transition Systems\ud (LTS) that have been shown to be useful to reason about system behaviour in the\ud context of partial information. MTSs distinguish between required, proscribed\ud and unknown behaviour and come equipped with a notion of refinement that supports\ud incremental modelling where unknown behaviour is iteratively elaborated\ud into required or proscribed behaviour.\ud A particularly useful notion in the context of software and requirements engineering\ud is that of “merge”. Merging two consistent models is a process that should\ud result in a minimal common refinement of both models where consistency is defined\ud as the existence of one common refinement. One of the current limitations\ud of MTS merging is that a complete and correct algorithm for merging has not\ud been developed. Hence, an engineer attempting to merge partial descriptions may\ud be prevented to do so by overconstrained algorithms or algorithms that introduce\ud behaviour that does not follow from the partial descriptions being merged. In\ud this thesis we study the problems of consistency and merge for the existing MTSs\ud semantics - strong and weak semantics - and provide a complete characterization\ud of MTS consistency as well as a complete and correct algorithm for MTS merging\ud using these semantics.\ud Strong and weak semantics require MTS models to have the same communicating\ud alphabet, the latter allowing the use of a distinguished unobservable action. In\ud this work we show that the requirement of fixing the alphabet for MTS semantics\ud and the treatment of observable actions are limiting if MTSs are to support\ud incremental elaboration of partial behaviour models. We present a novel observational\ud semantics for MTS, branching alphabet semantics, inspired by branching\ud LTS equivalence, which supports the elaboration of model behaviour including\ud the extension of the alphabet of the system to describe behaviour aspects that\ud previously had not been taken into account. Furthermore, we show that some\ud unintuitive refinements allowed by weak semantics are avoided, and prove a number\ud of theorems that relate branching refinement with alphabet refinement and\ud consistency. These theorems, which do not hold for other semantics, support the\ud argument for considering branching alphabet as a sound semantics to support\ud behaviour model elaboration.Imperial Users onl
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.