Results 1  10
of
19
Inference of Message Sequence Charts
 Software Concepts and Tools
, 2003
"... Software designers draw Message Sequence Charts for early modeling of the individual behaviors they expect from the concurrent system under design. Can they be sure that precisely the behaviors they have described are realizable by some implementation of the components of the concurrent system? I ..."
Abstract

Cited by 189 (11 self)
 Add to MetaCart
Software designers draw Message Sequence Charts for early modeling of the individual behaviors they expect from the concurrent system under design. Can they be sure that precisely the behaviors they have described are realizable by some implementation of the components of the concurrent system? If so, can we automatically synthesize concurrent state machines realizing the given MSCs? If, on the other hand, other unspecified and possibly unwanted scenarios are # A preliminary version of this paper appears in Proceedings of 22nd International Conference on Software Engineering, pages 304313, 2000. A journal version will appear in IEEE Transactions in Software Engineering, but due to space limitations in the journal, this is the fuller version.
Synthesizing StateBased Object Systems from LSC Specifications
, 2000
"... Live sequence charts (LSCs) have been de ned recently as an extension of message sequence charts (MSCs � or their UML variant, sequence diagrams) for rich interobject speci cation. One of the main additions is the notion of universal charts and hot, mandatory behavior, which, among other things, en ..."
Abstract

Cited by 83 (23 self)
 Add to MetaCart
Live sequence charts (LSCs) have been de ned recently as an extension of message sequence charts (MSCs � or their UML variant, sequence diagrams) for rich interobject speci cation. One of the main additions is the notion of universal charts and hot, mandatory behavior, which, among other things, enables one to specify forbidden scenarios. LSCs are thus essentially as expressive as statecharts. This paper deals with synthesis, which is the problem of deciding, given an LSC speci cation, if there exists a satisfying object system and, if so, to synthesize one automatically. The synthesis problem is crucial in the development of complex systems, since sequence diagrams serve as the manifestation of use cases  whether used formally or informally  and if synthesizable they could lead directly to implementation. Synthesis is considerably harder for LSCs than for MSCs, and we tackle it by de ning consistency, showing that an entire LSC speci cation is consistent i it is satis able by a statebased object system, and then synthesizing a satisfying system as a collection of nite state machines or statecharts. 1
Deciding Properties for Message Sequence Charts
, 1998
"... Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is p ..."
Abstract

Cited by 52 (9 self)
 Add to MetaCart
Message sequence charts (MSC) are commonly used in designing communication systems. They allow describing the communication skeleton of a system and can be used for finding design errors. First, a specification formalism that is based on MSC graphs, combining finite message sequence charts, is presented. We present then an automatic validation algorithm for systems described using the message sequence charts notation. The validation problem is tightly related to a natural languagetheoretic problem over semitraces (a generalization of Mazurkiewicz traces, which represent partially ordered executions). We show that a similar and natural decision problem is undecidable. 1
Recognizable sets of message sequence charts
 STACS 2002, LNCS 2030
, 2002
"... Abstract. Highlevel Message Sequence Charts are a wellestablished formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on starconnected HMSCs. We relate this subclass with recognizability and MSOdefinab ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
Abstract. Highlevel Message Sequence Charts are a wellestablished formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on starconnected HMSCs. We relate this subclass with recognizability and MSOdefinability by means of a new connection with Mazurkiewicz traces. Our main result is that we can check effectively whether a starconnected HMSC is realizable by a finite system of communicating automata with possibly unbounded channels. Message Sequence Charts (MSCs) are a popular model often used for the documentation of telecommunication protocols. They profit by a standardized visual and textual presentation (ITUT recommendation Z.120 [11]) and are related to other formalisms such as sequence diagrams of UML. An MSC gives a graphical description of communications between processes. It usually abstracts away from the values of variables and the actual contents of messages. However, this formalism can be used at a very early stage of design to detect errors in the specification
Infinitestate highlevel MSCs: Modelchecking and realizability
 In ICALP 2002, volume 2380 of LNCS
, 2002
"... Abstract. We consider three natural classes of infinitestate HMSCs: ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
Abstract. We consider three natural classes of infinitestate HMSCs:
MessagePassing Automata Are Expressively Equivalent to EMSO Logic
, 2004
"... We study the expressiveness of finite messagepassing automata with a priori unbounded channels and show them to capture exactly the class of MSC languages that are definable in existential monadic secondorder logic interpreted over MSCs. Moreover, we prove the monadic quantifieralternation hierar ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
We study the expressiveness of finite messagepassing automata with a priori unbounded channels and show them to capture exactly the class of MSC languages that are definable in existential monadic secondorder logic interpreted over MSCs. Moreover, we prove the monadic quantifieralternation hierarchy over MSCs to be infinite and conclude that the class of MSC languages accepted by messagepassing automata is not closed under complement. Furthermore, we show that satisfiability for (existential) monadic seconderorder logic over MSCs is undecidable.
Algebraic recognizability of languages
 In Proc. 29th Int. Symp. Math. Found. of Comp. Sci. (MFCS’04
, 2004
"... Abstract. Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this wordrelated notion extends to more complex models, such as those ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Abstract. Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this wordrelated notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. In the beginning was the Word... Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this wordrelated notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. The notion of recognizable languages is a familiar one, associated with classical theorems by Kleene, Myhill, Nerode, Elgot, Büchi, Schützenberger, etc. It can be approached from several angles: recognizability by automata, recognizability by finite monoids or finiteindex congruences, rational expressions, monadic second
Safe Implementability of Regular Message Sequence Charts Specifications
 PROC. OF THE ACIS 4TH INT. CONF. SNDP
, 2003
"... 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 investiga ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
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 deadlockfree implementations up to additional message contents. We present an algorithm to check safe implementability of MSC specifications in the framework of nonFIFO 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.
Netcharts: Bridging the gap between HMSCs and executable specifications
 In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR 2003
, 2003
"... Abstract. We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of Highlevel Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. (i) Netcharts admit a natural and direct transl ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of Highlevel Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. (i) Netcharts admit a natural and direct translation into communicating finitestate 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 finitelygenerated regular MSC languages. 1
Twophase distributed observation problems
 in 5th Intl. Conf. on Application of Concurrency to System Design (ACSD’05). IEEE
, 2005
"... We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finiteword language L over some finite alphabet Σ and subalphabets Σ1,..., Σn of Σ modeling n distinct observation points. We want to build (when there exist) n observers ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We introduce and study problems of distributed observation with bounded or unbounded memory. We are given a system modeled as a finiteword language L over some finite alphabet Σ and subalphabets Σ1,..., Σn of Σ modeling n distinct observation points. We want to build (when there exist) n observers which collect projections of a behavior in L onto Σ1,..., Σn, then send them to a central decision point. The latter must determine whether the original behavior was in a given K ⊆ L. In the unboundedmemory case, observers record the entire sequence they observe. In the boundedmemory case, they are required to be finitestate automata. We show that, when L is traceclosed with respect to the usual dependence relation induced by Σ1,..., Σn, unboundedmemory observability is equivalent to K being centrally observable and traceclosed, thus decidable. When L is not traceclosed, the problem is undecidable, even if K and L are regular. We also show that boundedmemory observability is equivalent to unboundedmemory observability (thus decidable) when L is traceclosed and Σi are pairwise disjoint. Otherwise, the problem remains open. In the decidable cases, observers and decision function can be automatically synthesized. 1