Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

CSI 5342: Temporal Logic Objectives and Learning Outcomes - Prof. Paul C. Grabow, Assignments of Computer Science

The objectives and learning outcomes for a university course on temporal logic. Topics covered include interpreting and writing ctl* formulas, understanding temporal logic operators, and creating execution trees. Students will also learn about the differences between ctl*, ctl, and pltl, and the concept of a kripke structure. The document assumes prior knowledge of automata and temporal logic.

Typology: Assignments

Pre 2010

Uploaded on 08/16/2009

koofers-user-3sx-1
koofers-user-3sx-1 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSI 5342
Objectives: Temporal Logic 6/6/2008
Reference: Bérard chapter 2
Know how to
1. Interpret any CTL* formula, i.e., translating it into English
2. Write a CTL* formula based on an English statement
3. Create an execution tree from an automaton, i.e., unwind a FSM
4. Apply the seven equivalence relations to translate any CTL expression into one that only
uses EX, EG, or EU
Be able to
1. Explain why temporal logic is better than first-order logic when describing system
behavior that involves time.
2. Describe the dual of G
3. Describe the dual of F
4. Describe the difference between the U and the W operators
5. Explain each of the temporal logic operators
a. G
b. F
c. X
d. U
e. W
f. A
g. E
6. Describe each of the following by giving an example:
a. Atomic proposition
b. Boolean combinatory
c. Temporal combinatory
d. Path quantifiers
7. Describe a Kripke structure. How does it differ from an automaton?
8. Describe what it mean for a formula to be “satisfied in a given situation”
9. Explain why time is discrete in CTL*, rather than continuous or dense
10. Explain the differences among CTL*, CTL, and PLTL.
11. Explain Fig. 2.2
Understand
The examples used in class and in the handouts.

Partial preview of the text

Download CSI 5342: Temporal Logic Objectives and Learning Outcomes - Prof. Paul C. Grabow and more Assignments Computer Science in PDF only on Docsity!

CSI 5342

Objectives: Temporal Logic 6/6/

Reference : Bérard chapter 2

Know how to

  1. Interpret any CTL* formula, i.e., translating it into English
  2. Write a CTL* formula based on an English statement
  3. Create an execution tree from an automaton, i.e., unwind a FSM
  4. Apply the seven equivalence relations to translate any CTL expression into one that only uses EX, EG, or EU

Be able to

  1. Explain why temporal logic is better than first-order logic when describing system behavior that involves time.
  2. Describe the dual of G
  3. Describe the dual of F
  4. Describe the difference between the U and the W operators
  5. Explain each of the temporal logic operators a. G b. F c. X d. U e. W f. A g. E
  6. Describe each of the following by giving an example: a. Atomic proposition b. Boolean combinatory c. Temporal combinatory d. Path quantifiers
  7. Describe a Kripke structure. How does it differ from an automaton?
  8. Describe what it mean for a formula to be “satisfied in a given situation”
  9. Explain why time is discrete in CTL*, rather than continuous or dense
  10. Explain the differences among CTL*, CTL, and PLTL.
  11. Explain Fig. 2.

Understand

The examples used in class and in the handouts.