Question and Answers 

Question : Assume that atomic propositions are three words “started”, “busy” and “requested”. Encode the following two statements in CTL.

1.  It is possible to go to a state where a process has started but is not ready (i.e., still busy) to deliver the result

2.  For any state, if request (of some resource) occurs, then it will eventually be started.

Answer:

1.  EF(started busy )

2.  AG(requested AF started )