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.

266 Verena Wolf<br />

is that an action a is provided by the environment with probability µ i (a). The<br />

occurrence of the action τ <strong>in</strong> a probabilistic trace simulates that τ is ”performed<br />

by the environment” with probability µ i (τ). Let ɛ denote the empty probabilistic<br />

trace.<br />

The probability of a probabilistic trace is computed <strong>in</strong> a similar way as the<br />

probability of a trace (see Section 9.3.1) but with a different ”normalization<br />

factor” <strong>in</strong> each step because we must take <strong>in</strong>to account the probability of an<br />

action <strong>in</strong> each step. So we have some k<strong>in</strong>d of conditional probability.<br />

We present some helpful def<strong>in</strong>itions now. Let P ∈ FPP , µ ∈D, s, s ′ ∈ SP and<br />

i ∈ N.<br />

• Let v(s,µ)= �<br />

a∈Act Pr a P (s)·µ(a)+Pr τ P (s)+µ(τ) be a normalization factor.<br />

The first summand denotes the probability of perform<strong>in</strong>g an observational<br />

action a that is provided with probability µ(a). Pr τ P<br />

(s) is the probability<br />

that P performs an <strong>in</strong>ternal action autonomously (<strong>in</strong>dependent of µ) and<br />

µ(τ) is the probability that the environment performs τ <strong>in</strong>dependently.<br />

• Let Pr silent<br />

P (s, i, s ′ ,µ) denote the probability of reach<strong>in</strong>g s ′ via i τ-transitions<br />

from P ”under the condition µ” whenstart<strong>in</strong>g<strong>in</strong>s:<br />

�<br />

′ 1 if s = s ,<br />

Let<br />

Pr silent<br />

P (s, 0, s ′ ,µ)=<br />

Pr silent<br />

P (s, i +1, s ′ ,µ)=<br />

Pr silent<br />

P (s, s ′ ,µ)= ∞�<br />

i=0<br />

0 otherwise.<br />

⎧<br />

⎪⎨<br />

1 �<br />

v(s,µ) · Pr<br />

ˆs∈SP<br />

τ P<br />

silent<br />

(s, ˆs)· PrP (ˆs, i, s ′ ,µ)<br />

if v(s,µ) > 0,<br />

⎪⎩<br />

0 otherwise.<br />

Pr silent<br />

P (s, i, s ′ ,µ)<br />

denote the probability of reach<strong>in</strong>g s ′ via a sequence of τ-transitions when<br />

start<strong>in</strong>g <strong>in</strong> s ”under the condition µ”. Note that Pr silent<br />

P (s, s ′ ,µ) is welldef<strong>in</strong>ed<br />

because P is divergence-free.<br />

• For a �= τ let<br />

�<br />

Pr a P (s, s′ ,µ)= Pr<br />

ˆs:v(ˆs,µ)>0<br />

silent<br />

P (s, ˆs,µ) · Pr a P (ˆs, s′ ) · µ(a)<br />

v(ˆs,µ) ·<br />

be the probability of a ”weak” a-transition, i.e. s ′ is reached via a (possibly<br />

empty) sequence of τ-transitions followed by one a-transition when start<strong>in</strong>g<br />

<strong>in</strong> s.<br />

Fora”weak”τ-transition performed ”by the environment” (simulated by µ)<br />

we have<br />

Pr τ P (s, s′ ,µ)=Pr silent (s, s ′ ,µ) ·<br />

µ(τ )<br />

v(s ′ ,µ) .

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

Saved successfully!

Ooh no, something went wrong!