23.08.2013 Views

Specification of Reactive Hardware/Software Systems - Electronic ...

Specification of Reactive Hardware/Software Systems - Electronic ...

Specification of Reactive Hardware/Software Systems - Electronic ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

328 Behaviour-Preserving Transformations<br />

transformations. The implementation model will in general act as a blue-print for the<br />

actual implementation. The key idea <strong>of</strong> transformational design is that it supports the<br />

evaluation <strong>of</strong> many alternative implementation models, in order to select the most suitable<br />

one. The idea is illustrated in Figure 10.5. Each ellipse denotes a model. A dashed<br />

H<br />

T<br />

T<br />

A<br />

E<br />

T<br />

T<br />

I<br />

B<br />

F<br />

J<br />

C<br />

T T<br />

T<br />

G<br />

T T<br />

K L<br />

T T T T<br />

... ... ... ... ...<br />

Sub-space 1 Sub-space 2<br />

Sub-space 3<br />

Figure 10.5: Illustration <strong>of</strong> Transformational Design<br />

arrow between two models denotes that these models are equivalent with respect to<br />

some formally defined equivalence relation 10 . A solid arrow between two models indicates<br />

the existence <strong>of</strong> a transformation with which the one model can be transformed<br />

into the other one (and vice versa).<br />

If the transformation process starts <strong>of</strong>f with (abstract) model A then each one <strong>of</strong> the models<br />

A, E, H, I, ¡ ¡ is a candidate for being selected as implementation model. According<br />

to Proposition 8 <strong>of</strong> Appendix B 11 , however, there exist always models that are equivalent<br />

to A, but that can not be reached from A by applying the behaviour-preserving<br />

transformations 12 . Examples <strong>of</strong> such models are B, F, J, C, G, K, L, ¡ ¡ (see Figure 10.5).<br />

Although model L can be a perfect implementation model, it will never be selected since<br />

there exists no sequence <strong>of</strong> transformations leading from model A to model L. This result<br />

10In stead <strong>of</strong> an equivalence relations, one could also use a pre-order. In stead <strong>of</strong> undirected arrows,<br />

one would then use directed arrows.<br />

11Proposition 8 represents a stronger version <strong>of</strong> the incompleteness result stated in Proposition 6.<br />

12This statement holds if POOSL is used as specification language and if transformation equivalence is<br />

used as equivalence relation. It is however very likely that the same statement holds for any language<br />

that is expressive enough together with any non-trivial equivalence relation or pre-order.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!