Products of Message Sequence Charts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Products of Message Sequence Charts

Abstract

An effective way to assemble partial views of a distributed system is to compute their product. Given two languages of message sequence charts generated by message sequence graphs, we address the problem of computing a message sequence graph that generates their product. Since all MSCs generated by a message sequence graph may be run within fixed bounds on the message channels, a subproblem is to decide whether the considered product is existentially bounded. We show that this question is undecidable but turns decidable in the restricted case where all shared events belong to the same process. For this case, we propose sufficient conditions under which a message sequence graph representing the product can be constructed.
Fichier principal
Vignette du fichier
RR-6258.pdf (405.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00156035 , version 1 (30-07-2007)
inria-00156035 , version 2 (30-07-2007)
inria-00156035 , version 3 (21-09-2007)

Identifiers

  • HAL Id : inria-00156035 , version 3

Cite

Philippe Darondeau, Blaise Genest, Loïc Hélouët. Products of Message Sequence Charts. [Research Report] RR-6258, INRIA. 2007, pp.27. ⟨inria-00156035v3⟩
266 View
189 Download

Share

Gmail Facebook X LinkedIn More