Top Banner
LINEAR TEMPORAL LOGIC Fall 2013 Dr. Eric Rozier
19

LINEAR TEMPORAL LOGIC

Feb 23, 2016

Download

Documents

natara

LINEAR TEMPORAL LOGIC. Fall 2013 Dr. Eric Rozier. Propositional Temporal Logic. Does the following hold?. yes. Propositional Temporal Logic. Does the following hold?. no. G F p p holds infinitely often F G p Eventually, p holds henceforth G ( p => F q ) - PowerPoint PPT Presentation
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: LINEAR TEMPORAL LOGIC

LINEAR TEMPORAL LOGIC

Fall 2013Dr. Eric Rozier

Page 2: LINEAR TEMPORAL LOGIC

Propositional Temporal Logic

Does the following hold?

yes

Page 3: LINEAR TEMPORAL LOGIC

Propositional Temporal Logic

Does the following hold?

no

Page 4: LINEAR TEMPORAL LOGIC

Examples: What do they mean?

G F pp holds infinitely often

F G pEventually, p holds henceforth

G( p => F q ) Every p is eventually followed by a q

F( p => (X X q) )Every p is followed by a q two reactions

later

Remember:Gp p holds in all statesFp p holds eventuallyXp p holds in the next state

Page 5: LINEAR TEMPORAL LOGIC

Examples: Write in Temporal Logic

1. “Whenever the iRobot is at the ramp-edge (cliff), eventually it moves 5 cm away from the cliff.”• p – iRobot is at the cliff• q – iRobot is 5 cm away from the cliff

• G (p => F q)

2. “Whenever the distance between cars is less than 2m, cruise control is deactivated”• p – distance between cars is less than 2 m• q – cruise control is active

• G (p => X ! q)

Page 6: LINEAR TEMPORAL LOGIC

Remember, LTL Formulas are Formulas

• Suppose the robot must visit a set of n locations l1, l2, …, ln. Let pi be an atomic formula that is true if and only if the robot visits location li.

• Express the following: – The robot must eventually visit at least one of the

n locations.

Page 7: LINEAR TEMPORAL LOGIC

Remember, LTL Formulas are Formulas

• Suppose the robot must visit a set of n locations l1, l2, …, ln. Let pi be an atomic formula that is true if and only if the robot visits location li.

• Express the following: – The robot must eventually visit all n locations, but

in any order.

Page 8: LINEAR TEMPORAL LOGIC

Remember, LTL Formulas are Formulas

• Suppose the robot must visit a set of n locations l1, l2, …, ln. Let pi be an atomic formula that is true if and only if the robot visits location li.

• Express the following: – The robot must eventually visit all n locations, in

numeric order.

Page 9: LINEAR TEMPORAL LOGIC

What does this property mean?

• F(p => Xq)

• Is it satisfied by this trace?

p -> p -> p -> __ -> q -> p -> …

Page 10: LINEAR TEMPORAL LOGIC

What does this property mean?

• F(p => Xq)

• Is it satisfied by this trace?

p -> p -> p -> __ -> q -> p -> q -> …

Page 11: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• pUq

Page 12: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• pUq

Page 13: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• qRp

Page 14: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• qRp

Page 15: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• qRp

Page 16: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• qRp

Page 17: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• F(p & XXX !q)

Page 18: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• F(p & XXX !q)

Page 19: LINEAR TEMPORAL LOGIC

Does this automaton satisfy the property?

• F(p & XXX !q)