D.3.3 ALGORITHMS FOR INCREMENTAL ... - SecureChange
D.3.3 ALGORITHMS FOR INCREMENTAL ... - SecureChange
D.3.3 ALGORITHMS FOR INCREMENTAL ... - SecureChange
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Dealing with Known Unknowns: A Goal-based Approach 9<br />
(a) AMAN Evolution 1<br />
(b) AMAN Evolution 2<br />
The right hand corner of the two models corresponds to the different evolutions of the<br />
model that we have described in Example 2.<br />
Fig. 2 Alternative Evolutions for AMAN Deployment.<br />
a subpart of a goal model is an arbitrary goal and all its directly and indirectly children.<br />
The evolutionary goal model, therefore, is a tuple of an original goal model<br />
and a set of observable rules, 〈EM, R o〉.<br />
It is not feasible to represent all evolutions in the same diagram. In order to understand<br />
the level of complexity we show in Fig. 2 two alternative models in which<br />
a number of observable evolutions rules have been triggered. In comparison with<br />
Fig. 1 the new goals have been marked in green. It is clearly impossible to identify<br />
the two simple evolution rules that we have described. These evolutions must be<br />
represented as local evolutions of the corresponding fragment of the models.<br />
Here we outline how evolution rules are visualized in an evolutionary goal<br />
model, more discussion can be found in a technical report [37]. Fig. 3 illustrates<br />
two graphical representations of an observable rule, tree-like and swimlane-based,<br />
taken from Example 2.<br />
Fig. 3(b), meanwhile, describes the swimlane-based representation where original<br />
model is on the left side, and all the possible evolutions are located next to the<br />
right. Evolution probability is indicated by the label and the shade of swimlanes.