Compositional message sequence charts

Gunter, Elsa L.; Muscholl, Anca; Peled, Doron

doi:10.1007/s10009-002-0085-2

Cited by 32 publications

(34 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is important from the point of view of using such a formalism to capture system requirements at a reasonably intuitive level. An alternative approach, suggested in [6], is to label HMSC nodes with compositional MSCs that may have unmatched sends and receives. A single send or receive action is a trivial example of a compositional MSC.…”

Section: Discussionmentioning

confidence: 99%

“…However, there exist regular MSC languages that are not finitely generated [6,9]. Every finitely generated regular MSC language can be represented as a locally synchronized HMSC [8].…”

Section: Finitely Generated Msc Languagesmentioning

confidence: 99%

“…But there are natural regular MSC languages, such as the set of scenarios corresponding to the alternating bit protocol, that are not finitely generated [6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Netcharts: Bridging the Gap between HMSCs and Executable Specifications

Mukund

Kumar

Thiagarajan

2003

CONCUR 2003 - Concurrency Theory

View full text Add to dashboard Cite

Abstract. We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. (i) Netcharts admit a natural and direct translation into communicating finite-state machines, unlike HMSCs, for which the realization problem is nontrivial. (ii) Netcharts can describe all regular MSC languages (sets of MSCs in which channel capacities have a finite upper bound), unlike HMSCs, which can only describe finitely-generated regular MSC languages.

show abstract

Section: Discussionmentioning

confidence: 99%

“…However, there exist regular MSC languages that are not finitely generated [6,9]. Every finitely generated regular MSC language can be represented as a locally synchronized HMSC [8].…”

Section: Finitely Generated Msc Languagesmentioning

confidence: 99%

See 1 more Smart Citation

Netcharts: Bridging the Gap between HMSCs and Executable Specifications

Mukund

Kumar

Thiagarajan

2003

CONCUR 2003 - Concurrency Theory

View full text Add to dashboard Cite

show abstract

“…For describing sets of behaviors, we use MSC-graphs, which are the basic fragment of the High-level MSCs of the norm [14] (the norm allows hierarchy that we do not take into account here) that are just transition systems with nodes labeled by MSCs. They were extended to Compositional MSC-graphs (CMSC-graphs), where nodes are labeled by CMSCs [10]. …”

Section: An Msc Is a Cmsc Where The Message Function M Is A Total Funmentioning

confidence: 99%

“…CMSC-graphs are more expressive than CFMs [10], and thus most non trivial problems for CMSC-graphs are undecidable. The solution applied here to recover decidability is to consider representative linearizations, as what was done first for MSC-graphs by [20] and for CMSC-graphs by [18].…”

Section: Existential Bound On Channelsmentioning

confidence: 99%

Compositional Message Sequence Charts (CMSCs) Are Better to Implement Than MSCs

Genest

2005

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. Communicating Finite States Machines (CFMs) and Message Sequence Graphs (MSC-graphs for short) are two popular specification formalisms for communicating systems. MSC-graphs capture requirements (scenarios), hence they are the starting point of the design process. Implementing an MSC-graph means obtaining an equivalent deadlock-free CFM, since CFMs correspond to distributed messagepassing algorithms. Several partial answers for the implementation have been proposed. E.g., local-choice MSC-graphs form a subclass of deadlockfree CFM: Testing equivalence with some local-choice MSC-graph is thus a partial answer to the implementation problem. Using Compositional MSCs, we propose a new algorithm which captures more implementable models than with MSCs. Furthermore, the size of the implementation is reduced by one exponential.

show abstract