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.

236 Verena Wolf<br />

• A f<strong>in</strong>ite trace β is a sequence<br />

β = a0 a1 ...an−1 ∈ Act ∗ .<br />

Let trace(α) denote the ordered sequence of all external actions occurr<strong>in</strong>g <strong>in</strong><br />

a f<strong>in</strong>ite path α. Note that f<strong>in</strong>ite paths always end up <strong>in</strong> a term<strong>in</strong>al state and<br />

start <strong>in</strong> the <strong>in</strong>itial state whereas traces can be arbitrary sequences of Act ∗ .<br />

• We use the previous def<strong>in</strong>itions of term<strong>in</strong>al states, τ-free, f<strong>in</strong>itely-branch<strong>in</strong>g<br />

and divergence-free non-probabilistic processes also for all the probabilistic<br />

extensions that are def<strong>in</strong>ed later (the formal def<strong>in</strong>itions are analogous). We<br />

will use the term process for all k<strong>in</strong>ds of processes considered <strong>in</strong> the sequel<br />

and from now on all processes are divergence-free and f<strong>in</strong>itely-branch<strong>in</strong>g.<br />

Weight functions: Aweight function on a countable set S is a function δ :<br />

S → R�0. LetWeight(S) denote the set of all weight functions on S.<br />

Distributions:<br />

�<br />

µ ∈ Weight(S) is a distribution on a countable set S if<br />

s∈S µ(s) =1. Let supp(µ) ={s ∈ S : µ(s) > 0} and Distr(S) betheset<br />

of all distributions on S. Ifs ∈ S then χs denotes the unique distribution on S<br />

with<br />

�<br />

1 if t = s,<br />

χs(t) =<br />

0 if t ∈ S \{s}.<br />

The product µ × λ of two distributions µ on a set S and λ on a set T is the<br />

distribution on S × T def<strong>in</strong>ed by<br />

(µ × λ)(s, t) =µ(s) · λ(t), s ∈ S, t ∈ T .<br />

In the follow<strong>in</strong>g λ, µ, π, σ will always denote distributions.<br />

Probability spaces: A probability space is a tuple (Ω,A, P), where<br />

• Ω is a nonempty set of outcomes,<br />

•A⊆P(Ω) isaσ-algebra, i.e. Ω ∈Aand A is closed under countable union<br />

and complement,<br />

• P : A→[0, 1] is a probability measure, i.e. P(Ω) =1,P(∅) =0andfor<br />

countably many pairwise disjo<strong>in</strong>t A1, A2,...∈Awe have<br />

�<br />

i P(Ai) =P( �<br />

i Ai).<br />

For C⊆P(Ω) letσ(C) denote the smallest σ-algebra conta<strong>in</strong><strong>in</strong>g C def<strong>in</strong>ed by<br />

�<br />

σ(C) =<br />

A.<br />

C⊂A<br />

A is σ-algebra on Ω<br />

A probability measure def<strong>in</strong>ed on an appropriate set C canbeextendedtoa<br />

unique probability measure on σ(C) (for details we refer to the book of Feller<br />

[Fel68]).<br />

Example. Consider Ω =[0, 1] and C = {]a, b] | 0 � a < b � 1}. Thenσ(C) is<br />

the set of all countable unions of closed or open subsets of [0, 1] and P(]a, b]) =<br />

b − a can be extended to a unique probability measure (the so-called Lebesgue<br />

measure) on σ(C).<br />

⊓⊔

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

Saved successfully!

Ooh no, something went wrong!