Information Technology Reference
In-Depth Information
Fig. 15.
Screenshot of the weaving wizard
choosing between these two strategies. It the
non-strict sequence of messages
is
selected, then the notions of
safe part
and
general part
of a bSD are used. The
check box
preserve event order
allows choosing between these two strategies.
After choosing the detection strategies, the weaving can be performed at once
using the
Weave All
button or interactively using the
Weave
and
Skip
buttons.
Figure 16 presents the result of the weaving of the behavioral aspect in the
base model of Fig. 13, with as settings in the wizard, “Non-strict message se-
quence” and “Preserve event order” selected.
7
Future Works
The algorithms of join point detection proposed in this paper (when the join
points are enclosed parts, safe parts or general parts of a bSD) only work for bSDs
or combined SDs which generate a finite number of behaviors (cSDs without loop,
in this case the weaving can be applied to each bSDs of the set generated by a
cSD). When the join points are strict parts of a bSD, the join point detection
within infinite behavior is already solved in [18]. More specifically, the detection
of join points within infinite behaviors always terminates when the pointcut
is connected, i.e., when the pointcut has no parallel component (the pointcut
cannot be written as a parallel composition of two other bSDs). However, for
the new definitions of join points proposed in this paper, the problem of detection
is more complicated. For instance, let us consider the behavioral aspect and the
cSD
example
depicted in Fig. 17. When the join points are general parts of a
Search WWH ::
Custom Search