Recognizable Sets of Message Sequence Charts

Morin, Rémi

doi:10.1007/3-540-45841-7_43

Cited by 24 publications

(29 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concurrent automata are the usual framework used for studying realizability of MSCs [17,1,2], i.e. the property for a set of MSCs to describe the behaviour of an actual distributed system.…”

Section: Test Hypothesesmentioning

confidence: 99%

Global and local testing from Message Sequence Charts

Longuet

2012

Proceedings of the 27th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Abstract. Message Sequence Charts are a widely used formalism for describing scenarios a communicating system must be able to perform. We study in this paper different formal frameworks for testing from MSCs. We first consider a setting where all the processes of the system can be controlled and observed globally. Then we study a setting where the system is tested from the point of view of each process individually, observations remaining local or being gathered at the end of each test. In each setting, we define a conformance relation based on global or local observations, for which we build an exhaustive test set. Moreover, we gather the conditions making local testing as powerful as global testing.

show abstract

Section: Test Hypothesesmentioning

confidence: 99%

Global and local testing from Message Sequence Charts

Longuet

2012

Proceedings of the 27th Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…As in [17,24], we consider the linearizations of MSCs that are obtained from the global automaton induced by an MPA. …”

Section: Definition 3 (Message-passing Automaton (Mpa)) An Mpa Is a mentioning

confidence: 99%

“…Moreover, product MPA cannot distinguish between synchronization messages. MSC languages of product MPA are referred to as realizable [24,21]. The MPA in Figs.…”

Section: Definition 3 (Message-passing Automaton (Mpa)) An Mpa Is a mentioning

confidence: 99%

See 1 more Smart Citation

Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning

Bollig

Katoen

Kern

et al. 2007

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit learning for the synthesis of design models. In particular, we present a procedure that infers a message-passing automaton (MPA) from a given set of positive and negative scenarios of the system's behavior provided as message sequence charts (MSCs). The paper investigates which classes of regular MSC languages and corresponding MPA can (not) be learned, and presents a dedicated tool based on the learning library LearnLib that supports our approach.

show abstract

“…MSCs propose a visual representation of system executions, can be composed by formalisms like high-level MSCs (HMSCs), and are standardized by the ITU [13]. A natural question in this context is the implementability problem, which asks if a given HMSC can be translated into an equivalent CA [11,1,12,20,10,17,9].…”

Section: Introductionmentioning

confidence: 99%

Dynamic Communicating Automata and Branching High-Level MSCs

Bollig

Aiswarya

Hélouët

et al. 2013

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Abstract. We study dynamic communicating automata (DCA), an extension of classical communicating finite-state machines that allows for dynamic creation of processes. The behavior of a DCA can be described as a set of message sequence charts (MSCs). While DCA serve as a model of an implementation, we propose branching high-level MSCs (bHMSCs) on the specification side. Our focus is on the implementability problem: given a bHMSC, can one construct an equivalent DCA? As this problem is undecidable, we introduce the notion of executability, a decidable necessary criterion for implementability. We show that executability of bHMSCs is EXPTIME-complete. We then identify a class of bHMSCs for which executability effectively implies implementability.

show abstract

Recognizable Sets of Message Sequence Charts

Cited by 24 publications

References 15 publications

Global and local testing from Message Sequence Charts

Global and local testing from Message Sequence Charts

Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning

Dynamic Communicating Automata and Branching High-Level MSCs

Contact Info

Product

Resources

About