slides - Summer School Marktoberdorf

More documents

Recommendations

Info

ES are often Safety Critical How to achieve ES that are: • correct • predicable • dependable • fault tolerant • ressource minial • cheap .. Model-Based Development 300 horse power 100 processors Marktoberdorf Summer School, 2012 Kim Larsen [6]
System Description Requirement A( req ) A} grant) Model Checking TOOL A( req ) A} t
Page 1 and 2: Model-based Verification and Valida
Page 3 and 4: Aalborg Aarhus Aalborg Copenhagen A
Page 5: ES are Pervasive Characteristica: M
Page 9 and 10: Overview Introduction to Timed Aut
Page 11 and 12: UPPAAL (1995- ) @AALborg Kim G Lar
Page 13 and 14: A Dumb Light Controller Marktoberdo
Page 15 and 16: A Timed Automata (Semantics) States
Page 17 and 18: Intelligent Light Controller Transi
Page 19 and 20: Timed Automata (formally) Marktober
Page 21 and 22: Timed Automata (formally) Marktober
Page 23 and 24: Timed Automata: Example invariant M
Page 25 and 26: Example a b c Marktoberdorf Summer
Page 27 and 28: Example a b c Marktoberdorf Summer
Page 29 and 30: Networks Light Controller & User pr
Page 31 and 32: Network Semantics (URGENT synchroni
Page 33 and 34: User press? 0.2 release? … press?
Page 35 and 36: Informationsteknologi Light Control
Page 37 and 38: UPPAAL Modeling & Specification
Page 39 and 40: Train Crossing appr stop list Stopa
Page 41 and 42: UPPAAL Help Marktoberdorf Summer Sc
Page 43 and 44: Case Studies: Controllers Gearbox
Page 45 and 46: Using UPPAAL as Back-end Vooduu: v
Page 47 and 48: Decidability and Symbolic Verificat
Page 49 and 50: Reachability ? a b c Reachable from
Page 51 and 52: Time Abstracted Bisimulation Markto
Page 53 and 54: Region Graph Marktoberdorf Summer S
Page 55 and 56: An Example Marktoberdorf Summer Sch
Page 57 and 58:
Fundamental Results Reachability
Page 59 and 60:
Regions - From Infinite to Finite M
Page 61 and 62:
Zones - Operations y y (n, 2·x·4
Page 63 and 64:
Datastructures for Zones Differenc
Page 65 and 66:
Future (DBMs) D 1
Page 67 and 68:
Forward Reachability PW Waiting Fin
Page 69 and 70:
Forward Reachability PW Waiting Ini
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Symbolic Exploration Reachable? Mar
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Verification Options
Page 85 and 86:
State Space Reduction Marktoberdorf
Page 87 and 88:
Over/Under Approximation Declared S
Page 89 and 90:
Under-approximation Bitstate Hashin
Page 91 and 92:
Extrapolation Marktoberdorf Summer
Page 93 and 94:
Abstractions Marktoberdorf Summer S
Page 95 and 96:
Location Dependency Marktoberdorf S
Page 97 and 98:
Experiments Marktoberdorf Summer Sc
Page 99 and 100:
Fischer CSMA/CD Advanced Extrapolat
Page 101 and 102:
Open Problems Fully symbolic explo
Page 103 and 104:
Overview Timed Automata Schedulin
Page 105 and 106:
A C D Task Graph Scheduling - Examp
Page 107 and 108:
A C D Task Graph Scheduling - Examp
Page 109 and 110:
Experimental Results Marktoberdorf
Page 111 and 112:
A C D Task Graph Scheduling - Revis
Page 113 and 114:
A C D Task Graph Scheduling - Revis
Page 115 and 116:
A simple example Q: What is cheapes
Page 117 and 118:
Priced Zones Marktoberdorf Summer S
Page 119 and 120:
Symbolic Branch & Bound Algorithm M
Page 121 and 122:
Example: Aircraft Landing x >= 4 x=
Page 123 and 124:
Symbolic Branch & Bound Algorithm M
Page 125 and 126:
Optimal Infinite Scheduling Maximiz
Page 127 and 128:
Optimal Infinite Scheduling Maximiz
Page 129 and 130:
Discount Optimality Larsen, Fahrenb
Page 131 and 132:
Multiple Objective Scheduling 16,10
Page 133 and 134:
Managing Resources Marktoberdorf Su
Page 135 and 136:
Energy Constrains Energy is not on
Page 137 and 138:
L-Problem for 1-Clock Case Theorem:
Page 139 and 140:
Generic Module for Inc/Dec Marktobe
Page 141 and 142:
New Approach: Energy Functions Max
Page 143 and 144:
Exponential PTA General Strategy Sp
Page 145 and 146:
Multiple Costs & Clocks LU Problem
Page 147 and 148:
Multiple Clocks & 1 Cost L Problem
Page 149 and 150:
Multiple Clocks & 1 Cost L Problem
Page 151 and 152:
Multiple Costs & 0 Clocks Uli Fahre
Page 153 and 154:
Timed Games & Timed Interfaces Kim
Page 155 and 156:
Timed Game Automata & Synthesis con
Page 157 and 158:
Computing Winning States Marktoberd
Page 159 and 160:
Symbolic On-the-fly Algorithms for
Page 161 and 162:
Synthesis (ex Train Gate) Environme
Page 163 and 164:
Plastic Injection Molding Machine M
Page 165 and 166:
The Machine (consumption) Infinite
Page 167 and 168:
Machine (uncontrollable) Marktoberd
Page 169 and 170:
Tool Chain Strategy Synthesis TIGA
Page 171 and 172:
Real-Time version of Milner’s Sch
Page 173 and 174:
Marktoberdorf Summer School, 2012 C
Page 175 and 176:
Operations on Specifications Logic
Page 177 and 178:
Refinements, Implementations, Consi
Page 179 and 180:
Let S T i. ii. iii. Definition I S
Page 181 and 182:
Overall Specification grant patent
Page 183 and 184:
Assume-Guarantee Guarantee Assumpti
Page 185 and 186:
w i+1 rec i+1 w i N i+1 N i Marktob
Page 187 and 188:
w i+1 rec i+1 w i N i+1 G N i Markt
Page 189 and 190:
Marktoberdorf Summer School, 2012 E
Page 191 and 192:
Open Problems Marktoberdorf Summer
Page 193 and 194:
UPPAAL Tool Suit Editor Marktoberdo
Page 195 and 196:
UPPAAL SMC Performance properties P
Page 197 and 198:
Stochastic Semantics of TA Exponent
Page 199 and 200:
Stochastic Semantics of Timed Autom
Page 201 and 202:
Logical Properties Marktoberdorf Su
Page 203 and 204:
SMC Algorithms -1 Quantitative (Est
Page 205 and 206:
SMC Algorithms -3 t Probability Com
Page 207 and 208:
Queries in UPPAAL SMC Pr[ = 0.8 Pr[
Page 209 and 210:
Queries in UPPAAL SMC simulate 1 [
Page 211 and 212:
Extensions of UPPAALs TA Constant
Page 213 and 214:
Page 215 and 216:
Page 217 and 218:
Stochastic Hybrid Systems A Bounci
Page 219 and 220:
LMAC
Page 221 and 222:
added power Marktoberdorf Summer Sc
Page 223 and 224:
10-Node Star The first collision: h
Page 225 and 226:
Framework Design Space Exploration
Page 227 and 228:
Control Strategies - MODELS Marktob
Page 229 and 230:
Results - Simulations Marktoberdorf
Page 231 and 232:
Results - Comfort Pr[comfort=2*day)
Page 233 and 234:
Result - User Profile Pr[Monitor.en
Page 235 and 236:
CMTC Model Marktoberdorf Summer Sch
Page 237 and 238:
Amplitudes & Periods Amplitude E[
Page 239 and 240:
SMC for MITL
Page 241 and 242:
Metric Interval Temporal Logic MIT
Page 243 and 244:
Tableaux Construction Marktoberdorf
Page 245 and 246:
Experiments How exact is the over
Page 247 and 248:
www.uppaal.{org,com} Marktoberdorf
show all

slides - Summer School Marktoberdorf

Create successful ePaper yourself

Delete template?

Save as template?