Results 1 
3 of
3
Model checking of message sequence charts
, 1999
"... Scenariobased specifications such as message sequence charts (MSC) or an intuitive and visual way of describing design requirements. Such specifications focus on message exchanges among communicating entities in distributed software systems. Structured specifications such as MSCgraphs and Hierarch ..."
Abstract

Cited by 149 (6 self)
 Add to MetaCart
Scenariobased specifications such as message sequence charts (MSC) or an intuitive and visual way of describing design requirements. Such specifications focus on message exchanges among communicating entities in distributed software systems. Structured specifications such as MSCgraphs and Hierarchical MSCgraphs (HMSC) allow convenient expression of multiple scenarios, and can be viewed as an early model of the system. In this paper, we present a comprehensive study of the problem of verifying whether this model satisfies a temporal requirement given by an automaton, by developing algorithms for the different cases along with matching lower bounds. When the model is given as an MSC, model checking can be done by constructing a suitable automaton for the linearizations of the partial order specified by the MSC, and the problem is coNPcomplete. When the model is given by an MSCgraph, we consider two possible semantics depending on the synchronous or asynchronous interpretation of concatenating two MSCs. For synchronous model checking of MSCgraphs and HMSCs, we present algorithms whose time complexity is proportional to the product of the size of the description and the cost of processing MSCs at individual vertices. Under the asynchronous interpretation, we prove undecidability of the model checking problem. We, then, identify a natural requirement of boundedness, give algorithms to check boundedness, and establish asynchronous model checking to be Pspacecomplete for bounded MSCgraphs and Expspacecomplete for bounded HMSCs.
An Algebraic Semantics for Message Sequence Chart Documents
 Proceedings of FORTE/PSTV '98
, 1998
"... Message Sequence Charts (MSCs) are a graphical and textual language for the speci cation of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs by me ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
Message Sequence Charts (MSCs) are a graphical and textual language for the speci cation of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs by means of a process algebra. This semantics covers the complete language of single MSCs but lacks an interpretation for conditions which are used as continuation points of MSCs within an MSC document (a collection of MSCs). In this paper, we give a process algebraic semantics for basic MSCs including conditions, enabling the formal interpretation of entire MSC documents. 1
Ahierarchy of communication models for Message Sequence Charts
"... In a Message Sequence Chart (MSC) the dynamical behaviour of a number of cooperating entities is depicted. An MSC de nes a partial order on the communication events between these entities. This order determines the physical architecture needed for implementing the speci ed behaviour, such as a FIFO ..."
Abstract
 Add to MetaCart
(Show Context)
In a Message Sequence Chart (MSC) the dynamical behaviour of a number of cooperating entities is depicted. An MSC de nes a partial order on the communication events between these entities. This order determines the physical architecture needed for implementing the speci ed behaviour, such as a FIFO bu er between each of the entities. In a systematic way, we de ne 50 communication models for MSC and we de ne what it means for an MSC to be implementable by such a model. Some of these models turn out to be equivalent, in the sense that they implement the same class of MSCs. After analysing the notion of implementability, only ten classes remain, for which we develop a hierarchy. We also develop algorithms to check whether a given MSC