This shows you the differences between two versions of the page.

Both sides previous revision Previous revision | |||

cs-486:homework-10 [2017/03/14 16:45] egm [Problems] |
cs-486:homework-10 [2017/03/14 16:45] (current) egm [Problems] |
||
---|---|---|---|

Line 17: | Line 17: | ||

'''5. (8 points)''' For the tree in problem one, replace any sub-formulas with equivalent least or greatest fix point computations. | '''5. (8 points)''' For the tree in problem one, replace any sub-formulas with equivalent least or greatest fix point computations. | ||

- | '''6. (6 points)''' Consider the formula $\mathrm{EG} f$. Draw a transition system for which it takes 4 iterations on the equivalent fix-point calculation to reach the fix-point. | + | '''6. (6 points)''' Consider the formula $\mathrm{EG} f$. Draw a transition system for which it takes 4 iterations on the equivalent fix-point calculation to reach the fix-point. Show the labeled set of state on each iteration. |

- | '''7. (6 points)''' Consider the formula $\mathrm{EF} f$. Draw a transition system for which it takes 5 iterations on the equivalent fix-point calculation to reach the fix-point. | + | '''7. (6 points)''' Consider the formula $\mathrm{EF} f$. Draw a transition system for which it takes 5 iterations on the equivalent fix-point calculation to reach the fix-point. Show the labeled set of states on each iteration. |