Nested Waiting-for Formulas

Temporal Verification of Reactive Systems: Safety

Info icon This preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon
CS256/Winter 2007 – Lecture #10 Zohar Manna 10-1
Image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Nested Waiting-for Formulas q m q m - 1 q 1 interval interval interval q 0 [ )[ )[ )[ ) p ϕ m ϕ m - 1 ϕ 1 ϕ 0 Rule nwait (nested waiting-for) For assertions p , q 0 , q 1 , . . . , q m and ϕ 0 , ϕ 1 , . . . , ϕ m N1. p m _ j =0 ϕ j N2. ϕ i q i for i = 0 , 1 , . . . , m N3. { ϕ i }T _ j i ϕ j for i = 1 , . . . , m p q m W q m - 1 · · · q 1 W q 0 10-2
Image of page 2
Nested Waiting-for Formulas (Cont’d) ϕ i -interval ϕ j -interval p p p p τ τ where j < i Premise N3 states that for each assertion ϕ i , each tran- sition τ ∈ T either preserves ϕ i or leads to some ϕ j , with j < i . 10-3
Image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Example: Program mux-pet1 (Fig. 3.4) An example of a nested waiting-for formula is 1-bounded overtaking for mux-pet1 : at - 3 | {z } p ¬ at - m 4 | {z } q 3 W at - m 4 | {z } q 2 W ¬ at - m 4 | {z } q 1 W at - 4 | {z } q 0 It states that when process P 1 is at 3 , process P 2 can enter its critical section at most once ahead of process P 1 . 10-4
Image of page 4
With the following strengthenings all premises of rule nwait become state-valid. p : at - 3 ϕ 3 : at - 3 ∧ ¬ at - m 4 at - m 3 s = 1 P 2 has priority over P 1 ϕ 2 : at - 3 at - m 4 ϕ 1 : at - 3 ∧ ¬ at - m 4 ( at - m 3 s = 2) P 1 has priority over P 2 ϕ 0 = q 0 : at - 4 or equivalently, p : at - 3 ϕ 3 : at - 3 at - m 3 s = 1 ϕ 2 : at - 3 at - m 4 ϕ 1 : at - 3 ( at - m 0 .. 2 , 5 ( at - m 3 s = 2)) ϕ 0 = q 0 : at - 4 10-5
Image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Concatenation of waiting-for formulas Rule conc-w p q m W · · · q 1 W q 0 q 0 r n W · · · W r 0 p q m W · · · W q 1 W r n W · · · W r 0 q m · · · q 1 [ ) [ ) p q 0 r n · · · r 1 [ ) [ ) q 0 r 0 10-6
Image of page 6
Collapsing of waiting-for formulas Rule coll-w For i > 0 p q m W · · · W q i +1 W q i W · · · W q 0 p q m W · · · W ( q i +1 q i ) W · · · W q 0 q m · · · q i +1 q i · · · q 1 [ ) [ )[ ) [ ) p q 0 q m · · · q i +1 q i · · · q 1 [ ) [ ) [ ) p q 0 10-7
Image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Basic Verification Diagrams
Image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern