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.
3.3. STRONG BISIMILARITY 47<br />
So, by the second requirement in Definition 3.2, there must be a transition<br />
CTM coin<br />
→ P<br />
for some process P such that P R tea.CTM ′ . A moment of thought should be<br />
enough to convince yourselves that the only process that CTM can reach by receiving<br />
a coin as input is coff<strong>ee</strong>.CTM + tea.CTM. So we are requiring that<br />
(coff<strong>ee</strong>.CTM + tea.CTM) R tea.CTM ′ .<br />
However, now a contradiction is immediately reached. In fact,<br />
coff<strong>ee</strong>.CTM + tea.CTM coff<strong>ee</strong><br />
→ CTM ,<br />
but tea.CTM ′ cannot output coff<strong>ee</strong>. Thus the first requirement in Definition 3.2<br />
cannot be met. It follows that our assumption that the two machines were strongly<br />
bisimilar leads to a contradiction. We may therefore conclude that, as claimed, the<br />
processes CTM <strong>and</strong> CTM ′ are not strongly bisimilar.<br />
Example 3.3 Consider the processes P <strong>and</strong> Q defined thus:<br />
<strong>and</strong><br />
P def<br />
= a.P1 + b.P2<br />
P1<br />
P2<br />
def<br />
= c.P<br />
def<br />
= c.P<br />
Q def<br />
= a.Q1 + b.Q2<br />
def<br />
= c.Q3<br />
Q1<br />
Q2<br />
Q3<br />
def<br />
= c.Q3<br />
def<br />
= a.Q1 + b.Q2 .<br />
We claim that P ∼ Q. To prove that this does hold, it suffices to argue that the<br />
following relation is a strong bisimulation<br />
R = {(P, Q), (P, Q3), (P1, Q1), (P2, Q2)} .<br />
We encourage you to check that this is ind<strong>ee</strong>d the case.