Abstract

This thesis addresses the validation and the refinement of MSC (Message Sequence Charts) specifications at the requirement and the design phases in a software development process. The validation is necessary to ensure that an MSC specification does not contain semantic errors. The refinement provides a systematic approach to develop MSC specifications. The focus of this thesis is on timed MSC specifications, which may contain absolute and relative time constraints for specifying quantified timing requirements. To provide a foundation for analysis of MSC specifications, we develop a formal semantics for timed MSCs based on labeled partially ordered sets (lposets). We equip an lposet with two timing functions for expressing absolute and relative time constraints. The semantics of an MSC is represented by a set of lposets. The set can be obtained compositionally from the semantics of constructs contained in the MSC. Time constraints in an MSC specification may lead to inconsistencies. In such a case, the specification contains semantic errors. We study the time consistency of MSC specifications. We define the time consistency and develop sufficient and necessary conditions for the consistency. According to these conditions, algorithms are designed for checking the consistency. We also study the time consistency of high level MSCs and identify a subset of high level MSCs such that their consistency can be checked efficiently. We propose a refinement approach where we refine not only behaviors, but also time constraints specified in an MSC specification. Refining time constraints makes constraints on a system stronger, and assumptions on the environment weaker. We define refinement relations and develop algorithms to check the satisfaction of these relations. To reduce the complexity in the case of high level MSCs, we constrain the refinement rules. At last, as an outcome of our investigation of timed MSCs, we propose a new time construct as an extension of timed MSC in order to specify more timing requirements. Most of the algorithms presented in this thesis have been implemented and integrated to our set of tools MSC2SDL.