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
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
150 CHAPTER 6. HML WITH RECURSION<br />
the system. So a state p in a labelled transition system has a livelock if it affords a<br />
computation of the form<br />
p = p0 τ → p1 τ → p2 τ → p3 τ → · · ·<br />
for some sequence of states p1, p2, p3 . . .. In other words, a state p has a livelock<br />
now if it affords a τ-labelled transition leading to a state p1 which has a livelock<br />
now. This immediately suggests the following recursive specification of the property<br />
LivelockNow:<br />
LivelockNow = 〈τ〉LivelockNow .<br />
As usual, we are faced with a choice in selecting a suitable solution for the above<br />
equation. Since we are specifying a state of affairs that should hold forever, in this<br />
case we should select the largest solution to the equation above. It follows that our<br />
HML specification of the property ‘the state has a livelock’ is<br />
LivelockNow max<br />
= 〈τ〉LivelockNow .<br />
Exercise 6.15 What would be the least solution of the above equation? <br />
Exercise 6.16 (M<strong>and</strong>atory) Consider the labelled transition system below.<br />
s<br />
a <br />
p<br />
<br />
τ<br />
τ <br />
τ q <br />
r<br />
Use the iterative algorithm for computing the set of states in that labelled transition<br />
system that satisfies the formula LivelockNow defined above. <br />
Exercise 6.17 This exercise is for those amongst you who f<strong>ee</strong>l they n<strong>ee</strong>d more<br />
practice in computing fixed points using the iterative algorithm.<br />
Consider the labelled transition system below.<br />
s<br />
<br />
τ<br />
τ<br />
<br />
s1 <br />
a<br />
τ <br />
s2 <br />
s3<br />
Use the iterative algorithm for computing the set of states in that labelled transition<br />
system that satisfies the formula LivelockNow defined above. <br />
τ