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 3 Due Friday, May 20th Do not discuss the problems with anyone other than the instructor. 1. Give a Buchi automaton that corresponds to the LTL property GFp . Given the transition system T = ( S,I,R ) where I = { } , S = { , 1 , 2 } and R = { (0 , 0) , (0 , 1) , (1 , 2) , (2 , 1) , } , assume that the only state which satisfies the atomic proposition p is 1. Show the Buchi automaton A T that corresponds to this transition system (based on the construction given in the lecture notes), and the product automaton A T A f . If there is one, show an accepting run of the product automaton and show the path in the transition system T which corresponds to this run and satisfies the LTL formula GFp . Does the transition system T satisfy the property FG p ? Why? 2. Construct a Buchi automaton that corresponds to the LTL property p U ( q X p ) using the LTLBuchi automata translation algorithm. Show the intermediate steps (like the example in the lecture notes)....
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