Classi cation Diagram (Fig. 0.18)

Temporal Verification of Reactive Systems: Safety

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
CS256/Winter 2007 — Lecture #5 Zohar Manna Announcements Homework 2 due NOW Homework 3 out today, due Tue next week 5-1 Classifcation Diagram (Fig. 0.18) For each κ ∈ { safety , guarantee , obligation response , persistence , reactivity } the κ class of temporal formulas is characterized by a canonical κ -formula , with p , q , p i , q i – past formulas A formula is a κ -formula if it is equivalent to a canonical κ -formula A property is a κ -property if it is speci±able by a κ -formula 5-2 5-3 Closure o± Classes Reactivity : closure under , , ¬ Persistence : closure under , 1 0 p 1 0 q 1 0 ( p q ) 1 0 p 1 0 q 1 0 ( q « ( p S ( p ∧ ¬ q ))) Response : closure under , 0 1 p 0 1 q 0 1 ( p q ) 0 1 p 0 1 q 0 1 ( q « (( ¬ q ) S p )) Obligation : closure under , , ¬ Guarantee : closure under , 1 p 1 q 1 ( p q ) 1 p 1 q 1 ( Q p Q q ) Safety : closure under , 0 p 0 q 0 ( p q ) 0 p 0 q 0 ( p q ) 5-4
Background image of page 1

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

View Full Document Right Arrow Icon
Duality of classes Safety vs. Guarantee ¬ 0 p 1 ¬ p ¬ 1 p 0 ¬ p Response vs. Persistence ¬ 0 1 p 1 0 ¬ p ¬ 1 0 p 0 1 ¬ p 5-5 ClassiFcation Diagram strict inclusion between boxes P 1 ⊃ P 2 P 2 P 1 ± ± ± ± ± Example: Obligation Persistence ( 0 p i 1 q i ) 1 0 ( p i Q q i ) Theorem: Every quantifer Free temporal formula is equivalent to a reactivity formula. 5-6 ClassiFcation Diagram Con’t strict inclusion between conjunctions (Obligation and Reactivity ) In Obligation n +1 ^ i =1 [ 0 p i 1 q i ] n ^ i =1 [ 0 p i 1 q i ] In Reactivity n +1 ^ i =1 [ 0 1 p i 1 0 q i ] n ^ i =1 [ 0 1 p i 1 0 q i ] 5-7 Note: Properties speciFed by state formulas are safety proper- ties and guarantee properties, since p 0 ( first p ) p 1 ( first p ) but also 2 p, 2 2 p, . . . since 2 p 0 ( « first p ) 2 p 1 ( « first p ) 2 2 p 0 ( « « first p ) 2 2 p 1 ( « « first p ) 5-8
Background image of page 2
Reactivity n=1 n>1 Obligation Persistence Response Safety Guarantee 5-9 Example Formulas Safety 0 p conditional safety p 0 q 0 ( Q ( p first ) q ) p 0 q 0 ( Q p q ) waiting-for p W q 0 ( Q ¬ p Q q ) Guarantee 1 p conditional guarantee p 1 q 1 ± Q ( frst p ) q ² until p U q 1 ( q c p ) 5-10 Example formulas (Con’t) Obligation n +1 ^ i =1 ( 0 p i 1 q i ) p W ( 1 q ) 0 p 1 q Response 0 1 p response p 1 q 0 1 ± ( ¬ p ) B q ² justice 0 1 ( ¬ enabled ( τ ) last
Background image of page 3

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

View Full Document Right Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 8

Classi cation Diagram (Fig. 0.18) - CS256/Winter 2007...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online