Open AccessProceedings Article
Safe Implementability of Regular Message Sequence Chart Specifications.
Nicolas Baudru,Rémi Morin +1 more
- 01 Jan 2003
pp 210-217
28
TL;DR: An algorithm to check safe implementability of MSC specifications in the framework of non-FIFO channels is presented and turns out to have the same complexity bounds as the restrictive approach of Alur et al.
read more
Abstract: Message Sequence Charts (MSCs) are drawn by software designers in order to model the typical behaviors of some communication protocol at an early stage of its design. The important question of whether some given set of scenarios is realizable by some message passing system has already been investigated in different ways. We consider here deadlock-free implementations up to additional message contents. We present an algorithm to check safe implementability of MSC specifications in the framework of non-FIFO channels. Our criterion turns out to have the same complexity bounds as the restrictive approach of Alur et al. [1] where no additional message content is allowed.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Automatic synthesis of distributed transition systems
Alin Stefanescu
- 01 Jan 2006
TL;DR: By using several heuristics to overcome the classical state space explosion, this thesis is able to automatically generate small distributed algorithms for problems such as mutual exclusion.
31
Realizability of Collaboration-based Service Specifications
Humberto Nicolás Castejón,Rolv Bræk,G. von Bochmann +2 more
- 04 Dec 2007
TL;DR: It is shown that given some conditions, some problems can already be detected at an abstract collaboration level, without needing to look into detailed interactions, in terms of realizability.
28
Automata and Logics for Message Sequence Charts
Benedikt Bollig
- 01 Jan 2005
TL;DR: It turns out that message-passing automata cannot be complemented and that they cannot be determinized in general, so finite-state devices with global acceptance condition that communicate via a priori unbounded channels are shown to be strictly weaker than full monadic second-order logic.
19
On the realizability of collaborative services
TL;DR: This paper considers compositional specifications of services using UML 2 collaborations, activity and interaction diagrams, and addresses the realizability problem for such specifications: given a global specification, can the authors construct a set of communicating system components whose joint behavior is precisely the specified global behavior?
17
Compositional message sequence charts (CMSCs) are better to implement than MSCs
Blaise Genest
- 04 Apr 2005
TL;DR: This work proposes a new algorithm which captures more implementable models than with MSCs, and the size of the implementation is reduced by one exponential.
References
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Distributed snapshots: determining global states of distributed systems
K. Mani Chandy,Leslie Lamport +1 more
TL;DR: An algorithm by which a process in a distributed system determines a global state of the system during a computation, which helps to solve an important class of problems: stable property detection.
Inference of message sequence charts
Rajeev Alur,Kousha Etessami,Mihalis Yannakakis +2 more
- 01 Jun 2000
TL;DR: A formal framework within which one can derive implied MSCs is described, and polynomial-time algorithms for implication, realizability, and synthesis are provided.
325
Inference of message sequence charts
TL;DR: This paper first describes the formal framework within which one can derive implied MSCs and then provides polynomial-time algorithms for implication, realizability, and synthesis.
219
Realizability and verification of MSC graphs
Rajeev Alur,Kousha Etessami,Mihalis Yannakakis +2 more
- 15 Feb 2005
TL;DR: It is established that for bounded MSC-graphs, weak realizability is, surprisingly, undecidable, while safe realizable is in EXPSPACE.
Related Papers (5)
Rajeev Alur,Kousha Etessami,Mihalis Yannakakis +2 more
- 15 Feb 2005
[...]
Volker Diekert,Grzegorz Rozenberg +1 more
- 07 Mar 1995
Rajeev Alur,Gerard J. Holzmann,Doron Peled +2 more
- 27 Mar 1996