Modeling and Analysis of Hybrid Systems
|
|
- Rudolf Anderson
- 5 years ago
- Views:
Transcription
1 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 2017 Ábrahám - Hybrid Systems 1 / 31
2 Literature Alur et al.: The algorithmic analysis of hybrid systems Theoretical Computer Science, 138(1):334, 1995 Ábrahám - Hybrid Systems 2 / 31
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 / 31
4 Linear terms, constraints and formulas A conjunctive linear formula ϕ over Var is dened 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-quantied) 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-quantied) variables {x 1 }. Ábrahám - Hybrid Systems 4 / 31
5 Regions A region over Var is a pair R = (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 }. The intersection of two regions R 1 = (l 1, ϕ 1 ) and R 2 = (l 2, ϕ 2 ) from Loc Φ Var is dened as R 1 ˆ R 2 = if l 1 l 2 and otherwise. R 1 ˆ R 2 = (l 1, ϕ 1 ϕ 2 ) The intersection of two sets of regions P 1, P 2 Loc Φ Var is dened as P 1 ˆ P 2 = {(l, ϕ 1 ϕ 2 ) (l, ϕ 1 ) P 1, (l, ϕ 2 ) P 2 }. We dene other operations on regions like union etc. similarly, and extend them to sets of regions the natural way. Ábrahám - Hybrid Systems 5 / 31
6 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 write ϕ[e 1,..., e n /x 1,..., x n ] for the simultaneous substitution of e i for x i, i = 1,..., 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 n/x 1,..., x n ]. Ábrahám - Hybrid Systems 6 / 31
7 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 7 / 31
8 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 ν = ϕ} The solution set Sat(R) of a region R = (l, ϕ) Loc Φ Var over Loc and Var is Sat((l, ϕ)) = {(l, ν) Loc V Var ν Sat(ϕ)} The solution set Sat(P ) of a set of regions P over Loc and Var is Sat(P ) = R P Sat(R). Two region sets P 1, P 2 Loc Φ Var are equivalent, written P 1 ˆ=P 2, i Sat(P 1 ) = Sat(P 2 ). We dene similarly the inclusion P 1 ˆ P 2 i Sat(P 1 ) Sat(P 2 ). Ábrahám - Hybrid Systems 8 / 31
9 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 nite set Edge Loc Φ Var Φ Var Var Loc denes the set of edges Edge = {(l, a, µ e, l ) e = (l, a, 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, dening 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 9 / 31
10 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 nite set of regions specifying the initial states by Init = {(l, ν) ν Sat(ϕ)}. (l,ϕ) Init Ábrahám - Hybrid Systems 10 / 31
11 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 11 / 31
12 Mixer of uids 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 12 / 31
13 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 13 / 31
14 Forward analysis Ábrahám - Hybrid Systems 14 / 31
15 Given a set of initial states Init Σ, we want to compute the set of all states which are reachable from Init: Reach + (Init) = {σ Σ σ Init. σ σ }. Ábrahám - Hybrid Systems 15 / 31
16 Given a set of initial states Init Σ, we want to compute the set of all states which are reachable from Init: Reach + (Init) = {σ Σ σ Init. σ σ }. More specically, we want to check whether the reachable region intersects with a set of bad (unsafe) states. Ábrahám - Hybrid Systems 15 / 31
17 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 t h e t i m e 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 (Sat(P 0 ˆ P bad ) ) r e t u r n u n s a f e ; i := 0 ; w h i l e 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 (Sat({R } ˆ P bad ) ) r e t u r n 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; r e t u r n s a f e ; Ábrahám - Hybrid Systems 16 / 31
18 One-step reachability under time steps We dene 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 17 / 31
19 One-step reachability under discrete steps We dene 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 18 / 31
20 Backward analysis Ábrahám - Hybrid Systems 19 / 31
21 Given a set of 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 20 / 31
22 Given a set of target states B Σ, we want to compute the set of all states from which a state in B is reachable: Reach (B) = {σ Σ σ B. σ σ }. More specically, we want to check whether the set of backward reachable states intersects with a set of initial states. Ábrahám - Hybrid Systems 20 / 31
23 Backward reachability analysis method backward_reach ( ) { i := 0 ; P 0 := {T l (R) R = (l, ϕ) P bad ˆ Inv} ; // t i m e p r e d e c. o f bad r e g i o n s i f (Sat(P 0 ˆ Init) ) r e t u r n u n s a f e ; w h i l e P i { } } // compute t i m e 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 (Sat({R } ˆ Init) ) r e t u r n 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; r e t u r n s a f e ; Ábrahám - Hybrid Systems 21 / 31
24 One-step reachability under time steps We dene 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 22 / 31
25 One-step reachability under discrete steps We dene 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 23 / 31
26 Quantier elimination Problem 1: Formula size increases steeply Problem 2: In the presence of quantiers, computing operations (inclusion, intersection etc.) on regions is non-trivial Solution: Therefore, we eliminate quantiers: given a conjunctive linear formula x. ϕ Φ X, we compute another conjunctive linear formula ϕ Φ X\{x} that does not contain x such that Sat( x. ϕ) = Sat(ϕ ). Technique: Gauÿ and Fourier-Motzkin variable elimination Ábrahám - Hybrid Systems 24 / 31
27 Linear real arithmetic: Gauÿ method for equations Assume that ϕ is of the form x n. ϕ n k=1 a k x k = b with a n 0. Ábrahám - Hybrid Systems 25 / 31
28 Linear real arithmetic: Gauÿ method for equations Assume that ϕ is of the form x n. ϕ n k=1 a k x k = b with a n 0. a n x n = b a k x k k {1,...,n 1} Ábrahám - Hybrid Systems 25 / 31
29 Linear real arithmetic: Gauÿ method for equations Assume that ϕ is of the form x n. ϕ n k=1 a k x k = b with a n 0. a n x n = b a k x k x n = b a n k {1,...,n 1} k {1,...,n 1} a k a n x k := β Ábrahám - Hybrid Systems 25 / 31
30 Linear real arithmetic: Gauÿ method for equations Assume that ϕ is of the form x n. ϕ n k=1 a k x k = b with a n 0. a n x n = b a k x k x n = b a n Replace x n by β in ϕ. k {1,...,n 1} k {1,...,n 1} a k a n x k := β Ábrahám - Hybrid Systems 25 / 31
31 Linear real arithmetic: Gauÿ method for equations Assume that ϕ is of the form x n. ϕ n k=1 a k x k = b with a n 0. a n x n = b a k x k x n = b a n Replace x n by β in ϕ. k {1,...,n 1} k {1,...,n 1} a k a n x k := β This substitutiton leads to an equisatisable problem in n 1 variables: n Sat( x n. ϕ a k x k = b) = Sat(ϕ [β/x n ]) (for a n 0). k=1 Ábrahám - Hybrid Systems 25 / 31
32 Linear real arithmetic: Fourier-Motzkin for inequalities Discovered in 1826 by Fourier, re-discovered by Motzkin in 1936 Given: x n. a ij x j b i 1 i m 1 j n
33 Linear real arithmetic: Fourier-Motzkin for inequalities Discovered in 1826 by Fourier, re-discovered by Motzkin in 1936 Given: x n. 1 i m 1 j n a ij x j b i For a variable x n, we can partition the constraints according to the coecient a in : a in > 0: upper bound β i on x n a in < 0: lower bound β i on x n
34 Linear real arithmetic: Fourier-Motzkin for inequalities Discovered in 1826 by Fourier, re-discovered by Motzkin in 1936 Given: x n. 1 i m 1 j n a ij x j b i For a variable x n, we can partition the constraints according to the coecient a in : a in > 0: upper bound β i on x n a in < 0: lower bound β i on x n Idea: Exists satisfying value for variable x j i none of the intervals dened by lower-upper-bound-pairs on x j is empty
35 Linear real arithmetic: Fourier-Motzkin for inequalities Discovered in 1826 by Fourier, re-discovered by Motzkin in 1936 Given: x n. 1 i m 1 j n a ij x j b i For a variable x n, we can partition the constraints according to the coecient a in : a in > 0: upper bound β i on x n a in < 0: lower bound β i on x n Idea: Exists satisfying value for variable x j i none of the intervals dened by lower-upper-bound-pairs on x j is empty n a ij x j b i j=1
36 Linear real arithmetic: Fourier-Motzkin for inequalities Discovered in 1826 by Fourier, re-discovered by Motzkin in 1936 Given: x n. 1 i m 1 j n a ij x j b i For a variable x n, we can partition the constraints according to the coecient a in : a in > 0: upper bound β i on x n a in < 0: lower bound β i on x n Idea: Exists satisfying value for variable x j i none of the intervals dened by lower-upper-bound-pairs on x j is empty n n 1 a ij x j b i a in x n b i a ij x j j=1 j=1
37 Linear real arithmetic: Fourier-Motzkin for inequalities Discovered in 1826 by Fourier, re-discovered by Motzkin in 1936 Given: x n. 1 i m 1 j n a ij x j b i For a variable x n, we can partition the constraints according to the coecient a in : a in > 0: upper bound β i on x n a in < 0: lower bound β i on x n Idea: Exists satisfying value for variable x j i none of the intervals dened by lower-upper-bound-pairs on x j is empty n n 1 a ij x j b i a in x n b i a ij x j j=1 (a) (b) j=1 a in >0 x n b n 1 i a ij x j =: β l upper bound a in a in a in <0 x n b i a in j=1 n 1 a ij a in x j =: β u lower bound j=1 Ábrahám - Hybrid Systems 26 / 31
38 Example for upper and lower bounds (1) x 1 x 2 0 (2) x 1 x 3 0 (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 Category for x 1? Ábrahám - Hybrid Systems 27 / 31
39 Example for upper and lower bounds Category for x 1? (1) x 1 x 2 0 Upper bound (2) x 1 x 3 0 (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 Ábrahám - Hybrid Systems 27 / 31
40 Example for upper and lower bounds Category for x 1? (1) x 1 x 2 0 Upper bound (2) x 1 x 3 0 Upper bound (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 Ábrahám - Hybrid Systems 27 / 31
41 Example for upper and lower bounds Category for x 1? (1) x 1 x 2 0 Upper bound (2) x 1 x 3 0 Upper bound (3) x 1 + x 2 + 2x 3 0 Lower bound (4) x 3 1 Ábrahám - Hybrid Systems 27 / 31
42 Example for upper and lower bounds Category for x 1? (1) x 1 x 2 0 Upper bound (2) x 1 x 3 0 Upper bound (3) x 1 + x 2 + 2x 3 0 Lower bound (4) x 3 1 No bound Ábrahám - Hybrid Systems 27 / 31
43 Eliminating unbounded variables Iteratively remove variables that are not bounded in both ways (and all the constraints that use them). The new problem has a solution i the old problem has one! 8x 7y x 3 y z z z Ábrahám - Hybrid Systems 28 / 31
44 Eliminating unbounded variables Iteratively remove variables that are not bounded in both ways (and all the constraints that use them). The new problem has a solution i the old problem has one! 8x 7y x 3 y z z z Ábrahám - Hybrid Systems 28 / 31
45 Eliminating unbounded variables Iteratively remove variables that are not bounded in both ways (and all the constraints that use them). The new problem has a solution i the old problem has one! 8x 7y x 3 y z z z y z z z Ábrahám - Hybrid Systems 28 / 31
46 Eliminating unbounded variables Iteratively remove variables that are not bounded in both ways (and all the constraints that use them). The new problem has a solution i the old problem has one! 8x 7y x 3 y z z z y z z z Ábrahám - Hybrid Systems 28 / 31
47 Eliminating unbounded variables Iteratively remove variables that are not bounded in both ways (and all the constraints that use them). The new problem has a solution i the old problem has one! 8x 7y x 3 y z z z y z z z z z Ábrahám - Hybrid Systems 28 / 31
48 Fourier-Motzkin variable elimination For each pair of a lower bound β l and an upper bound β u, we have β l x n β u Ábrahám - Hybrid Systems 29 / 31
49 Fourier-Motzkin variable elimination For each pair of a lower bound β l and an upper bound β u, we have β l x n β u For each such pair, add the constraint β l β u Ábrahám - Hybrid Systems 29 / 31
50 Fourier-Motzkin: Example (1) x 1 x 2 0 (2) x 1 x 3 0 (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 Category for x 1? Ábrahám - Hybrid Systems 30 / 31
51 Fourier-Motzkin: Example Category for x 1? (1) x 1 x 2 0 Upper bound (2) x 1 x 3 0 Upper bound (3) x 1 + x 2 + 2x 3 0 Lower bound (4) x 3 1 eliminate x 1 Ábrahám - Hybrid Systems 30 / 31
52 Fourier-Motzkin: Example Category for x 1? (1) x 1 x 2 0 Upper bound (2) x 1 x 3 0 Upper bound (3) x 1 + x 2 + 2x 3 0 Lower bound (4) x 3 1 (5) 2x 3 0 (from 1,3) eliminate x 1 Ábrahám - Hybrid Systems 30 / 31
53 Fourier-Motzkin: Example Category for x 1? (1) x 1 x 2 0 Upper bound (2) x 1 x 3 0 Upper bound (3) x 1 + x 2 + 2x 3 0 Lower bound (4) x 3 1 (5) 2x 3 0 (from 1,3) (6) x 2 + x 3 0 (from 2,3) eliminate x 1 Ábrahám - Hybrid Systems 30 / 31
54 Fourier-Motzkin: Example (1) x 1 x 2 0 (2) x 1 x 3 0 (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 (5) 2x 3 0 (from 1,3) (6) x 2 + x 3 0 (from 2,3) Category for x 1? eliminate x 1 Ábrahám - Hybrid Systems 30 / 31
55 Fourier-Motzkin: Example (1) x 1 x 2 0 (2) x 1 x 3 0 (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 (5) 2x 3 0 (from 1,3) (6) x 2 + x 3 0 (from 2,3) Category for x 1? eliminate x 1 we eliminate x 3 Ábrahám - Hybrid Systems 30 / 31
56 Fourier-Motzkin: Example Category for x 1? (1) x 1 x 2 0 (2) x 1 x 3 0 (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 Lower bound eliminate x 1 (5) 2x 3 0 (from 1,3) Upper bound (6) x 2 + x 3 0 (from 2,3) Upper bound we eliminate x 3 Ábrahám - Hybrid Systems 30 / 31
57 Fourier-Motzkin: Example Category for x 1? (1) x 1 x 2 0 (2) x 1 x 3 0 (3) x 1 + x 2 + 2x 3 0 (4) x 3 1 Lower bound eliminate x 1 (5) 2x 3 0 (from 1,3) Upper bound (6) x 2 + x 3 0 (from 2,3) Upper bound (7) 1 0 (from 4,5) Contradiction (the system is UNSAT) we eliminate x 3 Ábrahám - Hybrid Systems 30 / 31
58 Complexity Worst-case complexity: m m 2 Ábrahám - Hybrid Systems 31 / 31
59 Complexity Worst-case complexity: m m 2 (m 2 ) 2 Ábrahám - Hybrid Systems 31 / 31
60 Complexity Worst-case complexity: m m 2 (m 2 ) 2... m 2n Ábrahám - Hybrid Systems 31 / 31
61 Complexity Worst-case complexity: m m 2 (m 2 ) 2... m 2n Heavy! Ábrahám - Hybrid Systems 31 / 31
Modeling 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationUSING FOURIER-MOTZKIN VARIABLE ELIMINATION FOR MCSAT EXPLANATIONS IN SMT-RAT
The present work was submitted to the LuFG Theory of Hybrid Systems BACHELOR OF COMPUTER SCIENCE USING FOURIER-MOTZKIN VARIABLE ELIMINATION FOR MCSAT EXPLANATIONS IN SMT-RAT Lorena Calvo Bartolomé Prüfer:
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 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 informationSMT: Satisfiability Modulo Theories
SMT: Satisfiability Modulo Theories Ranjit Jhala, UC San Diego April 9, 2013 Decision Procedures Last Time Propositional Logic Today 1. Combining SAT and Theory Solvers 2. Theory Solvers Theory of Equality
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 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 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 informationNotes. Corneliu Popeea. May 3, 2013
Notes Corneliu Popeea May 3, 2013 1 Propositional logic Syntax We rely on a set of atomic propositions, AP, containing atoms like p, q. A propositional logic formula φ Formula is then defined by the following
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 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 informationSAMPLED SEMANTICS OF TIMED AUTOMATA
SAMPLED SEMANTICS OF TIMED AUTOMATA PAROSH AZIZ ABDULLA, PAVEL KRCAL, AND WANG YI Department of Information Technology, Uppsala University, Sweden e-mail address: parosh@it.uu.se Department of Information
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 informationPushdown timed automata:a binary reachability characterization and safety verication
Theoretical Computer Science 302 (2003) 93 121 www.elsevier.com/locate/tcs Pushdown timed automata:a binary reachability characterization and safety verication Zhe Dang School of Electrical Engineering
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 informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probabilistic Model Checking Michaelmas Term 2011 Dr. Dave Parker Department of Computer Science University of Oxford Probabilistic model checking System Probabilistic model e.g. Markov chain Result 0.5
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 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 informationSampled Semantics of Timed Automata
Sampled Semantics of Timed Automata Parosh Abdulla, Pavel Krcal, and Wang Yi Department of Information Technology, Uppsala University, Sweden Email: {parosh,pavelk,yi}@it.uu.se Abstract. Sampled semantics
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
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 informationDesign of Distributed Systems Melinda Tóth, Zoltán Horváth
Design of Distributed Systems Melinda Tóth, Zoltán Horváth Design of Distributed Systems Melinda Tóth, Zoltán Horváth Publication date 2014 Copyright 2014 Melinda Tóth, Zoltán Horváth Supported by TÁMOP-412A/1-11/1-2011-0052
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 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) CONCUR September 2nd
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 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 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 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 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 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 informationChapter 3. Regular grammars
Chapter 3 Regular grammars 59 3.1 Introduction Other view of the concept of language: not the formalization of the notion of effective procedure, but set of words satisfying a given set of rules Origin
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 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 informationDefinition of Büchi Automata
Büchi Automata Definition of Büchi Automata Let Σ = {a,b,...} be a finite alphabet. By Σ ω we denote the set of all infinite words over Σ. A non-deterministic Büchi automaton (NBA) over Σ is a tuple A
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 informationFrom Duration Calculus. (Extended Abstract) zu Kiel, Preuerstr. 1-9, D Kiel, Germany.
From Duration Calculus To Linear Hybrid Automata? (Extended Abstract) Ahmed Bouajjani 1???, Yassine Lakhnech 2??, and Riadh Robbana 1??? 1 VERIMAG, Miniparc-Zirst, Rue Lavoisier 38330 Montbonnot St-Martin,
More informationUniversity of California. Berkeley, CA fzhangjun johans lygeros Abstract
Dynamical Systems Revisited: Hybrid Systems with Zeno Executions Jun Zhang, Karl Henrik Johansson y, John Lygeros, and Shankar Sastry Department of Electrical Engineering and Computer Sciences University
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 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 informationSyntax: form ::= A: lin j E: lin ::= 3 lin j lin ^ lin j :lin j bool lin lin is a temporal formula dened over a global sequence. bool is true in g if
Introduction 1 Goals of the lecture: Weak Conjunctive Predicates Logic for global predicates Weak conjunctive algorithm References: Garg and Waldecker 94 Syntax: form ::= A: lin j E: lin ::= 3 lin j lin
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 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 informationFormalizing Simplex within Isabelle/HOL
Formalizing Simplex within Isabelle/HOL Mirko Spasić Filip Marić {mirko filip}@matf.bg.ac.rs Department of Computer Science Faculty of Mathematics University of Belgrade Formal and Automated Theorem Proving
More informationA Boolean Approach to Unbounded, Fully Symbolic Model Checking of Timed Automata
A Boolean Approach to Unbounded, Fully Symbolic Model Checking of Timed Automata Sanjit A. Seshia Randal E. Bryant March 2003 CMU-CS-03-117 School of Computer Science Carnegie Mellon University Pittsburgh,
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 informationMixed and Integer Linear Programming Using Automata Techniques
Mixed and Integer Linear Programming Using Automata Techniques Mia Minnes Cornell University Ithaca, NY minnes@math.cornell.edu ABSTRACT We present a comprehensive overview of automata techniques for deciding
More informationReachability Analysis of Pushdown Automata with an Upper Stack
Reachability Analysis of Pushdown Automata with an Upper Stack Adrien Pommellet 1 Marcio Diaz 1 Tayssir Touili 2 1 Université Paris-Diderot and LIPN, France 2 LIPN, CNRS, and Université Paris 13, France
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 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 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 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 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 informationAlgorithmic Game Theory and Applications. Lecture 5: Introduction to Linear Programming
Algorithmic Game Theory and Applications Lecture 5: Introduction to Linear Programming Kousha Etessami real world example : the diet problem You are a fastidious eater. You want to make sure that every
More informationController Synthesis for Hybrid Systems using SMT Solving
Controller Synthesis for Hybrid Systems using SMT Solving Ulrich Loup AlgoSyn (GRK 1298) Hybrid Systems Group Prof. Dr. Erika Ábrahám GRK Workshop 2009, Schloss Dagstuhl Our model: hybrid system Discrete
More informationUnranked Tree Automata with Sibling Equalities and Disequalities
Unranked Tree Automata with Sibling Equalities and Disequalities Wong Karianto Christof Löding Lehrstuhl für Informatik 7, RWTH Aachen, Germany 34th International Colloquium, ICALP 2007 Xu Gao (NFS) Unranked
More informationProperties of Regular Languages (2015/10/15)
Chapter 4 Properties of Regular Languages (25//5) Pasbag, Turkey Outline 4. Proving Languages Not to e Regular 4.2 Closure Properties of Regular Languages 4.3 Decision Properties of Regular Languages 4.4
More information1. (B) The union of sets A and B is the set whose elements belong to at least one of A
1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to
More informationProof Calculus for Partial Correctness
Proof Calculus for Partial Correctness Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 7, 2016 Bow-Yaw Wang (Academia Sinica) Proof Calculus for Partial Correctness September
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 informationProbabilistic Model Checking Michaelmas Term Dr. Dave Parker. Department of Computer Science University of Oxford
Probabilistic Model Checking Michaelmas Term 20 Dr. Dave Parker Department of Computer Science University of Oxford Overview PCTL for MDPs syntax, semantics, examples PCTL model checking next, bounded
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
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 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 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 informationAutomata Theory. Lecture on Discussion Course of CS120. Runzhe SJTU ACM CLASS
Automata Theory Lecture on Discussion Course of CS2 This Lecture is about Mathematical Models of Computation. Why Should I Care? - Ways of thinking. - Theory can drive practice. - Don t be an Instrumentalist.
More informationProgram verification
Program verification Data-flow analyses, numerical domains Laure Gonnord and David Monniaux University of Lyon / LIP September 29, 2015 1 / 75 Context Program Verification / Code generation: Variables
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 informationDecidability of Existence and Construction of a Complement of a given function
Decidability of Existence and Construction of a Complement of a given function Ka.Shrinivaasan, Chennai Mathematical Institute (CMI) (shrinivas@cmi.ac.in) April 28, 2011 Abstract This article denes a complement
More information