Skip to Main content Skip to Navigation
Reports

Products of Message Sequence Charts

Philippe Darondeau 1 Blaise Genest 2 Loïc Hélouët 2
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
2 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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.
Document type :
Reports
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00156035
Contributor : Loic Helouet <>
Submitted on : Friday, September 21, 2007 - 2:35:28 PM
Last modification on : Thursday, January 7, 2021 - 4:25:26 PM
Long-term archiving on: : Thursday, September 23, 2010 - 5:05:07 PM

File

RR-6258.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00156035, version 3

Citation

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

Share

Metrics

Record views

635

Files downloads

321