Reactive Systems: Modelling, Specification and Verification - Cs.ioc.ee
Reactive Systems: Modelling, Specification and Verification - Cs.ioc.ee
Reactive Systems: Modelling, Specification and Verification - Cs.ioc.ee
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
a<br />
s <br />
<br />
s1<br />
b<br />
<br />
s2<br />
b<br />
a<br />
a<br />
t<br />
<br />
b <br />
t1<br />
b<br />
<br />
<br />
t2<br />
a<br />
a<br />
v <br />
a<br />
<br />
b <br />
v1 <br />
v2 <br />
<br />
<br />
b <br />
b<br />
<br />
<br />
<br />
v3<br />
Argue that s ∼ t, s ∼ v <strong>and</strong> t ∼ v. Next, find a distinguishing formula of<br />
Hennessy-Milner logic for the pairs<br />
• s <strong>and</strong> t,<br />
• s <strong>and</strong> v, <strong>and</strong><br />
• t <strong>and</strong> v.<br />
b<br />
113<br />
Verify your claims in the Edinburgh Concurrency Workbench (use the strongeq<br />
<strong>and</strong> checkprop comm<strong>and</strong>s) <strong>and</strong> check whether you found the shortest distinguishing<br />
formula (use the dfstrong comm<strong>and</strong>). <br />
Exercise 5.11 For each of the following CCS expressions decide whether they are<br />
strongly bisimilar <strong>and</strong>, if they are not, find a distinguishing formula in Hennessy-<br />
Milner logic:<br />
• b.a.0 + b.0 <strong>and</strong> b.(a.0 + b.0),<br />
• a.(b.c.0 + b.d.0) <strong>and</strong> a.b.c.0 + a.b.d.0,<br />
• a.0 | b.0 <strong>and</strong> a.b.0 + b.a.0, <strong>and</strong><br />
• (a.0 | b.0) + c.a.0 <strong>and</strong> a.0 | (b.0 + c.0).<br />
Verify your claims in the Edinburgh Concurrency Workbench (use the strongeq<br />
<strong>and</strong> checkprop comm<strong>and</strong>s) <strong>and</strong> check whether you found the shortest distinguishing<br />
formula (use the dfstrong comm<strong>and</strong>). <br />
Exercise 5.12 (For the theoretically minded) Let (Proc, Act, { a →| a ∈ Act}) be<br />
image finite. Show that<br />
∼= <br />
∼i ,<br />
i≥0