PhD Thesis Defense June 23, 2008
|
|
- Josephine Rodgers
- 5 years ago
- Views:
Transcription
1 1 Georgios E. Fainekos PhD Thesis Defense June 23, 2008 Department of Computer Information Science University of Pennsylvania fainekos at seas upenn edu
2 Embedded in : Automotive Systems 2 Latest BMW : 72 networked microprocessors 90% of innovation on electronics
3 Embedded in : Automotive Systems 3
4 Embedded in : Avionics 4 Boeing 777 : 1280 networked microprocessors 50% of design cost ($ time)
5 Embedded in : Medical Devices 5 Vision : Doctor-on-a-chip Operating room of the future Remote monitoring of elderly Digital hospital
6 Embedded in : Robotics 6 UAV UGV Bayraktar, Bayraktar, Fainekos, Fainekos, Experimental Experimental Cooperative Cooperative Control Control of of Fixed-Wing Fixed-Wing Unmanned Unmanned Aerial Aerial Vehicles, Vehicles, CDC CDC 07 07
7 Cyber-Physical Systems : Challenges 7 Composition Modularity Important for heterogeneous systems Robustness, Safety, Security Security cannot always be guaranteed, is system robust? Control Hybrid Systems Closing the loops at all levels Computational Abstractions New models programming languages Reconfigurable / Networked Systems Sensor networks embedded in critical infrastructure Model-based Development From models to platform-depended implementations Verification, Validation, Certification Safety-critical computing systems Particularly important for government agencies Education Training No education in cyber-physical systems Education in system architecture/integration?
8 Contributions of the thesis 8 A new notion of robustness for temporal logics Fainekos Robustness of temporal logic specifications, FATES/RV 2006 Fainekos Robustness of TL specifications for continuous time signals, TCS (Submitted) From discrete time to continuous time Fainekos Robust Sampling for MITL specifications, FORMATS 2007 Fainekos Robustness of TL specifications for continuous time signals, TCS (Submitted) Bounded time TL verification of dynamical systems Fainekos, Girard Temporal logic verification using simulation, FORMATS 2006 Fainekos MTL Robust Testing for LPV Systems, RTSS 2008 (Submitted) Hybrid automata synthesis from TL specifications Fainekos et al, Hierarchical Synthesis of Hybrid Controllers from TL Specifications, HSCC 2007 Fainekos et al, Temporal Logic Motion Planning for Dynamic Robots, Automatica (Accepted) Fainekos, Kress-Gazit Temporal Logic Motion Planning for Mobile Robots, ICRA 2005 Fainekos, Kress-Gazit Hybrid Controllers for Path Planning, CDC 2005
9 Talk Overview 9 Introduction Application areas Challenges Thesis Contributions Testing / Verification (Towards Certification) Problem Specification language (MTL) Robustness of Temporal Logic Specifications for signals From Discrete Time to Continuous Time From Signals to Systems Analog system robust testing / verification Hybrid system robust testing Final remarks Future work
10 Certification / Verification 10 Does the system satisfy the specification? Model-based code generation Cyber-Physical System System Specification Implementation Algorithm/Process YES NO Where how the system fails?
11 Example : Verifying a transmission line 11 V R1 L1 C1 R2 L2 D1 C2 Cc1 V1 D2 Cc2 V2 Rn Ln Cn Dn Ccn Vn System: x& ( t) = A x( t) + bu U out ( t) = Cx( t) Step input (t > 0): i i in ( t) Steady state at t=0: Property: Φ =Gp 1 F [0,0.85] G p 2 O (p 1 ) = [-1.5,1.5] O (p 2 ) = [0.8,1.2] Initial conditions: Τ Uncertain parameters e.g. Cœ[a 1,a 2 ]
12 What can we verify? 12 Verifying Cyber systems is a decidable problem The Turing award this year was given to the founders of model checking : E. Clark, A. Emerson J. Sifakis Cyber-System Specification Algorithm YES NO Applications in verification of software, hardware, protocols etc. Many software toolboxes : SPIN, SMV etc
13 What about hybrid (embedded) systems? 13 In general, verifying a hybrid system is undecidable R. Alur C. Courcoubetis N. Halbwachs T. A. Henzinger P.-H. Ho X. Nicollin A. Olivero J. Sifakis S. Yovine, The algorithmic analysis of hybrid systems, TCS Henzinger, Kopke, Puri, Varaiya, What's decidable about hybrid automata? Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. Cyber-Physical System System Specification Algorithm YES NO
14 What can be done? 14 Previous approaches to the undecidability problem : identifying decidable classes : Alur, Henzinger, Lafferriere, semi-decidable algorithms : Krogh, Alur, Henzinger, Dang, Ivančić, Girard, Mitchell, Tomlin, Maler, barrier certificates : Prajna, Jadbabaie, systematic simulations / model based testing : Krogh, Maler, Dang, Lee, Sokolsky, Kumar, Esposito, LaValle, Vardi, In Practice : Simulations! Schuller, Brangs, Rothfuß, Lutz, Breit: Development methodology for dynamic stability control systems, International Journal of Vehicle Design Vol. 28, No.1/2/3 pp Gielen, Rutenbar: Computer-Aided Design of Analog Mixed-Signal Integrated Circuits, Proceedings of the IEEE, Vol. 88, No. 12, 2000
15 ROBUST SIMULATIONS 15 Reach(I) I Advantages : A finite number of simulations Coverage guarantees Scales as well as simulation scales More complicated specifications than safety Almost no parameters to set besides the simulation parameters New tools : we need metrics
16 Talk Overview 16 Introduction Application areas Challenges Thesis Contributions Testing / Verification (Towards Certification) Problem Specification language (MTL) Robustness of Temporal Logic Specifications for signals From Discrete Time to Continuous Time From Signals to Systems Analog system robust testing / verification Hybrid system robust testing Final remarks Future work
17 Metric Temporal Logic (MTL) 17 until release Syntax: Φ ::= T ^ p Ÿ p Φ 1 Φ 2 Φ 1 Φ 2 Φ 1 U I Φ 2 Φ 1 R I Φ 2 I can be of any bounded or unbounded interval of +, but I «i.e. I = [0,+ ), I = [2.5,9.8] Derived operators: Eventually (in the future) Always (globally) F I Φ := T U I Φ G I Φ := ^R I Φ Koymans 90, Specifying real-time properties with metric temporal logic
18 LTL intuition 18 G a -always a a a a a a a F a eventually a * * * a * * X a next state a * a * * * * a U b a until b a B b a before b a * a a b * * * a * b *
19 MTL : An example for signals 19 a t I time F I a I a Boolean abstraction t I time
20 Temporal Logic Testing 20 LTL / MTL Φ =Gp 1 F [0,Τ] G p 2 A/D Boolean abstraction Monitoring Algorithm Truth Value {^,T} [Maler Nickovic 04] [Thati Rosu 04] [Rosu Havelund 05] [Geilen 01] others
21 Talk Overview 21 Introduction Application areas Challenges Thesis Contributions Testing / Verification (Towards Certification) Problem Specification language (MTL) Robustness of Temporal Logic Specifications for signals From Discrete Time to Continuous Time From Signals to Systems Analog system robust testing / verification Hybrid system robust testing Final remarks Future work
22 Two signals that satisfy the same spec, but 22 p s 1 MTL MTL Spec: Spec: G(p G(p 1 YF 1 YF 2 p 2 2 ) 2 ) s p 1
23 LTL to motion planning 23 F(p F(p 2 2 F(p F(p 3 3 F(p F(p 4 4 (p (p 2 2 p 3 ) 3 ) U p 1 ))) 1 ))) p 1 p 2 p 1 p 2 p 3 p 4 p 3 p 4 Fainekos, Fainekos, Kress-Gazit Kress-Gazit Temporal Temporal Logic Logic Motion Motion Planning Planning for for Mobile Mobile Robots, Robots, ICRA ICRA Fainekos, Fainekos, Kress-Gazit Kress-Gazit Hybrid Hybrid Controllers Controllers for for Path Path Planning, Planning, CDC CDC
24 Robustness of Temporal Logics 24 LTL / MTL Φ =G(p 1 YF 2 p 2 ) Monitor/Tester Robustness parameter ε»{± } ε ε Fainekos Fainekos Robustness Robustness of of temporal temporal logic logic specifications, specifications, FATES/RV FATES/RV Fainekos Fainekos Robustness Robustness of of temporal temporal logic logic specifications specifications for for signals, signals, Submitted Submitted to to TCS, TCS,
25 Related Research 25 Robustness in temporal logics WRT time : Huang, Voeten, Geilen 03, Real-time property preservation in approximations of timed systems Henzinger, Majumdar, Prabhu 05, Quantifying similarities between timed systems WRT state : de Alfaro, Faella, Stoelinga 04, Linear Branching Metrics for Quantitative Transition Systems Lamine, Kabanza 00, Using fuzzy TL for monitoring behavior-based mobile robots de Alfaro, Faella, Henzinger, Majumdar, Stoelinga 04, Model Checking Discounted Temporal Properties Huth, Kwiatkowska 97, Quantitative analysis model checking
26 (Signed) Distance 26 Let x X be a point, C X be a set d be a metric. Then we define dist d (x, C) := inf{d(x, y) y cl(c)} depth d (x, C):=dist d (x, X\C) Dist d (x, C):= è à dist d (x, C) depth d (x, C) if x 6 C if x C X dist d (x,c) x x x C depth d (x,c) B d (x,ε)
27 Definition of robustness for signals 27 Given a signal s, we can define the robustness degree as ε ε := := Dist Dist ρ (s, ρ (s, L(Φ)) ρ(s,s ) = sup {d(s(t),s (t)) t œ R} s L(ŸΦ) X R s L(Φ)
28 Main result 28 Theorem: Let LetΦ be be an an MTL MTLformula, ssbe be a (continuous or or discrete time) time) signal signal ε >0 ε >0be be the therobustness parameter of of Φ with with respect to to s, s, then then for for all all s s in in B ρ (s,ε) ρ (s,ε) we we have have that that s s Φ iff iff s s Φ Fainekos Fainekos Robustness Robustness of of temporal temporal logic logic specifications, specifications, FATES/RV FATES/RV Fainekos Fainekos Robustness Robustness of of temporal temporal logic logic specifications specifications for for signals, signals, Submitted Submitted to to Theoretical Theoretical Computer Computer Science, Science, Fainekos Fainekos Robustness Robustness of of temporal temporal logic logic specifications specifications for for finite finite timed timed state state sequences sequences in in metric metric spaces, spaces, Technical Technical Report Report MS-CIS-04-32, MS-CIS-04-32,
29 Software toolbox : TaLiRo Available at : 29 Input: Discrete time signal Input: LTL / MTL formula & Observation map Monitor/Tester Output: ε œ»{± }
30 Intuition Example 30 Specification : Fp = T U p O(p) X
31 Running TaLiRo on a Dell PowerEdge O(p 1 ) = [1.5,+ ) s(i) = sin τ(i)+sin 2τ(i) τ(i) = 0.2i Time G(p 1 Ø F (0.0,1.0) Ÿp 1 )
32 Guaranteed correctness under noise uncertainty 34 F I2 (p I2 (p 2 2 F I3 (p I3 (p F 3 3 I4 (p I4 (p 4 4 (p (p 2 2 p 3 ) 3 ) U I1 p I1 1 ))) 1 ))) 6 Assume: sensor sensor accuracy ±0.1 ±0.1 6 Robustness estimate ε ε =
33 Talk Overview 35 Introduction Application areas Challenges Thesis Contributions Testing / Verification (Towards Certification) Problem Specification language (MTL) Robustness of Temporal Logic Specifications for signals From Discrete Time to Continuous Time From Signals to Systems Analog system robust testing / verification Hybrid system robust testing Final remarks Future work
34 From Discrete to Continuous Time 36 MTL formula Signal dynamics Sampling Conditions TL TL Robustness Bounds on on the the continuous time time robustness estimate YES NO Fainekos Fainekos Robust Robust Sampling Sampling for for MITL MITL specifications, specifications, FORMATS FORMATS Fainekos Fainekos Robustness Robustness of of TL TL specifications specifications for for continuous continuous time time signals, signals, TCS TCS (Submitted) (Submitted)
35 From Signals to Systems 37 Given a system Σ, we can define the robustness degree as ε ε := := dist dist ρ (L(Σ), ρ L(ŸΦ)) = inf inf {ρ(s,s ) ssœ L(Σ), s s œ L(ŸΦ)} ρ(s,s ) = sup {d(s(t),s (t)) t œ R} L(Φ) ε L(Σ) L(ŸΦ) X R Fainekos Fainekos MTL MTL Robust Robust Testing Testing for for LPV LPV Systems, Systems, RTSS RTSS (Submitted) (Submitted)
36 Talk Overview 38 Introduction Application areas Challenges Thesis Contributions Testing / Verification (Towards Certification) Problem Specification language (MTL) Robustness of Temporal Logic Specifications for signals From Discrete Time to Continuous Time From Signals to Systems Analog system robust testing / verification Hybrid system robust testing Final remarks Future work
37 Example : a study of transient dynamics 39 System (dim 81): Step input (t > 0): Steady state at t=0 - : Property: Φ =Gp 1 F [0,Τ] G p 2 O (p 1 ) = [-1.5,1.5] O (p 2 ) = [0.8,1.2] Initial conditions: Τ
38 Robust TL testing of analog systems 40 Closed-loop system Σ xç =f(x) X 0 X y = g(x) LTL / MTL Φ =G p 1 F [0,Τ] G p 2 Simulator // Tester Tester B ρ (L(Σ),δ) L(Φ) Fainekos, Fainekos, Girard Girard Temporal Temporal logic logic verification verification using using simulation, simulation, FORMATS FORMATS Fainekos Fainekos MTL MTL Robust Robust Testing Testing for for LPV LPV Systems, Systems, RTSS RTSS (Submitted) (Submitted)
39 Related Research 41 Verification/Testing of Analog Systems (using TL) Hartong, Hedrich, Barke 02, On Discrete Modeling Model Checking for Nonlinear Analog Systems Ghosh, Vemuri 99, Formal Verification of Synthesized Analog Designs Frehse, Krogh, Rutenbar, Maler 05, Time Domain Verification of Oscillator Circuit Properties Gupta, Krogh, Rutenbar 04, Towards Formal Verification of Analog Designs Donze, Maler 07, Systematic Simulation using Sensitivity Analysis
40 Main idea 42 Closed-loop system Σ: xç =f(x) X 0 X y = g(x) Specification Φ L(Σ) L(Φ) time Proj 0 (P Φ L(Σ)) X 0 ε robustness parameter B ρ (σ, ε )
41 Achieving coverage I 43 Closed-loop system Σ: xç =f(x) X 0 X y = g(x) Specification Φ L(Σ) L(Φ) time Proj 0 (P Φ L(Σ)) X 0 Good news! Coverage with a finite number of simulations
42 Computing bisimulation functions 44 Quadratic Bisimulation Functions for Deterministic Linear Systems xç =Ax y = Cx y V(x) = is a bisimulation function if A T x M C T T Mx C M + MA 0 Bisimulation Functions using Sum Of Squares Relaxation xç =f(x) y = g(x) y V(x1, x 2) = q(x1, x 2) is a bisimulation function if q(x1, x 2) g1(x1) g 2 (x 2 ) 2 is SOS q(x1, x x 1 2 ) q(x1, x f1(x1) x 2 2 ) f 2 (x 2 ) is SOS
43 Achieving coverage II 45 Closed-loop system Σ: xç =f(x) X 0 X y = g(x) Specification Φ L(Σ) L(Φ) time Proj 0 (P Φ L(Σ)) X 0 Even better news! It is possible to verify the system with just one simulation
44 Quick falsification 46 Closed-loop system Σ: xç =f(x) X 0 X y = g(x) Specification Φ L(Σ) L(Φ) time Proj 0 (P Φ L(Σ)) Observation! A robust system with respect to the property requires less simulations X 0
45 Coverage certificates 47 Closed-loop system Σ: xç =f(x) X 0 X y = g(x) Specification Φ L(Σ) L(Φ) time Proj 0 (P Φ L(Σ)) X 0 Good news! We get coverage guarantees after K iterations.
46 Main results 48 Theorem: Let Let V be be a bisimulation function, let let (x (x 1,y 1,y 1 ) 1 ) be be a trajectory of of Σ, Σ, εεbe be the the robustness parameter of of Φ wrt wrty 1 1 δ>0, δ>0, then for for any any other trajectory (x (x 2,y 2,y 2 ) 2 ) such such that that V(x V(x 1 (0),x 1 (0),x 2 (0)) 2 (0)) < ε-δ ε-δimplies that that the the robustness parameter of of Φ wrt wrty 1 is 1 is greater or or equal to to δ. δ. Proposition: Let Let V be be a bisimulation function. For For any any compact set set of of initial conditions X 0 0,, for for all all ζ ζ >0, >0, there exists a finite set set of of points {x {x 1,,x 1,,x r } r X 0 such 0 such that that for for all all x X 0, 0, there exists x i, i, such such that that V(x,x i ) i ) ζζ Fainekos, Fainekos, Girard Girard Temporal Temporal logic logic verification verification using using simulation, simulation, FORMATS FORMATS Fainekos, Fainekos, Robustness Robustness of of Temporal Temporal Logic Logic Specifications, Specifications, PhD PhD Thesis Thesis
47 Main results 49 Theorem: Let Let (x (x 1,y 1,y 1 ),,(x 1 r,y r,y r ) r ) be be trajectories of of Σ such such that thatdisc(x 0,ζ)= 0,ζ)= {x {x 1 (0),,x 1 r (0)}. r (0)}. Let Letεε i be i be the the robustness parameter of of Φ wrt wrty i.then, i "i œ {1,,r}.ε i > ζ+δ ï B ρ (L(Σ),δ) L(Φ) Proposition: If If Σ 1 is 1 is δ-approximately simulated by by Σ 2 2 B ρ (L(Σ 2 ),δ) L(Φ) then L(Σ 1 ) L(Φ) Fainekos, Fainekos, Girard Girard Temporal Temporal logic logic verification verification using using simulation, simulation, FORMATS FORMATS Fainekos, Fainekos, Robustness Robustness of of Temporal Temporal Logic Logic Specifications, Specifications, PhD PhD Thesis Thesis Fainekos Fainekos MTL MTL Robust Robust Testing Testing for for LPV LPV Systems, Systems, RTSS RTSS (Submitted) (Submitted)
48 Verification example 50 Consider the linear system with dynamics A = C = with initial conditions X 0 = [0.4,0.8] x [-0.3,-0.1] Verify that it satisfies the specification Φ =G p 1 G [8, ] p 2 where O(p 1 ) = x [-0.6,0.6] O(p 2 ) = [-0.4,0.4] x [-0.4,0.4] with robustness δ = over the time domain [0,14] Time
49 Verification example - Initialization 51 Compute the bisimulation function V(x) = x T Mx A T M M + C T C MA 0 M = Choose as first point the center x c of the hyper-rectangle Compute the maximum value of the bisimulation function of all the points in the set X 0 relative to x c
50 Verification example First test y (2) y (1)
51 Verification example 2 nd iteration y (2) y (1)
52 Verification example 3 rd iteration y (1) (t) y (2) (t) y (2) Time y (1)
53 55 θ Experimental Results (MATLAB toolbox) Property: T Φ =Gp 1 F [0,Τ] G p 2 O (p 1 ) = [-θ,θ], O (p 2 ) = [0.8,1.2] θ T=0.8 T=1.2 T=1.6 θ=1.4 False 1 False 1 False 1 θ=1.5 False 1 False 15 False 13 T θ=1.6 False 1 True 17 True 7 from Zhi Han s PhD Thesis 2005
54 56 θ Experimental Results (MATLAB toolbox) Property: T Φ =Gp 1 F [0,Τ] G p 2 O (p 1 ) = [-θ,θ], O (p 2 ) = [0.8,1.2] θ T=0.8 T=1.2 T=1.6 θ=1.4 False 1 False 1 False 1 θ=1.5 False 1 False 15 False 13 T θ=1.6 False 1 True 17 True from Zhi Han s PhD Thesis 2005
55 57 θ Experimental Results (MATLAB toolbox) Property: T Φ =Gp 1 F [0,Τ] G p 2 O (p 1 ) = [-θ,θ], O (p 2 ) = [0.8,1.2] θ T=0.8 T=1.2 T=1.6 θ=1.4 False 1 False 1 False θ=1.5 False 1 False 15 False 13 θ=1.6 False 1 True 17 True 7 from Zhi Han s PhD Thesis 2005
56 θ Experimental Results (MATLAB toolbox) 58 Property: T Φ =Gp 1 F [0,Τ] G p 2 O (p 1 ) = [-θ,θ], O (p 2 ) = [0.8,1.2] θ T=0.8 T=1.2 T=1.6 θ=1.4 False 1 False 1 False 1 θ=1.5 False 1 False 15 False 13 θ=1.6 False 1 True 17 True 7 from Zhi Han s PhD Thesis 2005
57 1.6 θ Experimental Results (MATLAB toolbox) Property: T Φ =Gp 1 F [0,Τ] G p 2 O (p 1 ) = [-θ,θ], O (p 2 ) = [0.8,1.2] Uout(Volt) θ T=0.8 T=1.2 T= θ=1.4 θ=1.5 False False 1 1 False False Time(nsec) 1 15 False True θ= False 1 False 13 True 7 from Zhi Han s PhD Thesis 2005
58 Talk Overview 60 Introduction Application areas Challenges Thesis Contributions Testing / Verification (Towards Certification) Problem Specification language (MTL) Robustness of Temporal Logic Specifications for signals From Discrete Time to Continuous Time From Signals to Systems Analog system robust testing / verification Hybrid system robust testing Final remarks Future work
59 How robust is a hybrid test trajectory? 61 L 1 Init Unsafe L 2 Julius, Julius, Fainekos, Fainekos, An, An, Lee, Lee, Robust Robust Test Test Generation Generation Coverage Coverage for for Hybrid Hybrid Systems, Systems, HSCC HSCC
60 Talk Overview 62 Introduction Application areas Challenges Thesis Contributions Testing / Verification (Towards Certification) Problem Specification language (MTL) Robustness of Temporal Logic Specifications for signals From Discrete Time to Continuous Time From Signals to Systems Analog system robust testing / verification Hybrid system robust testing Final remarks Future work
61 Main Contributions 63 Testing / Verification (toward Certification) Robust temporal logic testing Semantics which maintains topological information Applications in signal testing/monitoring Analog system robust temporal logic testing Combining logic with system dynamics Applications in analog system verification Hybrid system robust testing Robustness wrt to switching conditions Applications in embedded systems mixed-signal circuits From discrete time to continuous time How specification can guide sampling? Automated Synthesis of hybrid controllers Non-reactive planning (bottom up) Kinematic & dynamic model motion planning Reactive planning (bottom up) Distributed multi-robot planning Top-down hybrid system synthesis Human-Robot interfaces UAV testbed platform development
62 65 Thank you!! Acknowledgements: Rajeev Alur, Madhukar An, Selcuk Bayraktar, Edmund M. Clarke, Antoine Girard, A. Agung Julius, Hadas Kress-Gazit, Insup Lee, Savvas G. Loizou, George J. Oleg Sokolsky Funding: UPenn, NSF EHS , NSF ITR , ARO MURI DAAD
Georgios E. Fainekos and George J. Pappas
FORMATS 2007 Georgios E. Fainekos and George J. Pappas Department of Computer and Information Science University of Pennsylvania fainekos @ seas.upenn.edu http://www.seas.upenn.edu/~fainekos/ Motivation
More informationRobust Testing and Testing Robustness for Cyber-Physical Systems
23 June 2011 - UCLA 1 Robust Testing and Testing Robustness for Cyber-Physical Systems Georgios E. Fainekos School of Computing, Informatics and Decision System Engineering Arizona State University fainekos
More informationAPPROXIMATE SIMULATION RELATIONS FOR HYBRID SYSTEMS 1. Antoine Girard A. Agung Julius George J. Pappas
APPROXIMATE SIMULATION RELATIONS FOR HYBRID SYSTEMS 1 Antoine Girard A. Agung Julius George J. Pappas Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia, PA 1914 {agirard,agung,pappasg}@seas.upenn.edu
More informationTemporal Logic Verification Using Simulation
Temporal Logic Verification Using Simulation Georgios E. Fainekos 1, Antoine Girard 2, and George J. Pappas 3 1 Department of Computer and Information Science, Univ. of Pennsylvania, USA fainekos@cis.upenn.edu
More informationGeorgios E. Fainekos, Savvas G. Loizou and George J. Pappas. GRASP Lab Departments of CIS, MEAM and ESE University of Pennsylvania
Georgios E. Fainekos, Savvas G. Loizou and George J. Pappas CDC 2006 Math free Presentation! Lab Departments of CIS, MEAM and ESE University of Pennsylvania Motivation Motion Planning 60 50 40 π 0 π 4
More informationApproximately Bisimilar Finite Abstractions of Stable Linear Systems
Approximately Bisimilar Finite Abstractions of Stable Linear Systems Antoine Girard Université Joseph Fourier Laboratoire de Modélisation et Calcul B.P. 53, 38041 Grenoble, France Antoine.Girard@imag.fr
More informationHierarchical Synthesis of Hybrid Controllers from Temporal Logic Specifications
Hierarchical Synthesis of Hybrid Controllers from Temporal Logic Specifications Georgios E. Fainekos 1, Antoine Girard 2, and George J. Pappas 3 1 Department of Computer and Information Science, Univ.
More informationRobustness of Temporal Logic Specifications for Continuous-Time Signals
Robustness of Temporal Logic Specifications for Continuous-Time Signals Georgios E. Fainekos a, George J. Pappas a,b a Department of Computer and Information Science, University of Pennsylvania, 3330 Walnut
More informationAn introduction to hybrid systems theory and applications. Thanks to. Goals for this mini-course. Acknowledgments. Some references
An introduction to hybrid systems theory and applications Thanks to School Organizers Maurice Heemels Bart De Schutter George J Pappas Departments of ESE and CIS University of Pennsylvania pappasg@eeupennedu
More informationTemporal Logic Testing for Hybrid Systems Georgios Fainekos
1 Temporal Logic Testing for Hybrid Systems Georgios Fainekos School of Computing, Informatics and Decision System Engineering Arizona State University fainekos at asu edu http://www.public.asu.edu/~gfaineko
More informationTesting System Conformance for Cyber-Physical Systems
Testing System Conformance for Cyber-Physical Systems Testing systems by walking the dog Rupak Majumdar Max Planck Institute for Software Systems Joint work with Vinayak Prabhu (MPI-SWS) and Jyo Deshmukh
More informationAlgorithmic Verification of Stability of Hybrid Systems
Algorithmic Verification of Stability of Hybrid Systems Pavithra Prabhakar Kansas State University University of Kansas February 24, 2017 1 Cyber-Physical Systems (CPS) Systems in which software "cyber"
More informationProbabilistic Testing for Stochastic Hybrid Systems
University of Pennsylvania ScholarlyCommons Lab Papers (GRASP) General Robotics, Automation, Sensing and Perception Laboratory 12-9-2008 Probabilistic Testing for Stochastic Hybrid Systems A. Agung Julius
More informationOn-Line Monitoring for Temporal Logic Robustness
On-Line Monitoring for Temporal Logic Robustness Adel Dokhanchi, Bardh Hoxha, and Georgios Fainekos School of Computing, Informatics and Decision Systems Engineering Arizona State University {adokhanc,bhoxha,fainekos}@asu.edu
More informationApproximate Bisimulations for Constrained Linear Systems
Approximate Bisimulations for Constrained Linear Systems Antoine Girard and George J Pappas Abstract In this paper, inspired by exact notions of bisimulation equivalence for discrete-event and continuous-time
More informationSymbolic Control of Incrementally Stable Systems
Symbolic Control of Incrementally Stable Systems Antoine Girard Laboratoire Jean Kuntzmann, Université Joseph Fourier Grenoble, France Workshop on Formal Verification of Embedded Control Systems LCCC,
More informationIntroduction to Embedded Systems
Introduction to Embedded Systems Sanjit A. Seshia UC Berkeley EECS 149/249A Fall 2015 2008-2015: E. A. Lee, A. L. Sangiovanni-Vincentelli, S. A. Seshia. All rights reserved. Chapter 13: Specification and
More informationBenchmarks for Temporal Logic Requirements for Automotive Systems
EPiC Series in Computer Science Volume 34, 5, Pages 5 3 ARCH4-5. st and nd International Workshop on Applied verification for Continuous and Hybrid Systems Benchmarks for Temporal Logic Requirements for
More informationAutomata-theoretic analysis of hybrid systems
Automata-theoretic analysis of hybrid systems Madhavan Mukund SPIC Mathematical Institute 92, G N Chetty Road Chennai 600 017, India Email: madhavan@smi.ernet.in URL: http://www.smi.ernet.in/~madhavan
More informationVacuity Aware Falsification for MTL Request-Response Specifications
Vacuity Aware Falsification for MTL Request-Response Specifications Adel Dokhanchi, Shakiba Yaghoubi, Bardh Hoxha, and Georgios Fainekos Abstract We propose a method to improve the automated test case
More informationBounded Model Checking with SAT/SMT. Edmund M. Clarke School of Computer Science Carnegie Mellon University 1/39
Bounded Model Checking with SAT/SMT Edmund M. Clarke School of Computer Science Carnegie Mellon University 1/39 Recap: Symbolic Model Checking with BDDs Method used by most industrial strength model checkers:
More informationPreface. Motivation and Objectives
Preface Motivation and Objectives In control theory, complex models of physical processes, such as systems of differential or difference equations, are usually checked against simple specifications, such
More informationOn-Line Monitoring for Temporal Logic Robustness
On-Line Monitoring for Temporal Logic Robustness Adel Dokhanchi, Bardh Hoxha, and Georgios Fainekos School of Computing, Informatics and Decision Systems Engineering Arizona State University {adokhanc,bhoxha,fainekos}@asu.edu
More informationAnalysis for Dynamic of Analog Circuits by using HSPN
Proceedings of the 11th WSEAS International Conference on CIRCUITS, Agios Nikolaos, Crete Island, Greece, July 23-25, 2007 207 Analysis for Dynamic of Analog Circuits by using HSPN MENG ZHANG, SHENGBING
More informationModel Checking of Hybrid Systems
Model Checking of Hybrid Systems Goran Frehse AVACS Autumn School, October 1, 2015 Univ. Grenoble Alpes Verimag, 2 avenue de Vignate, Centre Equation, 38610 Gières, France, Overview Hybrid Automata Set-Based
More informationSpecification Mining of Industrial-scale Control Systems
100 120 Specification Mining of Industrial-scale Control Systems Alexandre Donzé Joint work with Xiaoqing Jin, Jyotirmoy V. Deshmuck, Sanjit A. Seshia University of California, Berkeley May 14, 2013 Alexandre
More informationarxiv: v1 [cs.sy] 8 Mar 2017
Control Synthesis for Multi-Agent Systems under Metric Interval Temporal Logic Specifications Sofie Andersson Alexandros Nikou Dimos V. Dimarogonas ACCESS Linnaeus Center, School of Electrical Engineering
More informationAssertions and Measurements for Mixed-Signal Simulation
Assertions and Measurements for Mixed-Signal Simulation PhD Thesis Thomas Ferrère VERIMAG, University of Grenoble (directeur: Oded Maler) Mentor Graphics Corporation (co-encadrant: Ernst Christen) October
More informationStatic-Dynamic Analysis of Security Metrics
Static-Dynamic Analysis of Security Metrics for Cyber-Physical Systems Sayan Mitra (PI), Geir Dullerud (co-pi), Swarat Chaudhuri (co-pi) University of Illinois at Urbana Champaign NSA SoS Quarterly meeting,
More informationMotion planning applications of Satisfiability Modulo Convex Optimization
Motion planning applications of Satisfiability Modulo Convex Optimization Yasser Shoukry (1) and Paulo Tabuada (2) (1) Department of Electrical and Computer Engineering, UMD (2) Electrical and Computer
More informationSynthesis via Sampling-Based Abstractions
Synthesis via Sampling-Based Abstractions Some Problems and Initial Ideas Matthias Rungger 2 Morteza Lahijanian 1 Lydia E Kavraki 1 Paulo Tabuada 2 Moshe Y Vardi 1 1 Department of Computer Science, Rice
More informationOnline Horizon Selection in Receding Horizon Temporal Logic Planning
Online Horizon Selection in Receding Horizon Temporal Logic Planning Vasumathi Raman 1 and Mattias Fält 2 and Tichakorn Wongpiromsarn 3 and Richard M. Murray 1 Abstract Temporal logics have proven effective
More informationDiscrete abstractions of hybrid systems for verification
Discrete abstractions of hybrid systems for verification George J. Pappas Departments of ESE and CIS University of Pennsylvania pappasg@ee.upenn.edu http://www.seas.upenn.edu/~pappasg DISC Summer School
More informationLecture 6 Verification of Hybrid Systems
Lecture 6 Verification of Hybrid Systems Ufuk Topcu Nok Wongpiromsarn Richard M. Murray AFRL, 25 April 2012 Outline: A hybrid system model Finite-state abstractions and use of model checking Deductive
More informationAutomatica. Temporal logic motion planning for dynamic robots. Georgios E. Fainekos a,, Antoine Girard b, Hadas Kress-Gazit a, George J.
Automatica 45 (2009) 343 352 Contents lists available at ScienceDirect Automatica journal homepage: www.elsevier.com/locate/automatica Temporal logic motion planning for dynamic robots Georgios E. Fainekos
More informationHierarchical Hybrid Symbolic Robot Motion Planning and Control
Asian Journal of Control, Vol. 00, No. 0, pp. 1 11, Month 2008 Published online in Wiley InterScience (www.interscience.wiley.com) DOI: 10.1002/asjc.0000 Hierarchical Hybrid Symbolic Robot Motion Planning
More informationCompositionally Analyzing a Proportional-Integral Controller Family
2 5th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 2-5, 2 Compositionally Analyzing a Proportional-Integral Controller Family Ashish Tiwari
More informationFormally Correct Monitors for Hybrid Automata. Verimag Research Report n o TR
Formally Correct Monitors for Hybrid Automata Goran Frehse, Nikolaos Kekatos, Dejan Nickovic Verimag Research Report n o TR-2017-5 September 20, 2017 Verimag, University of Grenoble Alpes, Grenoble, France.
More informationParametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method
Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method Laurent Fribourg and Ulrich Kühne LSV ENS de Cachan, 94235 Cachan, France {kuehne,fribourg}@lsv.ens-cachan.fr Abstract.
More informationTime-Aware Abstractions in HybridSal
Time-Aware Abstractions in HybridSal Ashish Tiwari SRI International, Menlo Park, CA Abstract. HybridSal is a tool for enabling verification of hybrid systems using infinite bounded model checking and
More informationDryVR: Data-driven verification and compositional reasoning for automotive systems
DryVR: Data-driven verification and compositional reasoning for automotive systems Chuchu Fan, Bolun Qi, Sayan Mitra, Mahesh Viswannathan University of Illinois at Urbana-Champaign CAV 2017, Heidelberg,
More informationTemporal Logic. Stavros Tripakis University of California, Berkeley. We have designed a system. We want to check that it is correct.
EE 244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Fall 2016 Temporal logic Stavros Tripakis University of California, Berkeley Stavros Tripakis (UC Berkeley) EE 244, Fall 2016
More informationHybrid Automata and ɛ-analysis on a Neural Oscillator
Hybrid Automata and ɛ-analysis on a Neural Oscillator A. Casagrande 1 T. Dreossi 2 C. Piazza 2 1 DMG, University of Trieste, Italy 2 DIMI, University of Udine, Italy Intuitively... Motivations: Reachability
More informationSynthesis of Distributed Control and Communication Schemes from Global LTL Specifications
Synthesis of Distributed Control and Communication Schemes from Global LTL Specifications Yushan Chen, Xu Chu Ding, and Calin Belta Abstract We introduce a technique for synthesis of control and communication
More informationESE601: Hybrid Systems. Introduction to verification
ESE601: Hybrid Systems Introduction to verification Spring 2006 Suggested reading material Papers (R14) - (R16) on the website. The book Model checking by Clarke, Grumberg and Peled. What is verification?
More informationSwitching Protocol Synthesis for Temporal Logic Specifications
Switching Protocol Synthesis for Temporal Logic Specifications Jun Liu, Necmiye Ozay, Ufuk Topcu, and Richard M. Murray Abstract We consider the problem of synthesizing a robust switching controller for
More informationSynthesizing Switching Logic using Constraint Solving
Synthesizing Switching Logic using Constraint Solving Ankur Taly 1, Sumit Gulwani 2, and Ashish Tiwari 3 1 Computer Science Dept., Stanford University ataly@stanford.edu 2 Microsoft Research, Redmond,
More information7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing-
7. F.Balarin and A.Sangiovanni-Vincentelli, A Verication Strategy for Timing- Constrained Systems, Proc. 4th Workshop Computer-Aided Verication, Lecture Notes in Computer Science 663, Springer-Verlag,
More informationSimilarities between Timing Constraints
Similarities between Timing Constraints Towards Interchangeable Constraint Models for Real-World Software Systems yyu8@iit.edu Similarities between Timing Constraints p. 1/11 Background Software for real-world
More informationRuntime Model Predictive Verification on Embedded Platforms 1
Runtime Model Predictive Verification on Embedded Platforms 1 Pei Zhang, Jianwen Li, Joseph Zambreno, Phillip H. Jones, Kristin Yvonne Rozier Presenter: Pei Zhang Iowa State University peizhang@iastate.edu
More informationTemporal Logic Motion Planning for Dynamic Robots
TEMPORAL LOGIC MOTION PLANNING FOR DYNAMIC ROBOTS 1 Temporal Logic Motion Planning for Dynamic Robots Georgios E. Fainekos, Antoine Girard, Hadas Kress-Gazit, and George J. Pappas Technical Report MS-CIS-07-02
More informationLecture 4. Applications
Lecture 4. Applications Summary Tools such as HyTech, CheckMate, Uppaal, Kronos have been used in many contexts typically to verify safety of a control design or to get tight bounds on parameters (e.g.
More informationAbstraction-based synthesis: Challenges and victories
Abstraction-based synthesis: Challenges and victories Majid Zamani Hybrid Control Systems Group Electrical Engineering Department Technische Universität München December 14, 2015 Majid Zamani (TU München)
More informationControl Software Model Checking Using Bisimulation Functions for Nonlinear Systems
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 2008 Control Software Model Checking Using Bisimulation Functions for Nonlinear Systems James Kapinski 1, Alexandre
More informationReasoning about Strategies: From module checking to strategy logic
Reasoning about Strategies: From module checking to strategy logic based on joint works with Fabio Mogavero, Giuseppe Perelli, Luigi Sauro, and Moshe Y. Vardi Luxembourg September 23, 2013 Reasoning about
More informationOn Real-time Monitoring with Imprecise Timestamps
On Real-time Monitoring with Imprecise Timestamps David Basin 1, Felix Klaedtke 2, Srdjan Marinovic 1, and Eugen Zălinescu 1 1 Institute of Information Security, ETH Zurich, Switzerland 2 NEC Europe Ltd.,
More informationA Brief Introduction to Model Checking
A Brief Introduction to Model Checking Jan. 18, LIX Page 1 Model Checking A technique for verifying finite state concurrent systems; a benefit on this restriction: largely automatic; a problem to fight:
More informationPolynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties and its Application to Cyber-Physical Systems
Polynomial-Time Verification of PCTL Properties of MDPs with Convex Uncertainties and its Application to Cyber-Physical Systems Alberto Puggelli DREAM Seminar - November 26, 2013 Collaborators and PIs:
More informationFalsification of Temporal Properties of Hybrid Systems Using the Cross-Entropy Method
Falsification of Temporal Properties of Hybrid Systems Using the Cross-Entropy Method Sriram Sankaranarayanan University of Colorado, Boulder, CO, USA. srirams@colorado.edu Georgios Fainekos Arizona State
More informationOn Signal Temporal Logic
100 120 On Signal Temporal Logic Alexandre Donzé University of California, Berkeley February 3, 2014 Alexandre Donzé EECS294-98 Spring 2014 1 / 52 Outline 100 120 1 Signal Temporal Logic From LTL to STL
More informationVerification of hybrid systems. Thanks to
Verification of hybrid systems George J Pappas Departments of ESE and CIS University of Pennsylvania pappasg@eeupennedu http://wwwseasupennedu/~pappasg HYBRIDGE Summer School on Hybrid Systems : A Formal
More informationHybridSAL Relational Abstracter
HybridSAL Relational Abstracter Ashish Tiwari SRI International, Menlo Park, CA. ashish.tiwari@sri.com Abstract. In this paper, we present the HybridSAL relational abstracter a tool for verifying continuous
More informationTrajectory Based Verification Using Local Finite- Time Invariance
University of Pennsylvania ScholarlyCommons Lab Papers (GRASP) General Robotics, Automation, Sensing and Perception Laboratory 4-30-2009 Trajectory Based Verification Using Local Finite- Time Invariance
More informationHybrid Controllers for Path Planning: A Temporal Logic Approach
Hybrid Controllers for Path Planning: A Temporal Logic Approach Georgios E. Fainekos, Hadas Kress-Gazit, and George J. Pappas Abstract Robot motion planning algorithms have focused on low-level reachability
More informationModel checking LTL over controllable linear systems is decidable
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering April 2003 Model checking LTL over controllable linear systems is decidable Paulo Tabuada
More informationRanking Verification Counterexamples: An Invariant guided approach
Ranking Verification Counterexamples: An Invariant guided approach Ansuman Banerjee Indian Statistical Institute Joint work with Pallab Dasgupta, Srobona Mitra and Harish Kumar Complex Systems Everywhere
More informationUsing Valued Booleans to Find Simpler Counterexamples in Random Testing of Cyber-Physical Systems
Using Valued Booleans to Find Simpler Counterexamples in Random Testing of Cyber-Physical Systems Koen Claessen Nicholas Smallbone Johan Eddeland, Zahra Ramezani Knut Åkesson Department of Computer Science
More informationarxiv: v2 [cs.lo] 28 Aug 2017
An Active Learning Approach to the Falsification of Black Box Cyber-Physical Systems Simone Silvetti 1,2, Alberto Policriti 2,3, and Luca Bortolussi 4,5,6 arxiv:1705.01879v2 [cs.lo] 28 Aug 2017 1 Esteco
More informationUsing Computer Games for Hybrid Systems Controller Synthesis
49th IEEE Conference on Decision and Control December 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Using Computer Games for Hybrid Systems Controller Synthesis A. Agung Julius and Sina Afshari Abstract
More informationAPPROXIMATE BISIMULATION: A BRIDGE BETWEEN COMPUTER SCIENCE AND CONTROL THEORY. 1. Introduction
APPROXIMATE BISIMULATION: A BRIDGE BETWEEN COMPUTER SCIENCE AND CONTROL THEORY ANTOINE GIRARD AND GEORGE J. PAPPAS Abstract. Fifty years ago, control and computing were part of a broader system science.
More informationGeometric Programming Relaxations for Linear System Reachability
Geometric Programg Relaxations for Linear System Reachability Hakan Yazarel and George J. Pappas Abstract One of the main obstacles in the safety analysis of continuous and hybrid systems has been the
More informationAutomatic Synthesis of Robust Embedded Control Software
AAAI Spring Symposium on Embedded Reasoning (2224 Mar 2010, Stanford) http://www.cds.caltech.edu/~murray/papers/wtm10aaai.html Automatic Synthesis of Robust Embedded Control Software Tichakorn Wongpiromsarn,
More informationAn Informal introduction to Formal Verification
An Informal introduction to Formal Verification Osman Hasan National University of Sciences and Technology (NUST), Islamabad, Pakistan O. Hasan Formal Verification 2 Agenda q Formal Verification Methods,
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationAnalysis of a Boost Converter Circuit Using Linear Hybrid Automata
Analysis of a Boost Converter Circuit Using Linear Hybrid Automata Ulrich Kühne LSV ENS de Cachan, 94235 Cachan Cedex, France, kuehne@lsv.ens-cachan.fr 1 Introduction Boost converter circuits are an important
More informationSymbolic Control. From discrete synthesis to certified continuous controllers. Antoine Girard
Symbolic Control From discrete synthesis to certified continuous controllers Antoine Girard CNRS, Laboratoire des Signaux et Systèmes Gif-sur-Yvette, France Journées de l Automatique du GdR MACS Nantes,
More informationarxiv: v2 [cs.sy] 16 Jun 2011
CONTROLLER SYNTHESIS FOR SAFETY AND REACHABILITY VIA APPROXIMATE BISIMULATION ANTOINE GIRARD arxiv:1010.4672v2 [cs.sy] 16 Jun 2011 Abstract. In this paper, we consider the problem of controller design
More informationSynthesis of Switching Protocols from Temporal Logic Specifications
Submitted, 2012 American Control Conference (ACC) http://www.cds.caltech.edu/~murray/papers DRAFT 1 Synthesis of Switching Protocols from Temporal Logic Specifications Jun Liu, Necmiye Ozay, Ufuk Topcu,
More informationFeedback Refinement Relations for the Synthesis of Symbolic Controllers
Feedback Refinement Relations for the Synthesis of Symbolic Controllers Gunther Reissig 1, Alexander Weber 1 and Matthias Rungger 2 1: Chair of Control Engineering Universität der Bundeswehr, München 2:
More informationSafety Verification of Hybrid Systems Using Barrier Certificates
Safety Verification of Hybrid Systems Using Barrier Certificates Stephen Prajna 1 and Ali Jadbabaie 2 1 Control and Dynamical Systems, California Institute of Technology, Pasadena, CA 91125 - USA, prajna@cds.caltech.edu
More informationCompositionally Analyzing a Proportional-Integral Controller Family
Compositionally Analyzing a Proportional-Integral Controller Family Ashish Tiwari Abstract We define always eventually region stability and then formulate the absolute always eventually region stability
More informationLTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees
LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees Xu Chu (Dennis) Ding Stephen L. Smith Calin Belta Daniela Rus Department of Mechanical Engineering, Boston University, Boston,
More informationReceding Horizon Temporal Logic Planning for Dynamical Systems
Submitted, 2009 Conference on Decision and Control (CDC) http://www.cds.caltech.edu/~murray/papers/wtm09-cdc.html Receding Horizon Temporal Logic Planning for Dynamical Systems Tichaorn Wongpiromsarn,
More informationMulti-Modal Control of Systems with Constraints
Multi-Modal Control of Systems with Constraints WeM12-3 T. John Koo Department of EECS University of California Berkeley, CA 9720 koo@eecs.berkeley.edu George J. Pappas Department of EE University of Pennsylvania
More informationSemi-decidable Synthesis for Triangular Hybrid Systems
Semi-decidable Synthesis for Triangular Hybrid Systems Omid Shakernia 1, George J. Pappas 2, and Shankar Sastry 1 1 Department of EECS, University of California at Berkeley, Berkeley, CA 94704 {omids,sastry}@eecs.berkeley.edu
More informationPattern Matching with Time Theory and Applications
Thesis Defense Pattern Matching with Time Theory and Applications Doğan Ulus January 15, 2018 Grenoble, France Supervisor Reviewers Examiners Invited Oded Maler Rajeev Alur Saddek Bensalem Eugene Asarin
More informationApproximation Metrics for Discrete and Continuous Systems
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science May 2007 Approximation Metrics for Discrete Continuous Systems Antoine Girard University
More informationSynthesis of Reactive Control Protocols for Differentially Flat Systems
DRAFT 1 Synthesis of Reactive Control Protocols for Differentially Flat Systems Jun Liu, Ufuk Topcu, Necmiye Ozay, and Richard M. Murray Abstract We propose a procedure for the synthesis of control protocols
More informationRevisiting Synthesis of GR(1) Specifications
Revisiting Synthesis of GR(1) Specifications Uri Klein & Amir Pnueli Courant Institute of Mathematical Sciences, NYU Haifa Verification Conference, October 2010 What Is Synthesis? Rather than implement
More informationSynthesis of Designs from Property Specifications
Synthesis of Designs from Property Specifications Amir Pnueli New York University and Weizmann Institute of Sciences FMCAD 06 San Jose, November, 2006 Joint work with Nir Piterman, Yaniv Sa ar, Research
More informationDetermining the Existence of DC Operating Points in Circuits
Determining the Existence of DC Operating Points in Circuits Mohamed Zaki Department of Computer Science, University of British Columbia Joint work with Ian Mitchell and Mark Greenstreet Nov 23 nd, 2009
More informationVerifying Safety Properties of Hybrid Systems.
Verifying Safety Properties of Hybrid Systems. Sriram Sankaranarayanan University of Colorado, Boulder, CO. October 22, 2010. Talk Outline 1. Formal Verification 2. Hybrid Systems 3. Invariant Synthesis
More informationSynthesizing Switching Logic for Safety and Dwell-Time Requirements
Synthesizing Switching Logic for Safety and Dwell-Time Requirements Susmit Jha UC Berkeley jha@eecs.berkeley.edu Sumit Gulwani Microsoft Research sumitg@microsoft.com Sanjit A. Seshia UC Berkeley sseshia@eecs.berkeley.edu
More informationONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies. Calin Belta
ONR MURI AIRFOILS: Animal Inspired Robust Flight with Outer and Inner Loop Strategies Provable safety for animal inspired agile flight Calin Belta Hybrid and Networked Systems (HyNeSs) Lab Department of
More informationPredictable real-time software synthesis
Real-Time Syst (2007) 36: 159 198 DOI 10.1007/s11241-007-9013-6 Predictable real-time software synthesis Jinfeng Huang Jeroen Voeten Henk Corporaal Published online: 28 March 2007 Springer Science+Business
More informationSTOCHASTIC hybrid systems are hybrid systems where
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 54, NO 6, JUNE 2009 1193 Approximations of Stochastic Hybrid Systems A Agung Julius, Member, IEEE, and George J Pappas, Fellow, IEEE Abstract This paper develops
More informationFrom MTL to Deterministic Timed Automata
From MTL to Deterministic Timed Automata Dejan Ničković 1 and Nir Piterman 1 IST, Klosterneuburg, Austria Imperial College London, London, UK Abstract. In this paper we propose a novel technique for constructing
More informationVerifying Analog Oscillator Circuits Using Forward/Backward Abstraction Refinement
Verifying Analog Oscillator Circuits Using Forward/Backward Abstraction Refinement Goran Frehse VERIMAG 2, av. de Vignate 38610 Gières, France goran.frehse@imag.fr Bruce H. Krogh, Rob A. Rutenbar Carnegie
More informationSynthesizing Switching Logic using Constraint Solving
Synthesizing Switching Logic using Constraint Solving Ankur Taly 1, Sumit Gulwani 2, and Ashish Tiwari 3 1 Computer Science Dept., Stanford University ataly@stanford.edu 2 Microsoft Research, Redmond,
More informationVerification of temporal properties on hybrid automata by simulation relations
Proceedings of the 46th IEEE Conference on Decision and Control New Orleans, LA, USA, Dec. 2-4, 2007 Verification of temporal properties on hybrid automata by simulation relations A. D Innocenzo, A.A.
More information