Selected Topics in Functional Verification of SOCs

Assignment 1 --- Submit by 19th Sep 2013 Marks = 60. a) Draw the parse trees for the following LTL formulas : 1) Fp Gq pWr 2) F(p Gr) V q U p 3) p W (q W r) 4) p U (Fr V G q q W r) 5) GF p F(q V s)

[10]

b) Consider the transition system of Figure 1. For each of the LTL formulas , (i). Find a path from the initial state s3 which satisfies ; (ii). Determine whether M, s3 |= . 1) Ga 2) a U b 3) a U X(a b) 4) X b G(a Vb) 5) X (a b) F (a b) 6) Define 3 additional LTL formulas on the transition system of Figure 1. [18] c) List all the sub-formulas of the LTL formula p U (Fr V G q your interpretation of the LTL formula in English. q W r). Give [10]

s1

a, b

a,b

s2

s3

a,b

a,b

s4

Figure 1

d) For the Boolean formula f(x,y,z) = y+z.x+z.y+x.y, 1). using the variable ordering x,y,z find its Reduced Ordered Binary Decision Diagram (ROBDD) and 2) its Universal and Existential Quantification w.r.t. variable y. [12] e) Using the clauses defined for the basic Boolean and temporal operators in LTL, prove the following equivalence : (R) U . [10]

---------------------END---------------------