Embed Size (px)
DESCRIPTION
EECE 396-1 Hybrid and Embedded Systems: Computation. T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and Computer Science Vanderbilt University 300 Featheringill Hall April 6-15, 2004 [email protected] - PowerPoint PPT Presentation
Citation preview
EECE 396-1Hybrid and Embedded Systems: Computation
T. John Koo, Ph.D.Institute for Software Integrated Systems
Department of Electrical Engineering and Computer ScienceVanderbilt University
300 Featheringill HallApril 6-15, 2004
[email protected]://www.vuse.vanderbilt.edu/~kootj
2
Analysis: Timed Automata
3
Topics Bisimular Transition Systems
Transition Systems Forward and Backward Reachability Algorithms Simulation and Bisimulation Relations Transition Systems and Quotient Transition Systems Bisimulation between Transition Systems Bisimulation Algorithm
Bisimulations of Timed Automata Executions of Timed Automata Region Equivalent Relation and Partition
Ref: [1] R. Alur, T.A. Henzinger, and P.-H. Ho.
Automatic Symbolic Verification of Embedded Systems. IEEE Transactions on Software Engineering 22:181-201, 1996.
[2] J. Lygeros, Lecture Notes on Hybrid Systems, Cambridge, 2003. [3] J. Lygeros, C. Tomlin, and S. Sastry, The Art of Hybrid Systems, July 2001.
4
Analysis: Timed AutomataBisimular Transition Systems
5
Transition System
6
Transition System
7
Transition System
8
Transition System
9
Forward and Backward Reachability Algorithms
10
Forward and Backward Reachability Algorithms
11
Forward and Backward Reachability Algorithms
12
Forward and Backward Reachability Algorithms
13
Simulation and Bisimulation Relations
14
Simulation and Bisimulation Relations
15
Simulation and Bisimulation Relations
16
Simulation and Bisimulation Relations
17
Simulation and Bisimulation Relations
18
Simulation and Bisimulation Relations
19
Simulation and Bisimulation Relations
20
Simulation and Bisimulation Relations
21
Simulation and Bisimulation Relations
22
Simulation and Bisimulation Relations
23
Bisimulation Algorithm
How?
24
Bisimulation Algorithm
25
Bisimulation Algorithm
26
Bisimulation Algorithm
27
Bisimulation Algorithm
28
Bisimulation Algorithm
29
Bisimulation Algorithm
30
Bisimulation Algorithm
31
Bisimulation Algorithm
32
Bisimulation Algorithm
33
Bisimulation Algorithm
34
Bisimulation Algorithm
35
Bisimulation Algorithm
36
Bisimulation Algorithm
37
Bisimulation Algorithm
38
Bisimulation Algorithm
39
Bisimulation Algorithm
40
Bisimulation Algorithm
41
Bisimulation Algorithm
42
Analysis: Timed AutomataBisimulations of Timed Automata
43
Timed Automata
44
Timed Automata
45
Timed Automata
46
Timed Automata
47
Timed Automata
48
Timed Automata
49
Timed Automata
50
Timed Automata
51
Timed Automata
52
Timed Automata
53
Hybrid Automaton
54
Hybrid Automaton
i
012
tfinite
i
012
tinfinite
55
Hybrid Automaton
i
012
tfinite
i
012
tZeno
56
Hybrid Automaton Non-Determinism
Multiple Executions for the same initial condition Sources of non-determinism
Non-Lipschitz continuous vectorfields, f Multiple discrete transition destinations, E & G Choice between discrete transition and continuous evolution, D & G Non-unique continuous state assignment, R
Definition: A hybrid automaton H is deterministic if for all initial conditions there exists a unique maximal sequence
57
Hybrid Automaton Blocking
No Infinite executions for some initial states Source of blocking
Cannot continue in domain due to reaching the boundary of the domain where no guard is defined
Have no place to make discrete transition to
Definition: A hybrid automaton H is non-blocking if for every initial condition there exists at least one infinite execution
?
58
Hybrid Automaton Zeno Executions
Infinite execution defined over finite time Infinite number of transitions in finite time Transition times converge
Definition: A hybrid automaton H is zeno if there exists an initial condition for which all infinite executions are Zeno
59
Transition System
60
Transition System
61
Region Equivalence Relation
62
Region Equivalence Relation
63
Timed Automata
64
Timed Automata
65
Timed Automata
66
Region Equivalence Relation
67
Region Equivalence Relation
68
Region Equivalence Relation
69
Region Equivalence Relation
70
Region Equivalence Relation
71
Region Equivalence Relation
72
Region Equivalence Relation
73
Region Equivalence Relation
74
Region Equivalence Relation
75
Region Equivalence Relation
76
Region Equivalence Relation
77
Region Equivalence Relation
78
Region Equivalence Relation
79
End
