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

Create successful ePaper yourself

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

246 Verena Wolf<br />

We present two approaches of construct<strong>in</strong>g test<strong>in</strong>g relations for probabilistic<br />

processes <strong>in</strong> Section 9.8.<br />

A fully probabilistic process P is analyzed by runn<strong>in</strong>g <strong>in</strong> parallel with a nonprobabilistic<br />

test process or a fully probabilistic test process. Fully probabilistic<br />

test processes have more dist<strong>in</strong>guish<strong>in</strong>g power than non-probabilistic ones as can<br />

be seen by Example 6, page 263. We will discuss both approaches here and start<br />

with the description of two different classes of non-probabilistic test processes<br />

[Chr90].<br />

Def<strong>in</strong>ition 9.9. Let T np,re ⊂T np be the set of all T =(ST , →T , sT ) ∈T np<br />

with<br />

(t a −→T t ′ ∧ t a −→T t ′′ )=⇒ t ′′ = t ′ .<br />

Let T np,re<br />

seq<br />

⊂Tnp,re be the set of all T =(ST , →T , sT ) ∈T np,re with<br />

(t a −→T t ′ ∧ t a′<br />

−→T t ′′ )=⇒ (a = a ′ ∧ t ′′ = t ′ ).<br />

T np,re is the set of ”reactive” test processes, reactive <strong>in</strong> the sense that T ∈T np,re<br />

is the set of all sequential test processes<br />

because <strong>in</strong> T ∈Tnp,re seq there is no choice at all between several transitions.<br />

We apply non-probabilistic test processes here to fully probabilistic processes.<br />

The parallel composition is def<strong>in</strong>ed as follows.<br />

Def<strong>in</strong>ition 9.10. The parallel composition of P = (SP, →P, sP) ∈ FPP<br />

and T =(ST , →T , sT ) ∈T np is the fully probabilistic process P�T =(SP ×<br />

ST , →, (sP, sT )) with<br />

has no <strong>in</strong>ternal nondeterm<strong>in</strong>ism. T np,re<br />

seq<br />

(s, t) (a,<br />

(s, t) (τ,<br />

p<br />

v(s,t) )<br />

−−−−−−→ (s ′ , t ′ ) iff s (a,p)<br />

−−−→P s ′ and t a −→T t ′ ,<br />

p<br />

v(s,t) )<br />

−−−−−→ (s ′ , t ′ ) iff s (τ,p)<br />

−−−→P s ′ and t = t ′ ,<br />

where a �= τ and v(s, t) = �<br />

a∈Act |{t a −→T t ′ }|·Pr a P (s)+Pr τ P (s).<br />

⊓⊔<br />

Note that the parallel composition of a fully probabilistic process and a nonprobabilistic<br />

test process that is able to perform τ-transitions is not sensible<br />

here s<strong>in</strong>ce there is no appropriate probability for an <strong>in</strong>ternal move of T <strong>in</strong> P�T<br />

and we do not want to abstract from the probabilistic <strong>in</strong>formation here at all.<br />

Follow<strong>in</strong>g the approach of Cleaveland et al. the environment of a fully probabilistic<br />

process is simulated by a test process which is also a fully probabilistic process<br />

[CSZ92]. The parallel composition of P ∈ FPP and T ∈T fp<br />

τ is a fully probabilistic<br />

process P�T that executes external actions of P and T synchronously<br />

and <strong>in</strong>ternal actions <strong>in</strong> isolation. Here <strong>in</strong>ternal actions are treated as ”<strong>in</strong>visible”<br />

for the environment and synchroniz<strong>in</strong>g over <strong>in</strong>ternal actions is not allowed.<br />

Def<strong>in</strong>ition 9.11. The parallel composition of two fully probabilistic processes<br />

P = (SP, →P, sP) and T = (ST , →T , sT ) is P�T = (SP × ST ,<br />

→, (sP, sT )) ∈ FPP where for a �= τ<br />

⊓⊔

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

Saved successfully!

Ooh no, something went wrong!