• Aucun résultat trouvé

Causal Message Sequence Charts

N/A
N/A
Protected

Academic year: 2021

Partager "Causal Message Sequence Charts"

Copied!
39
0
0

Texte intégral

Loading

Figure

Fig. 1. An HMSC over two MSCs
Fig. 2. Two MSCs M and N
Fig. 3. A causal MSC M and its visual extensions M1, M2.
Fig. 5. Visual extensions of the causal MSC B of Figure 4.
+7

Références

Documents relatifs

We propose a timed model of communicat- ing finite-state machines, which communicate by exchanging messages through channels and use event clocks to generate collections of

It is quite easy to observe that a word w ∈ 1-closure(L) if and only if there is a firing sequence labelled w from the initial marking to some final marking.. This leads us naturally

Section 5 shows the existence of a decidable subclass called bounded window causal HMSCs where each message of a generated order is crossed by a bounded number of messages.. A part

Now that HMSCs (a global specification) and communicating finite state machines (a set of local reactive machines, without global control) are defined, we can describe the

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Unité de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unité de recherche INRIA Rhône-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Following the causal description, the input le contains several segments of sup- plementary information, including additional background information concerning the types of

Namely, in the definition of an HMSC, a concatenation of MSCs along a path intuitively suggests that messages that appear in an earlier MSC precede in time any message that appears in