Hybrid systems and computer science a short tutorial
|
|
- Baldric Miles
- 5 years ago
- Views:
Transcription
1 Hybrid systems and computer science a short tutorial Eugene Asarin Université Paris 7 - LIAFA SFM 04 - RT, Bertinoro p. 1/4
2 Introductory equations Hybrid Systems = Discrete+Continuous SFM 04 - RT, Bertinoro p. 2/4
3 Introductory equations Hybrid Systems = Discrete+Continuous Hybrid Automata = A class of models of Hybrid systems SFM 04 - RT, Bertinoro p. 2/4
4 Introductory equations Hybrid Systems = Discrete+Continuous Hybrid Automata = A class of models of Hybrid systems Original motivation (1990)= physical plant + digital controller SFM 04 - RT, Bertinoro p. 2/4
5 Introductory equations Hybrid Systems = Discrete+Continuous Hybrid Automata = A class of models of Hybrid systems Original motivation (1990)= physical plant + digital controller New applications = also scheduling, biology, economy, numerics, and more SFM 04 - RT, Bertinoro p. 2/4
6 Introductory equations Hybrid Systems = Discrete+Continuous Hybrid Automata = A class of models of Hybrid systems Original motivation (1990)= physical plant + digital controller New applications = also scheduling, biology, economy, numerics, and more Hybrid community = Control scientists + Applied mathematicians + Some computer scientists SFM 04 - RT, Bertinoro p. 2/4
7 Outline 1. Hybrid automata - the model 2. Verification 3. Conclusions and perspectives SFM 04 - RT, Bertinoro p. 3/4
8 1. The Model SFM 04 - RT, Bertinoro p. 4/4
9 Outline 1. Hybrid automata - the model The definition Semantic issues Modeling with hybrid automata Hybrid languages Running a hybrid automaton 2. Verification 3. Conclusions and perspectives SFM 04 - RT, Bertinoro p. 5/4
10 The first example I m sorry, a thermostat. SFM 04 - RT, Bertinoro p. 6/4
11 The first example I m sorry, a thermostat. When the heater is OFF, the room cools down : ẋ = x When it is ON, the room heats: ẋ = H x SFM 04 - RT, Bertinoro p. 6/4
12 The first example I m sorry, a thermostat. When the heater is OFF, the room cools down : ẋ = x When it is ON, the room heats: ẋ = H x When t>m it switches OFF When t<m it switches ON SFM 04 - RT, Bertinoro p. 6/4
13 The first example I m sorry, a thermostat. When the heater is OFF, the room cools down : ẋ = x When it is ON, the room heats: ẋ = H x When t>m it switches OFF When t<m it switches ON A strange creature... SFM 04 - RT, Bertinoro p. 6/4
14 A bad syntax Some mathematicians prefer to write where ẋ = f(x,q) f(x, Off) = x f(x, On) = H x with some switching rules on q. SFM 04 - RT, Bertinoro p. 7/4
15 A bad syntax Some mathematicians prefer to write where ẋ = f(x,q) f(x, Off) = x f(x, On) = H x with some switching rules on q. But we will draw an automaton! SFM 04 - RT, Bertinoro p. 7/4
16 On ẋ = H x x M guard x = M x = m /γ reset Off Hybrid automaton ẋ = x x m label dynamics invariant SFM 04 - RT, Bertinoro p. 8/4
17 On ẋ = H x x M x = M x = m /γ Off Hybrid automaton ẋ = x x m label dynamics invariant guard reset A formal definition: It is a tuple... SFM 04 - RT, Bertinoro p. 8/4
18 On ẋ = H x x M guard x = M x = m /γ reset Off Hybrid automaton ẋ = x x m label dynamics invariant x M m SFM 04 - RT, Bertinoro p. 8/4
19 Hybrid versus timed a,x = 5/x := 0 q 1 q 2 label On ẋ = H x x M x = M x = m /γ Off ẋ = x x m dynamics invariant b,x = 2 b,x > 7 a,x < 10 q 3 a,x = 8 q 4 guard reset b,x = 5/x := 0 SFM 04 - RT, Bertinoro p. 9/4
20 Hybrid versus timed Element Timed Aut. Hybrid Aut. Discrete locations q Q (finite) q Q (finite) Continuous variables x R n x R n x dynamics ẋ = 1 ẋ = f(x) (and more) Guards bool. comb. of x i c i x G SFM 04 - RT, Bertinoro p. 9/4
21 Semantic issues A trajectory (run) is an f : R Q R n Some mathematical complications (notion of solution, existence and unicity not so evident). Zeno trajectories (infinitely many transitions in a finite period of time). can be forbidden one can consider trajectories up to the first anomaly (Sastry et al., everything OK) one can consider the complete Zeno trajectories (very funny : Asarin-Maler 95) SFM 04 - RT, Bertinoro p. 10/4
22 Variants Discrete-time (x n+1 = f(x n )) or continuous-time ẋ = f(x) Deterministic (e.g. ẋ = f(x)) or non-deterministic (e.g. ẋ F(x)) Eager or lazy. With control and/or disturbance (e.g. ẋ = f(x,u,d)) Various restrictions on dynamics, guards and resets: Piecewise trivial dynamics. LHA, RectA, PCD, PAM, SPDI... They are still highly non-trivial. SFM 04 - RT, Bertinoro p. 11/4
23 Special classes of Hybrid Automata 1 The famous one: Linear Hybrid Automata x P 1 /x := A 1 x + b 1 ẋ = c 1 ẋ = c 2 x P 2 /x := A 2 x + b 2 SFM 04 - RT, Bertinoro p. 12/4
24 Special classes of Hybrid Automata 2 My favorite: PCD = Piecewise Constant Derivatives c1 P1 x y ẋ = c i for x P i SFM 04 - RT, Bertinoro p. 13/4
25 PCD is a linear hybrid automaton (LHA) e 3 e 2 e 4 e 9 e 12 e 1 e 10 e 11 e 5 e 8 e6 e 7 SFM 04 - RT, Bertinoro p. 14/4
26 PCD is a linear hybrid automaton (LHA) e 3 e3 e 2 e 2 e 4 e 9 e 12 e 1 e 4 e 9 e 12 e 1 e 5 e 10 e 11 e 8 e 10 e 11 e 5 e 8 e 6 e6 e 7 e 7 SFM 04 - RT, Bertinoro p. 14/4
27 PCD is a linear hybrid automaton (LHA) e3 e 2 R 4 R 2 ẋ = a 4 ẋ = a 2 Inv(l 4 ) e 12 Inv(l 2 ) e 9 x = e 4 x = e 1 R 5 R 1 ẋ = a 5 ẋ = a 1 Inv(l 5 ) Inv(l 1 ) x = e 5 x = e 10 x = e 11 x = e 8 R 6 ẋ = a 6 Inv(l 6 ) x = e 6 R 7 R 8 ẋ = a x = e 7 7 ẋ = a 8 Inv(l 7 ) Inv(l 8 ) SFM 04 - RT, Bertinoro p. 14/4
28 PCD is a linear hybrid automaton (LHA) R 4 R 3 R 2 x = e 3 x = e 2 ẋ = a 4 ẋ = a 3 ẋ = a 2 Inv(l 4 ) Inv(l 3 ) Inv(l 2 ) x = e 4 x = e 9 x = e 12 x = e 1 R 5 R 1 ẋ = a 5 ẋ = a 1 Inv(l 5 ) Inv(l 1 ) x = e 5 x = e 10 x = e 11 x = e 8 R 6 ẋ = a 6 Inv(l 6 ) x = e 6 R 7 R 8 ẋ = a x = e 7 7 ẋ = a 8 Inv(l 7 ) Inv(l 8 ) SFM 04 - RT, Bertinoro p. 14/4
29 PCD is a linear hybrid automaton (LHA) R 4 R 3 R 2 x = e 3 x = e 2 ẋ = a 4 ẋ = a 3 ẋ = a 2 Inv(l 4 ) Inv(l 3 ) Inv(l 2 ) x = e 4 x = e 9 x = e 12 x = e 1 R 5 R 1 ẋ = a 5 ẋ = a 1 Inv(l 5 ) Inv(l 1 ) x = e 5 x = e 10 x = e 11 x = e 8 R 6 ẋ = a 6 Inv(l 6 ) x = e 6 R 7 R 8 ẋ = a x = e 7 7 ẋ = a 8 Inv(l 7 ) Inv(l 8 ) SFM 04 - RT, Bertinoro p. 14/4
30 Special classes of Hybrid Automata 3 The most illustrative: Piecewise Affine Maps P1 P2 x := A i x + b i for x P i A1x+b1 A2x+b2 SFM 04 - RT, Bertinoro p. 15/4
31 How to model? a control system SFM 04 - RT, Bertinoro p. 16/4
32 How to model? a control system a scheduler with preemption SFM 04 - RT, Bertinoro p. 16/4
33 How to model? a control system a scheduler with preemption a genetic network SFM 04 - RT, Bertinoro p. 16/4
34 How to model? a control system a scheduler with preemption a genetic network A network of interacting Hybrid automata SFM 04 - RT, Bertinoro p. 16/4
35 Hybrid languages SHIFT Charon Hysdel IF, Uppaal (Timed + ε) why not Simulink? or Simulink+CheckMate. SFM 04 - RT, Bertinoro p. 17/4
36 What to do with a hybrid model Simulate With Matlab/Simulink With dedicated tools Analyze with techniques from control science: Stability analysis Optimal control etc.. Analyze with your favorite techniques. The most important invention is the model. SFM 04 - RT, Bertinoro p. 18/4
37 2. Verification SFM 04 - RT, Bertinoro p. 19/4
38 Outline 1. Hybrid automata - the model 2. Verification Verification and reachability problems Exact methods The curse of undecidability Decidable classes Can realism help? Approximate methods The abstract algorithm Data structures and concrete algorithms Beyond reachability, beyond verification Verification tools 3. Conclusions and perspectives SFM 04 - RT, Bertinoro p. 20/4
39 Verification and reachability problems Is automatic verification possible for HA? SFM 04 - RT, Bertinoro p. 21/4
40 Verification and reachability problems Is automatic verification possible for HA? Safety: are we sure that HA never enters a bad state? It can be seen as reachability : verify that Reach(Init, Bad) SFM 04 - RT, Bertinoro p. 21/4
41 Verification and reachability problems Is automatic verification possible for HA? Safety: are we sure that HA never enters a bad state? It can be seen as reachability : verify that Reach(Init, Bad) It is a natural and challenging mathematical problem. Many works on decidability Some works on approximated techniques SFM 04 - RT, Bertinoro p. 21/4
42 The reachability problem Given a hybrid automaton H and two sets A,B Q R n, find out whether there exists a trajectory of H starting in A and arriving to B. All parameters rational. SFM 04 - RT, Bertinoro p. 22/4
43 Exact methods: Decidable classes Reach(x,y) a trajectory from x to y Reach is decidable for AD: timed automata HKPV95: initialized rectangular automata, extensions of timed automata LPY01: special linear equations + full resets. Method : finite bisimulation (stringent restrictions on the dynamics) KPSY: Integration graphs??? SFM 04 - RT, Bertinoro p. 23/4
44 Decidability 2 Reach is decidable for MP94: 2d PCD. CV96: 2d multi-polynomial systems. ASY01: 2d non-deterministic PCD SFM 04 - RT, Bertinoro p. 24/4
45 Decidability 2 - geometric method consider signatures signatures are simple on the plane (Poincaré-Bendixson) s 1 s 2 s n r 1 r 2 r 3 finitely many patterns r n r n+1 exact acceleration of the cycles is possible. Algorithm: for each pattern compute successors, accelerate cycles. Restrictions: planarity, no jumps SFM 04 - RT, Bertinoro p. 25/4
46 Exact methods: The curse of undecidability Koiran et al.: Reach is undecidable for 2d PAM. AM95: Reach is undecidable for 3d PCD. HPKV95 Many results of the type : 3clocks + 2 stopwatches = undecidable SFM 04 - RT, Bertinoro p. 26/4
47 Anatomy of Undecidability Preliminaries Proof method: simulation of 2-counter (Minsky) machine, TM etc... A counter: values in N; operations: C + +, C ; test C > 0? A Minsky (2 counter) machine q 1 : D + +; goto q 2 q 2 : C ; goto q 3 q 3 : if C > 0 then goto q 2 else q 1 Reachability is undecidable (and Σ 0 1-complete) for Minsky machines. SFM 04 - RT, Bertinoro p. 27/4
48 Simulating a counter x 0 1 C Counter PAM State space N State space [0; 1] State C = n x = 2 n C + + x := x/2 C x := 2x C > 0? x < 0.75? 0 SFM 04 - RT, Bertinoro p. 28/4
49 Encoding a state of a Minsky Machine q 1 q 2 q 3 (3,3) (2,1) Minsky Machine (0,3) PAM State space {q 1,...,q k } N N State space [1;k + 1] State (q i,c = m,d = n) x = i + 2 m,y = 2 n SFM 04 - RT, Bertinoro p. 29/4
50 Simulating a Minsky Machine Minsky Machine PAM State space {q 1,..., q k } N N State space [1; k + 1] [0;1] State (q i, C = m, D = n) x = i + 2 m, y = 2 n q 1 : D + +; goto q 2 x := x + 1 y := y/2 if 1 < x 2 q 2 : C ; goto q 3 x := 2(x 2) + 3 y := y if 2 < x 3 q 3 : if C > 0 then goto q 2 else q 1 x := x 1 y := y x := x 2 y := y if 3 < x < 4 if x = 4 SFM 04 - RT, Bertinoro p. 30/4
51 ... finally we have proved that Reach is undecidable for 2d PAMs. Undecidability proofs for other classes of HA are similar. SFM 04 - RT, Bertinoro p. 31/4
52 A difficult problem 1d piecewise affine maps (PAMs): f : R R f(x) = a i x + b i for x I i a 1 x + b 1 R I 1 I 4 I 3 I 2 I 5 SFM 04 - RT, Bertinoro p. 32/4
53 A difficult problem 1d piecewise affine maps (PAMs): f : R R f(x) = a i x + b i for x I i a 1 x + b 1 R I 1 I 4 I 3 I 2 I 5 a 5 x + b 5 SFM 04 - RT, Bertinoro p. 32/4
54 A difficult problem 1d piecewise affine maps (PAMs): f : R R f(x) = a i x + b i for x I i a 1 x + b 1 R a 4 x + b 4 I 1 I 4 I 3 I 2 I 5 a 5 x + b 5 SFM 04 - RT, Bertinoro p. 32/4
55 A difficult problem 1d piecewise affine maps (PAMs): f : R R f(x) = a i x + b i for x I i a 1 x + b 1 R a 4 x + b 4 I 1 I 4 I 3 I 2 I 5 a 2 x + b 2 a 5 x + b 5 SFM 04 - RT, Bertinoro p. 32/4
56 A difficult problem 1d piecewise affine maps (PAMs): f : R R f(x) = a i x + b i for x I i a 1 x + b 1 R a 4 x + b 4 I 1 I 4 I 3 I 2 I 5 a 2 x + b 2 a 5 x + b 5 SFM 04 - RT, Bertinoro p. 32/4
57 A difficult problem 1d piecewise affine maps (PAMs): f : R R f(x) = a i x + b i for x I i a 1 x + b 1 a 4 x + b 4 R I 1 I 4 I 3 I 2 I 5 a 2 x + b 2 a 5 x + b 5 Old Open Problem. PAM? Is reachability decidable for 1d SFM 04 - RT, Bertinoro p. 32/4
58 Can realism help? Maybe even undecidability is an artefact? Maybe it never occurs in real systems? SFM 04 - RT, Bertinoro p. 33/4
59 Proof method Abstract View Proof by simulation of an infinite state machine by a DS State of machine state of the DS Dynamics of DS simulates transitions of the machine SFM 04 - RT, Bertinoro p. 34/4
60 Consequences for bounded DS witnessing undecidability Important states (sets) of the DS are very dense (have accumulation points) Dynamics should be very precise (at least around accumulation points) It is difficult (impossible) to realize such systems physically...and also: dynamics should be chaotic... infinite state SFM 04 - RT, Bertinoro p. 35/4
61 The Conjecture Reachability is decidable for realistic, unprecise, noisy, fuzzy, robust systems Arguments: The only known proof method uses unbounded precision (or unbounded state space) Noise could regularize... This world is nice and bad things never happen... Engineers design systems and never deal with undecidability. SFM 04 - RT, Bertinoro p. 36/4
62 Some Thoughts and Results All the arguments are weak The problem is interesting I know 3 natural formalizations of realism Non-zero noise: undecidable (Σ 1 -hard) uniform noise: open problem Infinitesimal noise: undecidable and co-r.e. (Π 0 1 -complete) Both positive or negative solution would be interesting for the second one Most of these effects are not specific for a class of systems, they can be ported to any reasonable class. SFM 04 - RT, Bertinoro p. 37/4
63 Approximate methods for reachability In practice approximate methods should be used for safety verification. Several tools, many methods. General principles are easy, implementation difficult. SFM 04 - RT, Bertinoro p. 38/4
64 Abstract algorithm For example consider forward breadth-first search. F=Init repeat F=F SuccFlow(F) SuccJump(F) until fixpoint (F Bad ) tired A standard verification (semi-)algorithm. SFM 04 - RT, Bertinoro p. 39/4
65 How to implement it Needed data structure for (over-)approximate representation of subsets of R n, and algorithms for efficient computing of unions, intersections; inclusion tests; SuccFlow; SuccJump. SFM 04 - RT, Bertinoro p. 40/4
66 Known implementations Polyhedra (HyTech - exact. Checkmate) Griddy polyhedra (d/dt) Ellipsoids (Kurzhanski, Bochkarev) Level sets of functions (Tomlin) f(x)<0 SFM 04 - RT, Bertinoro p. 41/4
67 Does it work? Up to 10 dimensions. Sometimes. SFM 04 - RT, Bertinoro p. 42/4
68 Using advanced verification techniques Searching for better data-structures (SOS, *DD) Abstraction and refinement Combining model-checking and theorem proving Acceleration Bounded model-checking SFM 04 - RT, Bertinoro p. 43/4
69 Beyond verification Generic verification algorithms + hybrid data structures allow: Model-checking Controller synthesis Phase portrait generation SFM 04 - RT, Bertinoro p. 44/4
70 A picture 40 R R R R R R R 29 SFM 04 - RT, Bertinoro p. 45/4
71 3. Final Remarks SFM 04 - RT, Bertinoro p. 46/4
72 Outline 1. Hybrid automata - the model 2. Verification 3. Conclusions and perspectives Conclusions for a pragmatical user Conclusions for a researcher SFM 04 - RT, Bertinoro p. 47/4
73 Conclusions for a pragmatical user A useful and proper model : HA. Modeling languages available. Simulation possible with old and new tools No hope for exact analysis In simple cases approximated analysis (and synthesis) with guarantee is possible using verification paradigm. Tools available (Not discussed) Some control-theoretical techniques available (stability, optimal control etc). SFM 04 - RT, Bertinoro p. 48/4
74 Perspectives for a researcher Obtain new decidability results (nobody cares for undecidability). Explore noise-fuzziness-realism issues Apply modern model-checking techniques to approximate verification of HS Create hybrid theory of formal languages etc. SFM 04 - RT, Bertinoro p. 49/4
models, languages, dynamics Eugene Asarin PIMS/EQINOCS Workshop on Automata Theory and Symbolic Dynamics LIAFA - University Paris Diderot and CNRS
models, s, LIAFA - University Paris Diderot and CNRS PIMS/EQINOCS Workshop on Automata Theory and Symbolic Dynamics Context A model for verification of real-time systems Invented by Alur and Dill in early
More informationAn Introduction to Hybrid Systems Modeling
CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical
More informationRecent results on Timed Systems
Recent results on Timed Systems Time Petri Nets and Timed Automata Béatrice Bérard LAMSADE Université Paris-Dauphine & CNRS berard@lamsade.dauphine.fr Based on joint work with F. Cassez, S. Haddad, D.
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 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 informationRobust computation with dynamical systems
Robust computation with dynamical systems Olivier Bournez 1 Daniel S. Graça 2 Emmanuel Hainry 3 1 École Polytechnique, LIX, Palaiseau, France 2 DM/FCT, Universidade do Algarve, Faro & SQIG/Instituto de
More informationModeling & Control of Hybrid Systems. Chapter 7 Model Checking and Timed Automata
Modeling & Control of Hybrid Systems Chapter 7 Model Checking and Timed Automata Overview 1. Introduction 2. Transition systems 3. Bisimulation 4. Timed automata hs check.1 1. Introduction Model checking
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 informationEECS 144/244: System Modeling, Analysis, and Optimization
EECS 144/244: System Modeling, Analysis, and Optimization Continuous Systems Lecture: Hybrid Systems Alexandre Donzé University of California, Berkeley April 5, 2013 Alexandre Donzé: EECS 144/244 Hybrid
More informationREACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
International Journal of Foundations of Computer Science c World Scientific Publishing Company REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS OLEKSIY KURGANSKYY Institute of Applied Mathematics
More informationThe algorithmic analysis of hybrid system
The algorithmic analysis of hybrid system Authors: R.Alur, C. Courcoubetis etc. Course teacher: Prof. Ugo Buy Xin Li, Huiyong Xiao Nov. 13, 2002 Summary What s a hybrid system? Definition of Hybrid Automaton
More informationModels for Efficient Timed Verification
Models for Efficient Timed Verification François Laroussinie LSV / ENS de Cachan CNRS UMR 8643 Monterey Workshop - Composition of embedded systems Model checking System Properties Formalizing step? ϕ Model
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 informationEffective Synthesis of Switching Controllers for Linear Systems
PROCEEDINGS OF THE IEEE 1 Effective Synthesis of Switching Controllers for Linear Systems Eugene Asarin, Olivier Bournez, Thao Dang, Oded Maler and Amir Pnueli Abstract In this work we suggest a novel
More informationEE291E Lecture Notes 3 Autonomous Hybrid Automata
EE9E Lecture Notes 3 Autonomous Hybrid Automata Claire J. Tomlin January, 8 The lecture notes for this course are based on the first draft of a research monograph: Hybrid Systems. The monograph is copyright
More informationA Decidable Class of Planar Linear Hybrid Systems
A Decidable Class of Planar Linear Hybrid Systems Pavithra Prabhakar, Vladimeros Vladimerou, Mahesh Viswanathan, and Geir E. Dullerud University of Illinois at Urbana-Champaign. Abstract. The paper shows
More informationA Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control
A Automatic Synthesis of Switching Controllers for Linear Hybrid Systems: Reachability Control Massimo Benerecetti, University of Naples Federico II, Italy Marco Faella, University of Naples Federico II,
More informationLecture 6: Reachability Analysis of Timed and Hybrid Automata
University of Illinois at Urbana-Champaign Lecture 6: Reachability Analysis of Timed and Hybrid Automata Sayan Mitra Special Classes of Hybrid Automata Timed Automata ß Rectangular Initialized HA Rectangular
More informationfor System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Stavros Tripakis UC Berkeley EECS 144/244 Fall 2013 Copyright 2013, E. A. Lee, J. Roydhowdhury, S. A. Seshia, S. Tripakis All rights
More informationHybrid Control and Switched Systems. Lecture #1 Hybrid systems are everywhere: Examples
Hybrid Control and Switched Systems Lecture #1 Hybrid systems are everywhere: Examples João P. Hespanha University of California at Santa Barbara Summary Examples of hybrid systems 1. Bouncing ball 2.
More information540 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 4, APRIL Algorithmic Analysis of Nonlinear Hybrid Systems
540 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 4, APRIL 1998 Algorithmic Analysis of Nonlinear Hybrid Systems Thomas A. Henzinger, Pei-Hsin Ho, Howard Wong-Toi Abstract Hybrid systems are digital
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 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 informationHybrid Automata. Lecturer: Tiziano Villa 1. Università di Verona
Hybrid Automata Lecturer: Tiziano Villa 1 1 Dipartimento d Informatica Università di Verona tiziano.villa@univr.it Thanks to Carla Piazza, Dipartimento di Matematica ed Informatica, Università di Udine
More informationTimed Automata. Chapter Clocks and clock constraints Clock variables and clock constraints
Chapter 10 Timed Automata In the previous chapter, we have discussed a temporal logic where time was a discrete entities. A time unit was one application of the transition relation of an LTS. We could
More informationEECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization
EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Discrete Systems Lecture: Automata, State machines, Circuits Stavros Tripakis University of California, Berkeley Stavros
More informationSymbolic Reachability Analysis of Lazy Linear Hybrid Automata. Susmit Jha, Bryan Brady and Sanjit A. Seshia
Symbolic Reachability Analysis of Lazy Linear Hybrid Automata Susmit Jha, Bryan Brady and Sanjit A. Seshia Traditional Hybrid Automata Traditional Hybrid Automata do not model delay and finite precision
More informationEE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories. Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo
EE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories 1 Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo Outline: Contracts and compositional methods for system design Where and why using
More informationFlat counter automata almost everywhere!
Flat counter automata almost everywhere! Jérôme Leroux and Grégoire Sutre Projet Vertecs, IRISA / INRIA Rennes, FRANCE Équipe MVTsi, CNRS / LABRI, FRANCE Counter-automata verification A simple counter-automata:
More informationTimed Automata. Semantics, Algorithms and Tools. Zhou Huaiyang
Timed Automata Semantics, Algorithms and Tools Zhou Huaiyang Agenda } Introduction } Timed Automata } Formal Syntax } Operational Semantics } Verification Problems } Symbolic Semantics & Verification }
More informationVerification of Polynomial Interrupt Timed Automata
Verification of Polynomial Interrupt Timed Automata Béatrice Bérard 1, Serge Haddad 2, Claudine Picaronny 2, Mohab Safey El Din 1, Mathieu Sassolas 3 1 Université P. & M. Curie, LIP6 2 ENS Cachan, LSV
More informationAs Soon As Probable. O. Maler, J.-F. Kempf, M. Bozga. March 15, VERIMAG Grenoble, France
As Soon As Probable O. Maler, J.-F. Kempf, M. Bozga VERIMAG Grenoble, France March 15, 2013 O. Maler, J.-F. Kempf, M. Bozga (VERIMAG Grenoble, France) As Soon As Probable March 15, 2013 1 / 42 Executive
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 informationPart I: Definitions and Properties
Turing Machines Part I: Definitions and Properties Finite State Automata Deterministic Automata (DFSA) M = {Q, Σ, δ, q 0, F} -- Σ = Symbols -- Q = States -- q 0 = Initial State -- F = Accepting States
More informationAn Introduction to Hybrid Systems Modeling
CS620, IIT BOMBAY An Introduction to Hybrid Systems Modeling Ashutosh Trivedi Department of Computer Science and Engineering, IIT Bombay CS620: New Trends in IT: Modeling and Verification of Cyber-Physical
More informationLiveness in L/U-Parametric Timed Automata
Liveness in L/U-Parametric Timed Automata Étienne André and Didier Lime [AL17] Université Paris 13, LIPN and École Centrale de Nantes, LS2N Highlights, 14 September 2017, London, England Étienne André
More informationTimed Automata VINO 2011
Timed Automata VINO 2011 VeriDis Group - LORIA July 18, 2011 Content 1 Introduction 2 Timed Automata 3 Networks of timed automata Motivation Formalism for modeling and verification of real-time systems.
More informationAutomatic Generation of Polynomial Invariants for System Verification
Automatic Generation of Polynomial Invariants for System Verification Enric Rodríguez-Carbonell Technical University of Catalonia Talk at EPFL Nov. 2006 p.1/60 Plan of the Talk Introduction Need for program
More informationControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
Control Synthesis of Discrete Manufacturing Systems using Timed Finite utomata JROSLV FOGEL Institute of Informatics Slovak cademy of Sciences ratislav Dúbravská 9, SLOVK REPULIC bstract: - n application
More informationDecidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata Joseph S. Miller Department of Mathematics Cornell University Ithaca, NY 14853 jmiller@math.cornell.edu Abstract.
More informationUsing Theorem Provers to Guarantee Closed-Loop Properties
Using Theorem Provers to Guarantee Closed-Loop Properties Nikos Aréchiga Sarah Loos André Platzer Bruce Krogh Carnegie Mellon University April 27, 2012 Aréchiga, Loos, Platzer, Krogh (CMU) Theorem Provers
More informationTIMED automata, introduced by Alur and Dill in [3], have
1 Language Inclusion Checking of Timed Automata with Non-Zenoness Xinyu Wang, Jun Sun, Ting Wang, and Shengchao Qin Abstract Given a timed automaton P modeling an implementation and a timed automaton S
More informationVerification of analog and mixed-signal circuits using hybrid systems techniques
FMCAD, November 2004, Austin Verification of analog and mixed-signal circuits using hybrid systems techniques Thao Dang, Alexandre Donze, Oded Maler VERIMAG Grenoble, France Plan 1. Introduction 2. Verification
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 informationOn simulations and bisimulations of general flow systems
On simulations and bisimulations of general flow systems Jen Davoren Department of Electrical & Electronic Engineering The University of Melbourne, AUSTRALIA and Paulo Tabuada Department of Electrical
More informationCEGAR:Counterexample-Guided Abstraction Refinement
CEGAR: Counterexample-guided Abstraction Refinement Sayan Mitra ECE/CS 584: Embedded System Verification November 13, 2012 Outline Finite State Systems: Abstraction Refinement CEGAR Validation Refinment
More informationOn decision problems for timed automata
On decision problems for timed automata Olivier Finkel Equipe de Logique Mathématique, U.F.R. de Mathématiques, Université Paris 7 2 Place Jussieu 75251 Paris cedex 05, France. finkel@logique.jussieu.fr
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 informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems 7. Linear hybrid automata II Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 6 October
More informationOverview. Discrete Event Systems Verification of Finite Automata. What can finite automata be used for? What can finite automata be used for?
Computer Engineering and Networks Overview Discrete Event Systems Verification of Finite Automata Lothar Thiele Introduction Binary Decision Diagrams Representation of Boolean Functions Comparing two circuits
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 informationEmbedded Systems 5. Synchronous Composition. Lee/Seshia Section 6.2
Embedded Systems 5-1 - Synchronous Composition Lee/Seshia Section 6.2 Important semantic model for concurrent composition Here: composition of actors Foundation of Statecharts, Simulink, synchronous programming
More informationLogic Model Checking
Logic Model Checking Lecture Notes 10:18 Caltech 101b.2 January-March 2004 Course Text: The Spin Model Checker: Primer and Reference Manual Addison-Wesley 2003, ISBN 0-321-22862-6, 608 pgs. the assignment
More informationAnalysis and synthesis: a complexity perspective
Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications
More informationOn Reachability for Hybrid Automata over Bounded Time
On Reachability for Hybrid Automata over Bounded Time Thomas Brihaye, Laurent Doyen 2, Gilles Geeraerts 3, Joël Ouaknine 4, Jean-François Raskin 3, and James Worrell 4 Université de Mons, Belgium 2 LSV,
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 informationIntroduction to Turing Machines. Reading: Chapters 8 & 9
Introduction to Turing Machines Reading: Chapters 8 & 9 1 Turing Machines (TM) Generalize the class of CFLs: Recursively Enumerable Languages Recursive Languages Context-Free Languages Regular Languages
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 informationRecognizing Safety and Liveness by Alpern and Schneider
Recognizing Safety and Liveness by Alpern and Schneider Calvin Deutschbein 17 Jan 2017 1 Intro 1.1 Safety What is safety? Bad things do not happen For example, consider the following safe program in C:
More informationLogics for Hybrid Systems
Logics for Hybrid Systems J. M. DAVOREN, MEMBER, IEEE, AND ANIL NERODE, MEMBER, IEEE Invited Paper Hybrid systems are heterogenous dynamical systems characterized by interacting continuous discrete dynamics.
More informationSoftware Verification
Software Verification Grégoire Sutre LaBRI, University of Bordeaux, CNRS, France Summer School on Verification Technology, Systems & Applications September 2008 Grégoire Sutre Software Verification VTSA
More informationSupervisory Control of Hybrid Systems
X.D. Koutsoukos, P.J. Antsaklis, J.A. Stiver and M.D. Lemmon, "Supervisory Control of Hybrid Systems, in Special Issue on Hybrid Systems: Theory and Applications, Proceedings of the IEEE, P.J. Antsaklis,
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
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 informationLecture 11: Timed Automata
Real-Time Systems Lecture 11: Timed Automata 2014-07-01 11 2014-07-01 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: DC (un)decidability This Lecture:
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 informationThe State Explosion Problem
The State Explosion Problem Martin Kot August 16, 2003 1 Introduction One from main approaches to checking correctness of a concurrent system are state space methods. They are suitable for automatic analysis
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 informationReal-Time Systems. Lecture 10: Timed Automata Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany main
Real-Time Systems Lecture 10: Timed Automata 2013-06-04 10 2013-06-04 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: PLC, PLC automata This Lecture:
More informationTimo Latvala. March 7, 2004
Reactive Systems: Safety, Liveness, and Fairness Timo Latvala March 7, 2004 Reactive Systems: Safety, Liveness, and Fairness 14-1 Safety Safety properties are a very useful subclass of specifications.
More informationAutomata-based Verification - III
COMP30172: Advanced Algorithms Automata-based Verification - III Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2009 Third Topic Infinite Word Automata Motivation Büchi Automata
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 informationSome techniques and results in deciding bisimilarity
Some techniques and results in deciding bisimilarity Petr Jančar Dept of Computer Science Technical University Ostrava (FEI VŠB-TU) Czech Republic www.cs.vsb.cz/jancar Talk at the Verification Seminar,
More informationStudy skills for mathematicians
PART I Study skills for mathematicians CHAPTER 1 Sets and functions Everything starts somewhere, although many physicists disagree. Terry Pratchett, Hogfather, 1996 To think like a mathematician requires
More informationClasses and conversions
Classes and conversions Regular expressions Syntax: r = ε a r r r + r r Semantics: The language L r of a regular expression r is inductively defined as follows: L =, L ε = {ε}, L a = a L r r = L r L r
More information5.4 Continuity: Preliminary Notions
5.4. CONTINUITY: PRELIMINARY NOTIONS 181 5.4 Continuity: Preliminary Notions 5.4.1 Definitions The American Heritage Dictionary of the English Language defines continuity as an uninterrupted succession,
More informationCSC236 Week 11. Larry Zhang
CSC236 Week 11 Larry Zhang 1 Announcements Next week s lecture: Final exam review This week s tutorial: Exercises with DFAs PS9 will be out later this week s. 2 Recap Last week we learned about Deterministic
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 informationVerification of Nonlinear Hybrid Systems with Ariadne
Verification of Nonlinear Hybrid Systems with Ariadne Luca Geretti and Tiziano Villa June 2, 2016 June 2, 2016 Verona, Italy 1 / 1 Outline June 2, 2016 Verona, Italy 2 / 1 Outline June 2, 2016 Verona,
More informationarxiv: v1 [cs.lo] 19 Mar 2019
Turing-Completeness of Dynamics in Abstract Persuasion Argumentation Ryuta Arisaka arxiv:1903.07837v1 [cs.lo] 19 Mar 2019 ryutaarisaka@gmail.com Abstract. Abstract Persuasion Argumentation (APA) is a dynamic
More informationHierarchical Control of Piecewise Linear Hybrid Dynamical Systems Based on Discrete Abstractions Λ
Hierarchical Control of Piecewise Linear Hybrid Dynamical Systems Based on Discrete Abstractions Λ Xenofon D. Koutsoukos Xerox Palo Alto Research Center 3333 Coyote Hill Road Palo Alto, CA 94304, USA Tel.
More informationarxiv: v1 [cs.fl] 25 Nov 2018
Real-Time Systems Modeling and Analysis Lakhan Shiva Kamireddy [0000 0001 6007 5408] University of Colorado, Boulder CO 80302, USA {lakhan.kamireddy}@colorado.edu arxiv:1811.10083v1 [cs.fl] 25 Nov 2018
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems Algorithmic analysis for linear hybrid systems Prof. Dr. Erika Ábrahám Informatik 2 - Theory of Hybrid Systems RWTH Aachen University SS 2015 Ábrahám - Hybrid Systems
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turing-recognizable languages that were not mentioned in previous lectures. In particular, we will
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems 5. Linear hybrid automata I Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October
More informationModeling and Analysis of Hybrid Systems Linear hybrid automata I Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017
More informationFinite State Machines. CS 447 Wireless Embedded Systems
Finite State Machines CS 447 Wireless Embedded Systems Outline Discrete systems Finite State Machines Transitions Timing Update functions Determinacy and Receptiveness 1 Discrete Systems Operates in sequence
More informationAnnouncements. Final exam review session tomorrow in Gates 104 from 2:15PM 4:15PM Final Friday Four Square of the quarter!
The Big Picture Problem Problem Set Set 99 due due in in the the box box up up front. front. Congrats Congrats on on finishing finishing the the last last problem problem set set of of the the quarter!
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 informationITCS:CCT09 : Computational Complexity Theory Apr 8, Lecture 7
ITCS:CCT09 : Computational Complexity Theory Apr 8, 2009 Lecturer: Jayalal Sarma M.N. Lecture 7 Scribe: Shiteng Chen In this lecture, we will discuss one of the basic concepts in complexity theory; namely
More informationTimed Automata with Observers under Energy Constraints
Timed Automata with Observers under Energy Constraints Patricia Bouyer-Decitre Uli Fahrenberg Kim G. Larsen Nicolas Markey LSV, CNRS & ENS Cachan, France Aalborg Universitet, Danmark /9 Introduction The
More informationComputational Models #1
Computational Models #1 Handout Mode Nachum Dershowitz & Yishay Mansour March 13-15, 2017 Nachum Dershowitz & Yishay Mansour Computational Models #1 March 13-15, 2017 1 / 41 Lecture Outline I Motivation
More informationControlling probabilistic systems under partial observation an automata and verification perspective
Controlling probabilistic systems under partial observation an automata and verification perspective Nathalie Bertrand, Inria Rennes, France Uncertainty in Computation Workshop October 4th 2016, Simons
More informationAutomata on linear orderings
Automata on linear orderings Véronique Bruyère Institut d Informatique Université de Mons-Hainaut Olivier Carton LIAFA Université Paris 7 September 25, 2006 Abstract We consider words indexed by linear
More informationEmbedded Systems 2. REVIEW: Actor models. A system is a function that accepts an input signal and yields an output signal.
Embedded Systems 2 REVIEW: Actor models A system is a function that accepts an input signal and yields an output signal. The domain and range of the system function are sets of signals, which themselves
More informationNonlinear Control as Program Synthesis (A Starter)
Nonlinear Control as Program Synthesis (A Starter) Sicun Gao MIT December 15, 2014 Preliminaries Definition (L RF ) L RF is the first-order language over the reals that allows arbitrary numerically computable
More informationFrom games to executables!
From games to executables! Implementations of strategies generated from UPPAAL TIGA by Kenneth Blanner Holleufer and Jesper Brix Rosenkilde THESIS for the degree of MASTER OF SCIENCE (Master of computer
More informationc 2011 Kyoung-Dae Kim
c 2011 Kyoung-Dae Kim MIDDLEWARE AND CONTROL OF CYBER-PHYSICAL SYSTEMS: TEMPORAL GUARANTEES AND HYBRID SYSTEM ANALYSIS BY KYOUNG-DAE KIM DISSERTATION Submitted in partial fulfillment of the requirements
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 informationDecentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication
Decentralized Control of Discrete Event Systems with Bounded or Unbounded Delay Communication Stavros Tripakis Abstract We introduce problems of decentralized control with communication, where we explicitly
More information