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.
2.2. CCS, FORMALLY 35<br />
Exercise 2.13 Consider the process B defined thus:<br />
C(x)<br />
B def<br />
= push(x).(C(x) ⌢ B) + empty.B<br />
def<br />
= push(y).(C(y) ⌢ C(x)) + pop(x).D<br />
D def<br />
= o(x).C(x) + ē.B ,<br />
where the linking combinator P ⌢ Q is as follows:<br />
P ⌢ Q = (P[p ′ /p, e ′ /e, o ′ /o] | Q[p ′ /push, e ′ /empty, o ′ /pop]) \ {p ′ , o ′ , e ′ } .<br />
Draw an initial fragment of the transition graph for this process. What behaviour<br />
do you think B implements? <br />
Exercise 2.14 (For the theoretically minded) Prove that the operational semantics<br />
for value passing CCS we have given above is in complete agr<strong>ee</strong>ment with the<br />
semantics for this language via translation into the pure calculus given by Milner<br />
in (Milner, 1989, Section 2.8).