A framework for pathologies of message sequence charts
نویسندگان
چکیده
Context: It is known that a Message Sequence Chart (MSC) specification can contain different types of pathology. However, definitions of different types of pathology and the problems caused by pathologies are unclear, let alone the relationships between them. In this circumstance, it can be problematic for software engineers to accurately predict the possible problems that may exist in implementations of MSC specifications and to trace back to the design problems in MSC specifications from the observed problems of an implementation. Objective: We focus on generating a clearer view on MSC pathologies and building formal relationships between pathologies and the problems that they may cause. Method: By concentrating on the problems caused by pathologies, a categorisation of problems that a distributed system may suffer is first introduced. We investigate the different types of problems and map them to a categories of pathologies. Thus, existing concepts related to pathology are refined and necessary concepts in the pathology framework are identified. Finally, we formally prove the relationships between the concepts in the framework. Results: A pathology framework is established as desired based on a restriction that considers problematic scenarios with a single undesirable event. In this framework, we define disjoint categories of both pathologies and the problems caused; the identified types of pathology are successfully mapped to the problems that they may cause. Conclusion: The framework achieved in this paper introduces taxonomies into and clarifies relationships between concepts in research on MSC pathologies. The taxonomies and relationships in the framework can help software engineers to predict problems and verify MSC specifications. The single undesirable event restriction not only enables a categorisation of pathological scenarios, but also has the potential practical benefit that a software engineer can concentrate on key problematic scenarios. This may make it easier to either remove pathologies from an MSC specificationM or test an implementation developed fromM for potential problems resulting from such pathologies.
منابع مشابه
Extending Compositional Message Sequence Graphs
We extend the formal developments for message sequence charts (MSCs) to support scenarios with lost and found messages. We define a notion of extended compositional message sequence charts (ECMSCs) which subsumes the notion of compositional message sequence charts in expressive power but additionally allows to define lost and found messages explicitly. As usual, ECMSCs might be combined by mean...
متن کاملAutomata and logics for message sequence charts
A message-passing automaton is an abstract model for the implementation of a distributed system whose components communicate via message exchange and thereby define a collection of communication scenarios called message sequence charts. In this thesis, we study several variants of message-passing automata in a unifying framework. We classify their expressiveness in terms of state-space properti...
متن کاملModeling with Stochastic Message Sequence Charts
Message Sequence Chart (MSC) is a formal language widely used in industry for requirement specifications. In this paper, we propose a stochastic extension to MSC and this extend version of the MSC language is called Stochastic Message Sequence Charts (SMSC). Compared with MSC, SMSC is suitable for performance modeling and analysis. We integrated the SMSC language into the Möbius framework, whic...
متن کاملAn algebraic semantics of Message Sequence Charts
Message Sequence Charts is a graphical and textual language for the description and speciication of the interactions between system components and their environment. The language is standardized by the ITU-TS (the Telecommunication Standardization section of the International Telecommunication Union, the former CCITT). The main area of application for Message Sequence Charts is as an overview s...
متن کاملAutomata and Logics for Timed Message Sequence Charts
We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which communicate by exchanging messages through channels and use event clocks to generate collections of timed message sequence charts (T-MSCs). As a specification language, we propose a monadic secondorder logic equipped with timin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Information & Software Technology
دوره 54 شماره
صفحات -
تاریخ انتشار 2012