Modeling and Analysis of Hybrid Systems
|
|
- Ursula Cobb
- 6 years ago
- Views:
Transcription
1 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 1 / 22
2 Literature Alur et al.: The algorithmic analysis of hybrid systems Theoretical Computer Science, 138(1):3 34, 1995 Ábrahám - Hybrid Systems 2 / 22
3 Linear terms, constraints and formulas A linear term e over a set Var of variables is of the form e ::= c c x e + e where x Var is a variable and c stays for an integer (rational) constant. Example: x 1 + 2x 2 + 5x 3 is a linear term over Var = {x 1, x 2, x 3 }. A linear constraint t over Var is an (in)equality t ::= e 0 with {>,, =,, <} and e a linear term over Var. Example: x 1 + 2x 2 + ( 2) 0 is a linear constraint over Var = {x 1, x 2 }. We sometimes deviate from this normal form and write, e.g., x 1 + 2x 2 2. Ábrahám - Hybrid Systems 3 / 22
4 Linear terms, constraints and formulas A conjunctive linear formula ϕ over Var is defined by the following grammar: ϕ ::= t ϕ ϕ x. ϕ with t a linear constraint over Var and x Var a variable. Let Φ X be the set of all conjunctive linear formulas with free (non-quantified) variables from X Var. Example: t. x 1. x 1 0 x 1 = x 1 + 2t t 0 is a conjunctive linear formula over {x 1, x 1, t}, with free (non-quantified) variables {x 1 }. A region over Var is a pair (l, ϕ) Loc Φ Var of a location and a conjunctive linear formula with free variables from Var. Example: (l, t. x 1. x 1 0 x 1 = x 1 + 2t t 0) is a region over {x 1 }. We will use the intersection of two sets P i, P j Loc Φ Var of regions, defined as P 1 ˆ P 2 = {(l, ϕ 1 ϕ 2 ) (l, ϕ 1 ) P 1, (l, ϕ 2 ) P 2 }. Ábrahám - Hybrid Systems 4 / 22
5 Substitution Assume a set Var of variables, a linear formula ϕ Φ Var over Var, a variable x Var, and a linear term e over Var. The substitution ϕ[e/x] replaces each free occurrence of x in ϕ by e. Example: (x + 2y 0)[5/y] = x Example: ( y. x + 2y 0)[5/y] = x + 2y 0 We also write ϕ[e 1,..., e n /x 1,..., x n ] instead of ϕ[e 1 /x 1 ]... [e n /x n ]. For Var = {x 1,..., x n } we will also use a primed variable set Var = {x 1,..., x n} and write short ϕ[var /Var] for ϕ[x 1 /x 1]... [x n/x n ]. Ábrahám - Hybrid Systems 5 / 22
6 Linear terms, constraints and formulas The semantics of linear terms, constraints and formulas over Var = {x 1,..., x n } in the context of a valuation ν V Var (i.e., ν : Var R) is as usual (we use the same notation for the syntax and the semantics of constants and operators): ν(c) c ν(c x) c ν(x) ν(e 1 + e 2 ) ν(e 1 ) + ν(e 2 ) ν(e 0) ν(e) 0 ν(ϕ 1 ϕ 2 ) ν(ϕ 1 ) and ν(ϕ 2 ) ν( x. ϕ) exists v R such that ν(ϕ[v/x]) holds Ábrahám - Hybrid Systems 6 / 22
7 Linear terms, constraints and formulas The solution set Sat(ϕ) of a linear formula ϕ over Var is the set of all valuations ν V Var that make ϕ true: Sat(ϕ) = {ν V Var ν(ϕ) holds} The solution set Sat((l, ϕ)) of a region (l, ϕ) Loc Φ Var over Loc and Var is Sat((l, ϕ)) = {(l, ν) Loc V Var ν(ϕ) holds} Two region sets P 1, P 2 Loc Φ Var are equivalent, written P 1 ˆ=P 2, iff Sat(R) = Sat(R). R P 1 R P 2 We define similarly the inclusion P 1 ˆ P 2 iff Sat(R) Sat(R). R P 1 R P 2 Ábrahám - Hybrid Systems 7 / 22
8 Linear hybrid automata I A linear hybrid automaton is a hybrid automaton H = (Loc, Var, Lab, Edge, Act, Inv, Init) which can be represented by a tuple H = (Loc, Var, Lab, Edge, Act, Inv, Init) satisfying the following: The finite set Edge Loc Φ Var Φ Var Var Loc defines the set of edges Edge = {(l, µ e, l ) e = (l, Guard e, Reset e, l ) Edge}, where the transition relation µ e is given as µ e = {(ν, ν ) V Var V Var ν Sat(Guard e ) and (ν ν ) Sat(Reset e )} with ν ν V Var Var such that (ν ν )(x) = ν(x) for x Var and (ν ν )(x ) = ν (x) for x Var. The set Act Loc Φ Var contains for each location l Loc exactly one region (l, Act l ) Act whose second component is of the form Act l = n i=1 x i + kl,i lower t x i x i x i + k upper l,i t, defining the activities Act(l) = {f : R 0 V Var f xi [kl,i lower, k upper l,i ] for all i {1,..., n}}, where f xi : R 0 R with f xi (t) = f(t)(x i ) for all t R 0. Ábrahám - Hybrid Systems 8 / 22
9 Linear hybrid automata I (cont.) The set Inv Loc Φ Var contains for each location l Loc exactly one region (l, Inv l ) Inv such that Inv(l) = Sat(Inv l ). Init Loc Φ Var is a finite set of regions specifying the initial states by Init = {(l, ν) ν Sat(ϕ)}. (l,ϕ) Init Ábrahám - Hybrid Systems 9 / 22
10 Water-level monitor x = 0 y = 1 l 0 ẋ = 1 ẏ = 1 y 10 y = 10 x := 0 l 1 ẋ = 1 ẏ = 1 x 2 x = 2 x = 2 l 3 ẋ = 1 ẏ = 2 x 2 y = 5 x := 0 l 2 ẋ = 1 ẏ = 2 y 5 Ábrahám - Hybrid Systems 10 / 22
11 Mixer of fluids l 1 ẋ 1 = 0 ẋ 2 [l 2, u 2 ] x 1 + x 2 d 2x 1 x < l 1 < u 1, 0 < l 2 < u 2, l u 0, d > 0, c > 0 2x 1 x 2 = c 2x 1 x 2 = 0 x 1 = 0 x 2 = 0 l 0 ẋ 1 [l 1, u 1 ] ẋ 2 [l 2, u 2 ] x 1 + x 2 d c 2x 1 x 2 c 2x 1 x 2 = c 2x 1 x 2 = 0 l 2 ẋ 1 [l 1, u 1 ] ẋ 2 = 0 x 1 + x 2 d 2x 1 x 2 0 x = 0 x 1 := 0 x 2 := 0 x 1 + x 2 = d x := d x 1 + x 2 = d x := d l 3 ẋ [l, u] x 0 x 1 + x 2 = d x := d Ábrahám - Hybrid Systems 11 / 22
12 Reminder: Semantics of hybrid automata (l, a, µ, l ) Edge (ν, ν ) µ ν Inv(l ) (l, ν) a (l, ν ) Rule Discrete f Act(l) f(0) = ν f(t) = ν t 0 0 t t.f(t ) Inv(l) Rule Time (l, ν) t (l, ν ) Ábrahám - Hybrid Systems 12 / 22
13 Forward analysis Ábrahám - Hybrid Systems 13 / 22
14 Given a set if initial states Init Σ, we want to compute the set of all states which are reachable from Init: Reach + (Init) = {σ Σ σ Init. σ σ }. Ábrahám - Hybrid Systems 14 / 22
15 Given a set if initial states Init Σ, we want to compute the set of all states which are reachable from Init: Reach + (Init) = {σ Σ σ Init. σ σ }. More specifically, we want to check whether the reachable region intersects with a set of bad (unsafe) states. Ábrahám - Hybrid Systems 14 / 22
16 Forward reachability analysis method forward_ reach ( h y b r i d automaton r e p r e s e n t a t i o n H = (Loc, Var, Lab, Edge, Act, Inv, Init), r e g i o n s e t P bad ) { // s t a r t from the time s u c c e s s o r s o f i n i t i a l r e g i o n s P 0 := T + (Init ˆ Inv) ; i f (P 0 ˆ P bad ) return u n s a f e ; i := 0 ; while P i { // compute P i+1 := T + (D + (P i )) P i+1 := ; f o r each (R = (l, φ) P i ) { f o r each e = (l,,, l ) Edge { R := T + l (D+ e (R)) ; i f ({R } ˆ P bad ) return u n s a f e ; e l s e i f ( not {R } ˆ i j=0 P j ) P i+1 := P i+1 {R } ; } } i := i +1; } return s a f e ; } Ábrahám - Hybrid Systems 15 / 22
17 One-step reachability under time steps We define the forward time closure T + l (ϕ) of a formula ϕ Φ Var at l Loc as T + l (ϕ) = x pre. t. t 0 ϕ[x pre /x] Act l [x pre, x/x, x ] Inv l Region R = (l, ϕ) Loc Φ Var : T + Set of regions P Loc Φ Var : l (R) = (l, T + (ϕ)) T + (P ) = {T + l (R) R = (l, ϕ) P } l Ábrahám - Hybrid Systems 16 / 22
18 One-step reachability under discrete steps We define the postcondition D + e (ϕ) of a formula ϕ Φ Var with respect to an edge e = (l, Guard e, Reset e, l ) as D + e (ϕ) = x pre. ϕ[x pre /x] Guard e [x pre /x] Reset e [x pre, x/x, x ] Inv l. Region R = (l, ϕ) Loc Φ Var : Set of regions P Loc Φ Var : D + e (R) = (l, D + e (ϕ)) D + (P ) = {D + e (R) R = (l, ϕ) P, e = (l, Guard e, Reset e, l ) Edge} Ábrahám - Hybrid Systems 17 / 22
19 Backward analysis Ábrahám - Hybrid Systems 18 / 22
20 Given a set if target states B Σ, we want to compute the set of all states from which a state in B is reachable: Reach (B) = {σ Σ σ B. σ σ }. Ábrahám - Hybrid Systems 19 / 22
21 Given a set if target states B Σ, we want to compute the set of all states from which a state in B is reachable: Reach (B) = {σ Σ σ B. σ σ }. More specifically, we want to check whether the set of backward reachable states intersects with a set of initial states. Ábrahám - Hybrid Systems 19 / 22
22 Backward reachability analysis method backward_ reach ( ) { i := 0 ; P 0 := {T l (R) R = (l, ϕ) P bad ˆ Inv} ; // time p r e d e c. o f bad r e g i f (P 0 ˆ Init ) return u n s a f e ; while P i { // compute time p r e d e c e s s o r s o f // d i s c r e t e p r e d e c e s s o r s o f a l l r e g i o n s from P i f o r each (R = (l, φ) P i ) { f o r each e = (l,,, l) Edge { R := T l (D e (R)) ; i f ({R } ˆ Init ) return u n s a f e ; e l s e i f ( not {R } ˆ i j=0 P j ) P i+1 := P i+1 {R } ; } } i := i +1; } return s a f e ; } Ábrahám - Hybrid Systems 20 / 22
23 One-step reachability under time steps We define the backward time closure T l (ϕ) of a formula ϕ Φ Var at l Loc as T l (ϕ) = x post. t. t 0 ϕ[x post /x] Act l [x, x post /x, x ] Inv l. Region R = (l, ϕ) Loc Φ Var : T l Set of regions P Loc Φ Var : (R) = (l, T (ϕ)) T (P ) = {T l (R) R = (l, ϕ) P } l Ábrahám - Hybrid Systems 21 / 22
24 One-step reachability under discrete steps We define the precondition D e (ϕ) of a formula ϕ Φ Var with respect to an edge e = (l, Guard e, Reset e, l ) as D e (ϕ) = x post. ϕ[x post /x] Guard e Reset e [x, x post /x, x ] Inv l. Region R = (l, ϕ) Loc Φ Var : Set of regions P Loc Φ Var : D e (R) = (l, D e (ϕ)) D (P ) = {D e (R) R = (l, ϕ) P, e = (l, Guard e, Reset e, l ) Edge} Ábrahám - Hybrid Systems 22 / 22
Modeling 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 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 informationDecidability Results for Probabilistic Hybrid Automata
Decidability Results for Probabilistic Hybrid Automata Prof. Dr. Erika Ábrahám Informatik 2 - Theory of Hybrid Systems RWTH Aachen SS09 - Probabilistic hybrid automata 1 / 17 Literatur Jeremy Sproston:
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 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 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 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 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 informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems Linear hybrid automata II: Approximation of reachable state sets Prof. Dr. Erika Ábrahám Informatik 2 - Theory of Hybrid Systems RWTH Aachen University SS 2015 Ábrahám
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 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 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 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 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 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 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 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 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 informationLecturecise 22 Weak monadic second-order theory of one successor (WS1S)
Lecturecise 22 Weak monadic second-order theory of one successor (WS1S) 2013 Reachability in the Heap Many programs manipulate linked data structures (lists, trees). To express many important properties
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 informationUser s Manual of Flow* Version 2.0.0
User s Manual of Flow* Version 2.0.0 Xin Chen University of Colorado, Boulder 1 Introduction Flow* is a tool for safety verification of hybrid systems. Given a real-valued interval, a natural number m,
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 informationRobustness and Implementability of Timed Automata
Robustness and Implementability of Timed Automata Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin Computer Science Departement, Université Libre de Bruxelles, Belgium Abstract.
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 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 informationTopics in Timed Automata
1/32 Topics in Timed Automata B. Srivathsan RWTH-Aachen Software modeling and Verification group 2/32 Timed Automata A theory of timed automata R. Alur and D. Dill, TCS 94 2/32 Timed Automata Language
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
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 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 informationClock Matrix Diagrams
Clock Matrix Diagrams U N I V E R S I T A S S A R A V I E N I S S Bachelor s Thesis Daniel Fass daniel@react.cs.uni-sb.de Reactive Systems Group Department of Computer Science Universität des Saarlandes
More informationHybrid systems and computer science a short tutorial
Hybrid systems and computer science a short tutorial Eugene Asarin Université Paris 7 - LIAFA SFM 04 - RT, Bertinoro p. 1/4 Introductory equations Hybrid Systems = Discrete+Continuous SFM 04 - RT, Bertinoro
More informationSpecification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata WOJCIECH PENCZEK ICS PAS, Warsaw, Poland joint work with Agata Półrola University of Lodz, Poland Many thanks
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 informationAn Efficient State Space Generation for the Analysis of Real-Time Systems
University of Pennsylvania ScholarlyCommons Departmental Papers (CIS) Department of Computer & Information Science May 2000 An Efficient State Space Generation for the Analysis of Real-Time Systems Inhye
More informationQuasi-Dependent Variables in Hybrid Automata
Quasi-Dependent Variables in Hybrid Automata Sergiy Bogomolov Albert-Ludwigs-Universität Freiburg Bernd Westphal Albert-Ludwigs-Universität Freiburg Christian Herrera Albert-Ludwigs-Universität Freiburg
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 informationUSING EIGENVALUE DECOMPOSITION
The present work was submitted to the LuFG Theory of Hybrid Systems BACHELOR OF SCIENCE THESIS USING EIGENVALUE DECOMPOSITION IN HYBRID SYSTEMS REACHABILITY ANALYSIS Jan Philipp Hafer Examiners: Prof.
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 informationA new Abstraction-Refinement based Verifier for Modular Linear Hybrid Automata and its Implementation
A new Abstraction-Refinement based Verifier for Modular Linear Hybrid Automata and its Implementation Hao Ren 1 (ren@iastate.edu), Jing Huang 2 (freescaler@live.com), Shengbing Jiang 3 (shengbing.jiang@gm.com)
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 of Industrial Systems to Avoid Failures: Application to Electrical System
Control of Industrial Systems to Avoid Failures: Application to Electrical System Yamen EL TOUATI Department of Computer Science Faculty of Computing and Information Technology Northern Border 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 informationTime-abstracting Bisimulation for Probabilistic Timed Automata
Time-abstracting Bisimulation for Probabilistic Timed Automata Taolue Chen CWI PO Box 94079, 1090 GB Amsterdam, The Netherlands chen@cwi.nl Tingting Han Joost-Pieter Katoen MOVES, RWTH Aachen University,
More informationThe Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jari Stenman Uppsala University, Sweden Abstract. This paper introduces the model of
More informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationAxiomatic Semantics. Lecture 9 CS 565 2/12/08
Axiomatic Semantics Lecture 9 CS 565 2/12/08 Axiomatic Semantics Operational semantics describes the meaning of programs in terms of the execution steps taken by an abstract machine Denotational semantics
More informationAbstractions for Hybrid Systems
Abstractions for Hybrid Systems Ashish Tiwari (tiwari@csl.sri.com) SRI International, 333 Ravenswood Ave, Menlo Park, CA, U.S.A Abstract. We present a procedure for constructing sound finite-state discrete
More informationPredicate Calculus. Formal Methods in Verification of Computer Systems Jeremy Johnson
Predicate Calculus Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. Motivation 1. Variables, quantifiers and predicates 2. Syntax 1. Terms and formulas 2. Quantifiers, scope
More informationSaarland University Faculty of Natural Sciences and Technology I Department of Computer Science. Bachelor Thesis. From Uppaal To Slab.
Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science Bachelor Thesis From Uppaal To Slab submitted by Andreas Abel submitted August 26, 2009 Supervisor Prof.
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 informationSatisfiability Checking
Satisfiability Checking Interval Constraint Propagation Prof. Dr. Erika Ábrahám RWTH Aachen University Informatik 2 LuFG Theory of Hybrid Systems WS 14/15 Satisfiability Checking Prof. Dr. Erika Ábrahám
More informationSymbolic Quantitative Robustness Analysis of Timed Automata
Symbolic Quantitative Robustness Analysis of Timed Automata Ocan Sankur To cite this version: Ocan Sankur. Symbolic Quantitative Robustness Analysis of Timed Automata. Tools and Algorithms for the Construction
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
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 informationLTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems
This space is reserved for the EPiC Series header, do not use it LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems Rachel Faran and Orna Kupferman The Hebrew University,
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 informationFunctional Reachability
Functional Reachability Luke Ong Nikos Tzevelekos Oxford University Computing Laboratory 24th Symposium on Logic in Computer Science Los Angeles, August 2009. Ong & Tzevelekos Functional Reachability 1
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 informationZone-based Synthesis of Timed Models with Strict Phased Fault Recovery
Zone-based Synthesis of Timed Models with Strict Phased Fault Recovery Fathiyeh Faghih and Borzoo Bonakdarpour School of Computer Science, University of Waterloo, Canada TECHNICAL REPORT CS-2013-05 Abstract.
More informationMulti-Viewpoint State Machines for Rich Component Models 1
Multi-Viewpoint State Machines for Rich Component Models 1 Albert Benveniste and Benoît Caillaud IRISA / INRIA, Rennes, France Roberto Passerone PARADES GEIE, Rome, Italy University of Trento, Trento,
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationLecture 23 : Nondeterministic Finite Automata DRAFT Connection between Regular Expressions and Finite Automata
CS/Math 24: Introduction to Discrete Mathematics 4/2/2 Lecture 23 : Nondeterministic Finite Automata Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we designed finite state automata
More informationCircles & Interval & Set Notation.notebook. November 16, 2009 CIRCLES. OBJECTIVE Graph a Circle given the equation in standard form.
OBJECTIVE Graph a Circle given the equation in standard form. Write the equation of a circle in standard form given a graph or two points (one being the center). Students will be able to write the domain
More informationAn Entailment Checker for Separation Logic with Inductive Definitions
An Entailment Checker for Separation Loic with Inductive Definitions Radu Iosif, Cristina Serban Université de Grenoble Alpes, CNRS, VERIMAG July 18, 2018 Cristina Serban (VERIMAG) An Entailment Checker
More informationModelling Real-Time Systems. Henrik Ejersbo Jensen Aalborg University
Modelling Real-Time Systems Henrik Ejersbo Jensen Aalborg University Hybrid & Real Time Systems Control Theory Plant Continuous sensors actuators Task TaskTask Controller Program Discrete Computer Science
More informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationmodels, 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 informationLinear Temporal Logic and Büchi Automata
Linear Temporal Logic and Büchi Automata Yih-Kuen Tsay Department of Information Management National Taiwan University FLOLAC 2009 Yih-Kuen Tsay (SVVRL @ IM.NTU) Linear Temporal Logic and Büchi Automata
More informationReachability Problems for Continuous Linear Dynamical Systems
Reachability Problems for Continuous Linear Dynamical Systems James Worrell Department of Computer Science, Oxford University (Joint work with Ventsislav Chonev and Joël Ouaknine) FICS 2015 September 12th,
More informationCounting in trees. Helmut Seidl 1 Thomas Schwentick 2 Anca Muscholl 3. 1 Introduction
Counting in trees Helmut Seidl 1 Thomas Schwentick 2 Anca Muscholl 3 1 Institut für Informatik, I2 TU München Germany 2 Lehrstuhl Informatik I Universität Dortmund Germany 3 LaBRI Université Bordeaux France
More informationor simply: IC3 A Simplified Description
Incremental Construction of Inductive Clauses for Indubitable Correctness or simply: IC3 A Simplified Description Based on SAT-Based Model Checking without Unrolling Aaron Bradley, VMCAI 2011 Efficient
More informationZone-Based Reachability Analysis of Dense-Timed Pushdown Automata
IT 12 034 Examensarbete 15 hp Juli 2012 Zone-Based Reachability Analysis of Dense-Timed Pushdown Automata Kristiina Ausmees Institutionen för informationsteknologi Department of Information Technology
More informationAssume-Guarantee Reasoning for Hybrid I/O-Automata by Over-Approximation of Continuous Interaction
Assume-Guarantee Reasoning for Hybrid I/O-Automata by Over-Approximation of Continuous Interaction Goran Frehse, Zhi Han, Bruce Krogh Department of Electrical and Computer Engineering, Carnegie Mellon
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 informationModel Checking in the Propositional µ-calculus
Model Checking in the Propositional µ-calculus Ka I Violet Pun INF 9140 - Specification and Verification of Parallel Systems 13 th May, 2011 Overview Model Checking is a useful means to automatically ascertain
More informationAbstraction for Falsification
Abstraction for Falsification Thomas Ball 1, Orna Kupferman 2, and Greta Yorsh 3 1 Microsoft Research, Redmond, WA, USA. Email: tball@microsoft.com, URL: research.microsoft.com/ tball 2 Hebrew University,
More informationA Modal Specification Theory for Timing Variability
University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science 11-13-2013 A Modal Specification Theory for Timing Variability Andrew King University of
More informationReal-Time Systems. Lecture 15: The Universality Problem for TBA Dr. Bernd Westphal. Albert-Ludwigs-Universität Freiburg, Germany
Real-Time Systems Lecture 15: The Universality Problem for TBA 2013-06-26 15 2013-06-26 main Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany Contents & Goals Last Lecture: Extended Timed
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More informationChapter 6: Computation Tree Logic
Chapter 6: Computation Tree Logic Prof. Ali Movaghar Verification of Reactive Systems Outline We introduce Computation Tree Logic (CTL), a branching temporal logic for specifying system properties. A comparison
More informationTute 10. Liam O'Connor. May 23, 2017
Tute 10 Liam O'Connor May 23, 2017 proc Search(value g : G, value s : V g, value k : K, result v : T, result f : B) Where a graph g : G is dened as a 4-tuple (V, Γ, κ, λ) containing a set of vertices V,
More informationRobust Safety of Timed Automata
Formal Methods in System Design manuscript No. (will be inserted by the editor) Robust Safety of Timed Automata Martin De Wulf Laurent Doyen Nicolas Markey Jean-François Raskin the date of receipt and
More informationAPPROXIMATING SWITCHED CONTINUOUS SYSTEMS BY RECTANGULAR AUTOMATA
European Control Conference 99, Karlsruhe (Germany), August 31 st - September 3 rd, 1999 APPROXIMATING SWITCHED CONTINUOUS SYSTEMS BY RECTANGULAR AUTOMATA O. Stursberg, S. Kowalewski Keywords: Approximation,
More informationLost in Translation: Hybrid-Time Flows vs Real-Time Transitions
Lost in Translation: Hybrid-Time Flows vs Real-Time Transitions P.J.L. Cuijpers, M.A. Reniers Technische Universiteit Eindhoven (TU/e), P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands. {P.J.L.Cuijpers,
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 informationModel Checking Probabilistic Timed Automata with One or Two Clocks
Model Checking Probabilistic Timed Automata with One or Two Clocks Marcin Jurdziński 1, François Laroussinie 2, and Jeremy Sproston 3 1 Department of Computer Science, University of Warwick, Coventry CV4
More informationUnbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods
Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods Sanjit A. Seshia and Randal E. Bryant Computer Science Department Carnegie Mellon University Verifying Timed Embedded Systems
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 informationPredicate Calculus. CS 270 Math Foundations of Computer Science Jeremy Johnson
Predicate Calculus CS 270 Math Foundations of Computer Science Jeremy Johnson Presentation uses material from Huth and Ryan, Logic in Computer Science: Modelling and Reasoning about Systems, 2nd Edition
More informationPredicate Logic: Sematics Part 1
Predicate Logic: Sematics Part 1 CS402, Spring 2018 Shin Yoo Predicate Calculus Propositional logic is also called sentential logic, i.e. a logical system that deals with whole sentences connected with
More informationLecture 2: Axiomatic semantics
Chair of Software Engineering Trusted Components Prof. Dr. Bertrand Meyer Lecture 2: Axiomatic semantics Reading assignment for next week Ariane paper and response (see course page) Axiomatic semantics
More informationVisibly Linear Dynamic Logic
Visibly Linear Dynamic Logic Joint work with Alexander Weinert (Saarland University) Martin Zimmermann Saarland University September 8th, 2016 Highlights Conference, Brussels, Belgium Martin Zimmermann
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Nondeterministic Finite Automata with empty moves (-NFA) Definition A nondeterministic finite automaton
More informationA Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata Goran Frehse 1, Sumit Kumar Jha 2, and Bruce H. Krogh 3 1 Verimag (UJF-CNRS-INPG), 2, av. de Vignate, 38610 Gières, France
More informationHourglass Automata. Yuki Osada, Tim French, Mark Reynolds, and Harry Smallbone
Hourglass Automata Yuki Osada, Tim French, Mark Reynolds, and Harry Smallbone The University of Western Australia. yuki.osada@research.uwa.edu.au, {tim.french,mark.reynolds}@uwa.edu.au, 21306592@student.uwa.edu.au
More informationIntroduction to Temporal Logic. The purpose of temporal logics is to specify properties of dynamic systems. These can be either
Introduction to Temporal Logic The purpose of temporal logics is to specify properties of dynamic systems. These can be either Desired properites. Often liveness properties like In every infinite run action
More informationDecidability of Single Rate Hybrid Petri Nets
Decidability of Single Rate Hybrid Petri Nets Carla Seatzu, Angela Di Febbraro, Fabio Balduzzi, Alessandro Giua Dip. di Ing. Elettrica ed Elettronica, Università di Cagliari, Italy email: {giua,seatzu}@diee.unica.it.
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 information