Lecture 5
8
nStronger, compositional semantics
nFailures: this semantics encodes the brancing structure of a process by representing, after each partial trace, the set of actions that are not allowed
n
nExample:
n
n
n
n
n
n
nThe notion of refinement is defined in such a way that A is a refinement of B, but not vice versa
nThis notion of refinement is preserved under closure on possible contexts
Refinement checking and FDR
a
c
b
a
a
b
c
F(A)  =  { <a, {a}>, … }
       =/=
F(B)  =  { <a, {a,b}>, <a, {a,c}> , … }
A
B