Realizability Criteria for Compositional MSC
Synthesizing a proper implementation for a scenario-based specification is often impossible, due to the distributed nature of implementations. To be able to detect problematic specifications, realizability criteria have been identified, such as non-local choice.
In this work we develop a formal framework to study realizability of compositional MSC [GMP03]. We use it to derive a complete classification of criteria that is closely related to the criteria for MSC from [MGR05]. Comparing specifications and implementations is usually complicated, because different formalisms are used. We treat both of them in terms of a single formalism. Therefore we extend the partial order semantics of [Pra86, KL98] with a way to model deadlocks and with a more sophisticated way to address communication.
KeywordsPartial Order Sequential Composition Parallel Composition Realizability Criterion Alternative Characterization
Unable to display preview. Download preview PDF.
- [BM95]Baeten, J.C.M., Mauw, S.: Delayed choice: an operator for joining Message Sequence Charts. In: Formal Description Techniques, pp. 340–354 (1995)Google Scholar
- [Hey00]Heymer, S.: A semantics for MSC based on Petri-Net components. In: Proceedings of SAM 2000: 2nd Workshop on SDL and MSC (2000)Google Scholar
- [HJ00]Hélouët, L., Jard, C.: Conditions for synthesis of communicating automata from HMSCs. In: Proceedings of 5th FMICS Workshop (2000)Google Scholar
- [KL98]Katoen, J.-P., Lambert, L.: Pomsets for Message Sequence Charts. In: Proceedings of SAM 1998: 1st Workshop on SDL and MSC (1998)Google Scholar
- [MRW06]Mooij, A.J., Romijn, J.M.T., Wesselink, J.W.: Realizability criteria for compositional MSC. Computer Science Report 06-11, Technische Universiteit Eindhoven (March 2006)Google Scholar
- [Ren99]Reniers, M.A.: Message Sequence Chart: Syntax and Semantics. PhD thesis, Technische Universiteit Eindhoven (June 1999)Google Scholar