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.

270 Verena Wolf<br />

T np,re<br />

seq<br />

⊑ tr CH<br />

ord<strong>in</strong>ary<br />

traces<br />

fully probabilistic<br />

processes<br />

T np,re<br />

probabilistic<br />

processes<br />

aCTMCs<br />

⊑ ste<br />

CH<br />

⊑CL ⊑ ⊑BC<br />

may<br />

SE ⊑ may<br />

JY<br />

extended<br />

traces<br />

fp<br />

Tτ prob.<br />

traces<br />

T pp<br />

τ<br />

trace distr.<br />

precongr.<br />

T pp<br />

prob.<br />

simulation<br />

T pa<br />

τ<br />

extended<br />

traces+time<br />

Fig. 9.15. Characterizations for probabilistic test<strong>in</strong>g relations: The upper vertical arrows<br />

connect the respective class of processes with the match<strong>in</strong>g test<strong>in</strong>g relation and<br />

the label corresponds to the applied set of test processes. The lower vertical arrows connect<br />

each test<strong>in</strong>g relation with the respective characterization and the lower horizontal<br />

arrows show that extended traces are a special case of probabilistic traces and a special<br />

case of extended traces with an additional time requirement. Moreover, ord<strong>in</strong>ary traces<br />

are a special case of extended traces.<br />

Figure 9.15 shows the characterizations presented <strong>in</strong> this section and the applied<br />

sets of test processes, respectively. Moreover, the underly<strong>in</strong>g models are<br />

depicted. Of course, extended traces, enriched with a time function, boil down<br />

to ord<strong>in</strong>ary extended traces and probabilistic traces are the probabilistic extension<br />

of extended traces. It is clear that extended traces are an extension of<br />

ord<strong>in</strong>ary traces.<br />

9.12 Connect<strong>in</strong>g Test<strong>in</strong>g and Probabilistic Bisimulation<br />

In the follow<strong>in</strong>g, we discuss the work of Larsen and Skou that connects an <strong>in</strong>tuitive<br />

test<strong>in</strong>g approach for a subclass of probabilistic processes with probabilistic<br />

bisimulation [LS91]. Larsen and Skou apply non-probabilistic test processes to<br />

τ-free reactive probabilistic processes . A probabilistic process P =(SP, →P, sP)<br />

is reactive if s a −→P µ and s a −→P λ implies µ = λ for all s ∈ SP. The <strong>in</strong>tuitive<br />

idea is that <strong>in</strong> each step the external environment chooses an action and there is<br />

no ”<strong>in</strong>ternal” nondeterm<strong>in</strong>ism between two transitions with equal actions. For<br />

s a a<br />

−→ µ we put µ s,a = µ. Wewrites−−→/<br />

P if there exists no µ s,a .<br />

Larsen and Skou def<strong>in</strong>ed the probabilistic bisimulation equivalence such that for<br />

two bisimulation equivalent states the probability to move with an a-transition<br />

to an equivalence class E is equal for all a ∈ Actτ.

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

Saved successfully!

Ooh no, something went wrong!