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.

• An <strong>in</strong>put sequence x is a valid <strong>in</strong>put sequence for C if:<br />

2 State Identification 45<br />

∀ s, s ′ ∈ C : s �= s ′ ⇒ λ(s, x ) �= λ(s ′ , x )orδ(s, x ) �= δ(s ′ , x ).<br />

• a (resp., x ) is a valid <strong>in</strong>put (resp., valid <strong>in</strong>put sequence) for a collection of<br />

sets of states τ if a (resp., x )isvalidforeachmemberofτ.<br />

⊓⊔<br />

Let us illustrate this notion of validity on mach<strong>in</strong>e M5 (Fig. 2.6). It has been<br />

already shown that ab is a PDS of this mach<strong>in</strong>e. When execut<strong>in</strong>g this <strong>in</strong>put<br />

sequence on M5, the current uncerta<strong>in</strong>ty evolves as follows<br />

{{s1, s2, s3}} a<br />

−→{{s1, s2}0, {s3}1} b<br />

−→{{s3}01, {s1}00, {s2}11}.<br />

First, it is easy to check that both a and ab are valid for {s1, s2, s3} and that b<br />

is valid for {s1, s2}. More precisely, b is valid for {{s1, s2}, {s3}}, but s<strong>in</strong>ce {s3}<br />

is s<strong>in</strong>gleton then that it is equivalent to say that it is valid for {s1, s2}.<br />

The second th<strong>in</strong>g to notice is that the total number of states conta<strong>in</strong>ed <strong>in</strong><br />

each of the three uncerta<strong>in</strong>ties of the example above equals 3 the number of<br />

states of the mach<strong>in</strong>e. In particular, the last uncerta<strong>in</strong>ty is made of as many<br />

s<strong>in</strong>gletons as the number of states of the mach<strong>in</strong>e.<br />

Proposition 2.6, below, argues that these observations rema<strong>in</strong> true <strong>in</strong> the<br />

general case. The proposition uses the follow<strong>in</strong>g notation:<br />

• Super(M) is the set of multisets of non-empty blocks of states such that<br />

W = {B1, B2, ··· , Bl} is <strong>in</strong> Super(M ) if and only if � Bi ∈W |Bi| = |S|.<br />

• S<strong>in</strong>gleton(M) is the subset of Super(M ) the members of which are sets of<br />

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

• For a given multiset of blocks τ and a given <strong>in</strong>put symbol a, µ(τ,a) is<br />

obta<strong>in</strong>ed by partition<strong>in</strong>g each member C of τ w.r.t λ(·, a), then apply<strong>in</strong>g<br />

δ(·, a) on each block of the obta<strong>in</strong>ed partition.<br />

and<br />

For <strong>in</strong>stance, if S = {s1, s2} then:<br />

and<br />

Super(M )=[{{s1}, {s2}}; {{s1}, {s1}}; {{s2}, {s2}}; {{s1, s2}}].<br />

S<strong>in</strong>gleton(M )=[{{s1}, {s2}}; {{s1}, {s1}}; {{s2}, {s2}}] 1 .<br />

Moreover, for mach<strong>in</strong>e M5 we have:<br />

µ({{s1, s2, s3}}, a) ={{s1, s2}0, {s3}1}<br />

µ({{s1, s2}0, {s3}1}, b) ={{s3}01, {s1}00, {s2}11}.<br />

1<br />

Here, we use the notation [C1; C2] <strong>in</strong>stead of the classical notation {C1, C2} for<br />

mak<strong>in</strong>g th<strong>in</strong>gs more readable.

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

Saved successfully!

Ooh no, something went wrong!