Download presentation

Presentation is loading. Please wait.

Published byZain Bodily Modified over 3 years ago

1
an improved on-the-fly tableau construction for a real-time temporal logic Marc Geilen 12 July 2003 /e

2
Overview Introduction RT Temporal Logic Model-Checking Ingredients of the tableau procedure Example Conclusions

3
/e Temporal Logic Model Checking Timed Automaton A : ' A S System S Logical Property ' Product Automaton A S £ A : ' L (A S ) \L (A : ' )= S satisfies ' L (A S £ A ' )= iff

4
/e Real-time temporal logic Linear Temporal Logic, extended with quantitative dense time (e.g., pos real numbers) Timed state sequence is a sequence of states (valuations of propositions) and intervals p | : ' | ' 1 _ ' 2 | ' 1 U 6 d ' 2 or in positive normal form: p | : p | ' 1 _ ' 2 | ' 1 ^ ' 2 | ' 1 U 6 d ' 2 | ' 1 V 6 d ' 2 ( {p,q}, [0,1) ) ( {p},[1,4] ) ( {q}, (4, 7) ) …

5
/e Goal To have an efficient algorithm for translating real-time temporal logic formulas into timed automata to enable temporal logic model- checking for timed systems.

6
/e Previous work Alur, Feder and Henzinger, 96 Tableau construction for dense time Metric Interval Temporal Logic. Linear Temporal Logic with ' 1 U I ' 2 Establishing the connection between MITL and Timed Automata, not meant for implementation

7
/e Previous work Geilen, Dams, 00 Attempt at an on-the-fly tableau construction For fragment of MITL: ' 1 U I ' 2 where I=[0,d] Relied on restriction to timed state sequences with special type of intervals [a, b)

8
/e This work… introduces an on-the-fly tableau construction for a fragment of MITL ( ' 1 U I ' 2 where I=[0,d] ) without the restriction on intervals

9
/e Untimed OTF tableau revisited Label states with formulas Separation of constraints on current state and remainder of the state sequence Normal form: °'°'

10
/e Untimed OTF tableau revisited p U q = q _ p ^° p U q p p U q q ° p p U q q ° p p U q q °

11
/e Real-time tableaux Timed automata Intervals and locations

12
/e Real-time tableaux

13
/e Real-time tableaux

14
/e Real-time tableaux

15
/e Timers Timers measure/constrain distance between transitions p,x>0 p U 6 d q q x:=d [t 1,... p,x > 0 p U 6 d q q x:=d (t 1,...

16
/e p,x>0 p U 6 x q p U 6 d q p U 6 x q q x:=d [t 1,... p,x > 0 p U 6 x+ " q p U 6 d q p U 6 " q q x:=d (t 1,...

17
/e Release Formulas

18
/e Parts of the tableau automaton Locations: sets of formulas Propositional and timer constraints in locations are derived from the formulas Timers: for every bounded Until or Release formula (counting down) Edges: determined by a normal form procedure from singular to open and from open to singular intervals.

19
/e Disjunctive Temporal Normal forms Extended logic x 0, x>0 TS. ' (e.g., {x:=5}. ' ') ' 1 U 6 x ' 2, ' 1 U 6 x + " ' 2 ' 1 V 6 x ' 2, ' 1 V < x ' 2 ° '

20
/e Disjunctive Temporal Normal forms Extended logic and interpretation with timers ( ¾,I) |= À ' º : Timers --> IR ( ¾,I) |= À x>0if º (x)>0 ( ¾,I) |= À TS. ' if ( ¾,I) |= TS. À '

21
/e Disjunctive Temporal Normal Forms Normal form °Ã°Ã

22
/e Normal form rewrite rules Depend on interval type (s/o) ´ : equivalent for first singular interval {0} ´ : equivalent in initial open interval (0,… s o

23
/e Equivalences / rewrite rules Some examples: ' 1 U 6 d ' 2 ´ {x:=5}.( ' 1 U 6 x ' 2 ) ' 1 U 6 d ' 2 ´ {x:=5}.( ' 1 U 6 x+ " ' 2 ) ' 1 U 6 d ' 2 ^ ' 1 U 6 x ' 2 ´ ' 1 U 6 x ' 2 (if x 6 d) ' 1 U 6 x ' 2 ´ ' 2 _ ( x > 0 ^ ' 1 ^ ° ' 1 U 6 x ' 2 ) (`the Next operator refers to the next interval) s o

24
/e Example

25
/e Example

26
/e Example

27
/e Dealing with interval types timed automata cannot directly enforce interval types But alternation of singular and open intervals can be enforced by a well-known trick

28
/e Outline of the algorithm Get initial locations from NF of initial formula As long as there are locations that have not been expanded –Expand one of these locations from its Next formulas according to its type s/o

29
/e Application of the algorithm § 6 5 p = true U 6 5 p

30
/e Application of the algorithm true U 6 5 p ´ [x:=5]. true U 6 x p s

31
/e Application of the algorithm [x:=5]. true U 6 x p ´ [x:=5].p _ [x:=5].x>0 ^° true U 6 x p s

32
/e Application of the algorithm

33
/e Application of the algorithm true U 6 x p ´ p _ x>0 ^° true U 6 x p o

34
/e Application of the algorithm true U 6 x p ´ p _ x>0 ^° true U 6 x p s

35
/e Application of the algorithm true ´ true ^ ° true

36
/e ¤ 6 100 § 6 5 p = false V 6 100 (true U 6 5 p)

37
/e Conclusions and Future work OTF tableau construction algorithm Lifts the constraints imposed in an earlier paper Optimizations possible Weakly monotonic time for interleaving semantics Simple extensions of the logic Implementation

38
/e Thanks!

Similar presentations

OK

Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec. 2010 Yuan Ren, Kees van Deemter and Jeff.

Charting the Potential of Description Logic for the Generation of Referring Expression SELLC, Guangzhou, Dec. 2010 Yuan Ren, Kees van Deemter and Jeff.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on attribution theory and child abuse Disaster management ppt on flood Download ppt on teamviewer 9 Perspective view ppt on ipad Ppt on fibonacci numbers stock Ppt on power system topics Ppt on service oriented architecture example Ppt on directors under companies act 1956 Ppt on matter in our surroundings Ppt on microsoft excel 2007