07.01.2013 Views

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

Lecture Notes in Computer Science 3472

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

5 Preorder Relations 149<br />

The utility of various preorders should thus be estimated by tak<strong>in</strong>g all of their<br />

features <strong>in</strong>to consideration.<br />

In the same l<strong>in</strong>e of thought, namely practical applications, we have presented<br />

a practical framework for conformance test<strong>in</strong>g based on the theory of preorders.<br />

F<strong>in</strong>ally, it is worth po<strong>in</strong>t<strong>in</strong>g out that our presentation has been made <strong>in</strong><br />

terms of labeled transition systems, as opposed to most of the literature, <strong>in</strong><br />

which process algebraic languages such as CCS, LOTOS, and variants thereof<br />

are generally used. Labeled transition systems def<strong>in</strong>e however the semantics of<br />

all these languages, so the translation of the results surveyed here <strong>in</strong>to various<br />

other formalisms should not be a problem. The upside of our approach is the<br />

uniform and concise characterization of the preorders, although we lose some<br />

expressiveness <strong>in</strong> do<strong>in</strong>g so (however the literature cited there<strong>in</strong> always offers a<br />

second, most of the time process algebraic view of the doma<strong>in</strong>).<br />

As well, we did not pay attention to contexts. Contexts admit however a<br />

relatively straightforward approach once the rest of the apparatus is <strong>in</strong> place.

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

Saved successfully!

Ooh no, something went wrong!