3. Consider the program graph depicted in figure shown below. It has four program points and...

 

Transcribed Image Text:

3. Consider the program graph depicted in figure shown below. It has four program points and operates on a variable that can take integer values among 0, 1, 2 and 3 only. For readability we shall write the states (q, n) simply as qn where the first component gives a program point (chosen among a, b, c, d) and the second component gives the value of a variable (chosen among 0, 1, 2, 3). S=(ange (a,b,c,d) An E (0,1,2,3)) 1 = (a0, a1, a2, a3) AP = =(@ false x <3 a x:=x+1 >>0. xx-1 a) Define the labeling function by setting (for n = {0, 1, 2, 3}) b) Define and illustrate the transition relation 2/3 3. Consider the program graph depicted in figure shown below. It has four program points and operates on a variable that can take integer values among 0, 1, 2 and 3 only. For readability we shall write the states (q, n) simply as qn where the first component gives a program point (chosen among a, b, c, d) and the second component gives the value of a variable (chosen among 0, 1, 2, 3). S=(ange (a,b,c,d) An E (0,1,2,3)) 1 = (a0, a1, a2, a3) AP = =(@ false x <3 a x:=x+1 >>0. xx-1 a) Define the labeling function by setting (for n = {0, 1, 2, 3}) b) Define and illustrate the transition relation 2/3