Results 1  10
of
21
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 62 (8 self)
 Add to MetaCart
(Show Context)
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
A Kleene Theorem and Model Checking Algorithms for Existentially Bounded Communicating Automata
 INFORMATION AND COMPUTATION 204:920–956
, 2006
"... The behavior of a network of communicating automata is called existentially bounded if communication events can be scheduled in such a way that the number of messages in transit is always bounded by a value that depends only on the machine, not the run itself. We show a Kleene theorem for existentia ..."
Abstract

Cited by 26 (7 self)
 Add to MetaCart
The behavior of a network of communicating automata is called existentially bounded if communication events can be scheduled in such a way that the number of messages in transit is always bounded by a value that depends only on the machine, not the run itself. We show a Kleene theorem for existentially bounded communicating automata, namely the equivalence between communicating automata, globallycooperative compositional message sequence graphs, and monadic second order logic. Our characterization extends results for universally bounded models, where for each and every possible scheduling of communication events, the number of messages in transit is uniformly bounded [15, 17]. As a consequence, we give solutions in the spirit of [22] for various model checking problems on networks of communicating automata that satisfy our optimistic restriction.
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 23 (4 self)
 Add to MetaCart
(Show Context)
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
Beyond Message Sequence Graphs
 In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science
, 2001
"... We study the modelchecking problem for classes of message sequence charts (MSCs) defined by two extensions of message sequence graphs (MSGs). These classes subsume the class of regular MSC languages. ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
(Show Context)
We study the modelchecking problem for classes of message sequence charts (MSCs) defined by two extensions of message sequence graphs (MSGs). These classes subsume the class of regular MSC languages.
Pattern Matching and Membership for Hierarchical Message Sequence Charts
 In Proc. of LATIN 2002, LNCS 2286
, 2002
"... Several formalisms and tools for software development use hierarchy for system design, for instance statecharts and diagrams in UML. Message sequence charts are an ITU standardized notation for asynchronously communicating processes. The standard Z.120 allows (highlevel) MSCreferences that corresp ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
Several formalisms and tools for software development use hierarchy for system design, for instance statecharts and diagrams in UML. Message sequence charts are an ITU standardized notation for asynchronously communicating processes. The standard Z.120 allows (highlevel) MSCreferences that correspond to the use of macros. We consider in this paper two basic verification tasks for hierarchical MSCs (nested highlevel MSCs, nHMSC), the membership and the pattern matching problem. We show that the membership problem for nHMSCs is PSPACEcomplete, even using a weaker semantics for nMSCs than the partialorder semantics. For pattern matching nMSCs M;N we exhibit a polynomial algorithm of time O(jM j 2 \Delta jN j 2 ). We use here techniques stemming from algorithms on compressed texts.
The MSO Theory of Connectedly Communicating Processes
"... Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that if the process p executes k steps without hearing from process q—directly or indirectly—then it will neverhearfromq agai ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that if the process p executes k steps without hearing from process q—directly or indirectly—then it will neverhearfromq again. The noninterleaved branching time behavior of a system of connectedly communicating processes (CCP) is given by its event structure unfolding. We show that the monadic second order (MSO) theory of the event structure unfolding of every CCP is decidable. Using this result, we also show that an associated distributed controller synthesis problem is decidable for linear time specifications that do not discriminate between two different linearizations of the same partially ordered execution.
Specifying and verifying partial order properties using template MSCs
 In FOSSACS’04, LNCS 2987
, 2004
"... Abstract. Message sequence charts (MSC) are a graphical language for the description of communication scenarios between asynchronous processes. Our starting point is to model systems using an assumeguarantee formalism, in the style of LSCs and Triggered MSCs. We enrich MSCs with the possibility of ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. Message sequence charts (MSC) are a graphical language for the description of communication scenarios between asynchronous processes. Our starting point is to model systems using an assumeguarantee formalism, in the style of LSCs and Triggered MSCs. We enrich MSCs with the possibility of using gaps (template MSC), and show their expressivity. This formalism also allows to express logical formulas. We analyze the modelchecking problem, whose complexity is linear in the size of the system, and ranges from PTIME to EXPSPACE in the size of the template formula. 1
On communicating automata with bounded channels
, 2007
"... We review the characterization of communicating finitestate machines whose behaviors have universally or existentially bounded channels. These results rely on the theory of Mazurkiewicz traces. We investigate the question whether channel bound conditions are decidable for a given communicating fin ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We review the characterization of communicating finitestate machines whose behaviors have universally or existentially bounded channels. These results rely on the theory of Mazurkiewicz traces. We investigate the question whether channel bound conditions are decidable for a given communicating finitestate machine.
Dynamic Message Sequence Charts
 IN PROCEEDINGS OF THE 22ND CONFERENCE ON BIBLIOGRAPHY 133 FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2002), KANPUR, INDIA
, 2002
"... We introduce a formalism to specify classes of MSCs over an unbounded number of processes. The formalism can describe many interesting behaviours of dynamically changing networks of processes. Moreover, ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We introduce a formalism to specify classes of MSCs over an unbounded number of processes. The formalism can describe many interesting behaviours of dynamically changing networks of processes. Moreover,
Detecting Races in Ensembles of Message Sequence Charts
 In TACAS’07, LNCS 4424
, 2007
"... Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible discrepancies in event order, was studied for a single MSC and for MSC graphs (a graph where each node consists of a single ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. The analysis of message sequence charts (MSCs) is highly important in preventing common problems in communication protocols. Detecting race conditions, i.e., possible discrepancies in event order, was studied for a single MSC and for MSC graphs (a graph where each node consists of a single MSC, also called HMSC). For the former case, this problem can be solved in quadratic time, while for the latter case it was shown to be undecidable. However, the prevailing reallife situation is that a collection of MSCs, called here an ensemble, describing the different possible scenarios of the system behavior, is provided, rather than a single MSC or an MSC graph. For an ensemble of MSCs, a potential race condition in one of its MSCs can be compensated by another MSC in which the events occur in a different order. We provide a polynomial algorithm for detecting races in an ensemble. On the other hand, we show that in order to prevent races, the size of an ensemble may have to grow exponentially with the number of messages. Also, we initiate the formal study of the standard MSC coregion construct, which is used to relax the order among events of a process. We show that by using this construct, we can provide more compact racefree ensembles; however, detecting races becomes NPcomplete. 1