This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 267 – Spring 2011 – Homework Assignment 4 Due Friday, June 3rd Do not discuss the problems with anyone other than the instructor. 1. Consider a transition system with two states encoded using a single boolean variable x , where the initial state is ¬ x and the transition relation is defined as x ∧ x ′ ∨ ¬ x ∧ x ′ . (a) Show the Boolean logic formula that corresponds to unrolling the above transition system twice starting from the initial state. (b) Assume that we would like to check the property EX(EX( ¬ x )). Using the result from part (a), construct a boolean logic formula F that is satisfiable if the initial state satisfies the property. Give a satisfying assignment to the variables in the formula F if F is satisfiable. (c) Now, assume that we would like to check the property EF( x ). Again, using the result from part (a), construct a boolean logic formula F that is satisfiable if the initial state satisfies the formula EF( x ) within two steps of execution. Give a satisfying assignment to the variables in the formula) within two steps of execution....
View
Full
Document
This note was uploaded on 12/27/2011 for the course CMPSC 267 taught by Professor Bultan during the Fall '09 term at UCSB.
 Fall '09
 bultan

Click to edit the document details