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

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

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

7.4 Mathematical Preliminaries 235<br />

£<br />

0¥ 1¥ 2¥¡ ¡ ¡ ¦<br />

£<br />

¡¢ ¡ 0¦<br />

are called the elements <strong>of</strong> the set. These elements may be numbers, functions, strings or<br />

they can be sets themselves. For instance the set<br />

denotes an infinite<br />

collection <strong>of</strong> natural numbers. The curly braces are used to ’enumerate’ the elements<br />

<strong>of</strong> the set. The three dots indicate that the partial list <strong>of</strong> numbers should be completed<br />

to define the infinite collection <strong>of</strong> natural numbers. Another way to specify a set is by<br />

referring to other sets and to properties that elements may or may not have. For instance<br />

n n mod 2 defines the set <strong>of</strong> even natural numbers. An alternative way to<br />

define this set is by £<br />

¦ ¡£ ¡£ ¡<br />

¡£ ¡<br />

¤<br />

2n n . Here n denotes that n is an element <strong>of</strong> . If this is<br />

not true we write n . The empty set, i.e. the set that contains no elements, is denoted<br />

by . A set, such as £<br />

0¦ , that contains only one element is called a singleton set.<br />

¥<br />

¡ ¥<br />

¦ §<br />

¨<br />

©<br />

Operators and Relators<br />

Given two sets V and W we will write V W to indicate that V is a subset <strong>of</strong> W. This<br />

means that each element <strong>of</strong> V is also element <strong>of</strong> W. V W indicates that V is not a<br />

subset <strong>of</strong> W. The union <strong>of</strong> V and W is denoted by V W and their intersection by V W.<br />

Sometimes we will take a generalised union <strong>of</strong> sets. If V is a set <strong>of</strong> sets, then V denotes<br />

the union <strong>of</strong> all sets that are element <strong>of</strong> V. Finally,<br />

is the collection <strong>of</strong> all subsets <strong>of</strong> V.<br />

(V) denotes the powerset <strong>of</strong> V. This<br />

Typical Elements<br />

In Chapters 8 and 9 we will define quite a number <strong>of</strong> different collections. To refer<br />

to elements <strong>of</strong> these collections, the collections themselves also have to be specified.<br />

However, this would not improve the readability. Therefore we follow the convention<br />

to use typical elements <strong>of</strong> a collection. If V is a collection we could introduce v¥ w¥¡ ¡ ¡ as its<br />

typical elements. This means that v and w (but also v1¥ v2 ¥ w1, etcetera) refer to arbitrary<br />

elements <strong>of</strong> V. Instead <strong>of</strong> saying that v¥ w¥¡ ¡ ¡ are typical elements <strong>of</strong> V, we also say that<br />

v¥ w¥¡ ¡ ¡ range over V.<br />

Syntactic Elements and Meta Variables<br />

To define the syntax <strong>of</strong> a language one has to introduce collections <strong>of</strong> syntactic elements.<br />

Syntactic elements are the syntactic representations <strong>of</strong> statements, expressions, variables,<br />

specifications, etcetera. The typical elements <strong>of</strong> a collection <strong>of</strong> syntactic elements are<br />

called its syntactic meta-variables. The term meta indicates that these variables themselves<br />

are not part <strong>of</strong> the collection. They are only used to refer to these elements. In principle<br />

the same holds for the typical elements <strong>of</strong> an arbitrary collection. However, within the<br />

context <strong>of</strong> the definition <strong>of</strong> a language the distinction is important to make. For arbitrary<br />

sets the distinction is and can <strong>of</strong>ten be blurred.<br />

7.4.2 Cartesian Products and Binary Relations<br />

Cartesian Products and Ordered Tuples<br />

The cartesian product <strong>of</strong> two sets V and W, denoted by V W, is the set <strong>of</strong> all ordered pairs<br />

v¥ w with v ¡ V and w ¡ W. The pair v¥ w is called an ordered tuple. More generally,<br />

if v1¥¡ ¡ ¡ ¥ vn are n objects, not necessarily distinct, then v1¥¡ ¡ ¡ ¥ vn is called an ordered<br />

n-tuple, or n-tuple for short. Ordered pairs are the same as ordered 2-tuples. If V1¥¡ ¡ ¡ ¥ Vn<br />

are n collections, then the n-fold cartesian product V1 ¡ ¡ Vn is the set <strong>of</strong> all ordered

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

Saved successfully!

Ooh no, something went wrong!