DynBindModelExamples: Difference between revisions
| Line 410: | Line 410: | ||
\mbox{id} \left( \mbox{ran} \left( \beta_{S_2} \left( C_1 \mapsto C_2 \right) \right) \right) | \mbox{id} \left( \mbox{ran} \left( \beta_{S_2} \left( C_1 \mapsto C_2 \right) \right) \right) | ||
= | = | ||
\left\{ | \left\{ f_1 \mapsto f_2, g_1 \mapsto g_2 \right\} | ||
</math> | </math> | ||
##<math> | ##<math> | ||
| Line 450: | Line 450: | ||
</math> | </math> | ||
##<math> | ##<math> | ||
\sigma_{3,C_2} = | \sigma_{3,C_2} = \sigma \left(C_3 \right) \left(C_2\right) = \left\{ f_2 \right\} | ||
</math> | |||
##<math> | |||
\sigma_{3,C_1} = \sigma \left(C_3 \right) \left(C_1\right) = \left\{ g_1 \right\} | |||
</math> | </math> | ||
##<math> | ##<math> | ||
\sigma_{3,C_1} = | \beta_{S_2} \left( C_1 \mapsto C_2 \right) | ||
; | |||
\mbox{id} \left( \mbox{ran} \left( \beta_{S_2} \left( C_1 \mapsto C_2 \right) \right) \right) | |||
\ \triangleright\ | |||
\sigma_{3,C_2} | |||
= | |||
\left\{ f_1 \mapsto f_2 \right\} | |||
</math> | |||
##<math> | |||
\beta_{S_2} \left( C_1 \mapsto C_1 \right) | |||
; | |||
\mbox{id} \left( \mbox{ran} \left( \beta_{S_2} \left( C_1 \mapsto C_1 \right) \right) \right) | |||
\ \triangleright\ | |||
\sigma_{3,C_1} | |||
= | |||
\left\{ g_1 \mapsto g_1 \right\} | |||
</math> | |||
##<math> | |||
\left\{ f_1 \mapsto f_2 \right\} \ \cup \ \left\{ g_1 \mapsto g_1 \right\} | |||
= | |||
\left\{ f_1 \mapsto f_2, g_1 \mapsto g_1 \right\} | |||
</math> | |||
##<math> | |||
\left\{ f_1 \mapsto f_1, f_1 \mapsto f_2, g_1 \mapsto g_1, g_1 \mapsto g_2 \right\} | |||
\ll | |||
\left\{ f_1 \mapsto f_2, g_1 \mapsto g_1 \right\} | |||
= | |||
\left\{ f_1 \mapsto f_2, g_1 \mapsto g_1 \right\} | |||
</math> | </math> | ||
Revision as of 22:47, 9 October 2006
This page shows
Example 1
The system
In this example we are studying a symple system with three classes that contains both renaming and selects:
class C1 feature f1 do ... end g1 do ... end end |
class C2 inherit B rename f1 as f2, g1 as g2 redefine f2, g2 end feature f2 do ... end g2 do ... end end |
class C3 inherit C2 select f2 end C1 redefine f1, g1 select g1 end feature f1 do ... end g1 do ... end end |
This system is defined by:
The naming function
We proceed by calculating the naming function. According to its definition we have to do that incrementaly. Meaning that we first calculate then and finally .
Calculating
Since contains only one class it is sufficient to define . According to the definition:
We can forget about the right part of the union since has no base classes. So we need to calculate: .
This done we calculate:
So we get:
Calculating
We show the calculation of the different (four) parts of the function in separate sections:
Calculate
According to the definition:
Calculate
According to the definition:
Calculate
According to the definition:
Lets calculate the left part first:
And now the right part:
So we get:
Calculate
According to the definition:
Where:
And:
Here are the steps taken to compute the part:
So:
Putting the parts together:
We can know show the complete total function:
|
|
|
|
| |
|
| |
|
|
Calculating
We will not show the complete construction of but restrict our self to the most interesting parts.
Calculate
According to the definition:
Where:
And:
Note that we can ommit from the formulas since it is always empty.