Lecture 5
5
Refinement checking and FDR
nTraces
nThe set of the sequences of visible actions in all possible runs
nExample:
n   A  =   a -> b -> c -> Stop [] b -> c -> a -> Stop     
n   Tr(A)  =  { a.b.c, b.c.a }
n
n   B  =   a -> Stop ||| b -> c -> Stop     
n   Tr(A)  =  { a.b.c, b.a.c, b.c.a }
n
nNote that A is less nondeterministic than B:
nA represents only a subset of the possible runs of B
n