Active Diagnosis of Hybrid Systems Guided by Diagnosability Properties

Size: px
Start display at page:

Download "Active Diagnosis of Hybrid Systems Guided by Diagnosability Properties"

Transcription

1 Active Diagnosis of Hybrid Systems Guided by Diagnosability Properties Application to autonomous satellites Louise Travé-Massuyès 5 February 29

2 Motivation Control and autonomy of complex dynamic systems Physical plant: continuous behaviors Controller that imposes discrete switches between operating modes High need for availability Diagnosis and reconfiguration Reduce ground segment operations Far-space missions: need for autonomy 2

3 Diagnosis, diagnosability and active diagnosis Diagnosis aims at providing an estimation of the situation, normal or faulty, of the system, possibly making explicit the status of the different components. Diagnosability is the property of a system and its instrumentation that guarantees that different anticipated faulty situations can be determined with precision with a finite time delay. It determines the performance of the diagnosis module. The diagnosability property depends on: the system model the diagnosis approach the observation system Active diagnosis aims at refining an initial diagnosis by acting on the system to exhibit new symptoms. 3

4 Outline Hybrid modeling framework based on hybrid automata Diagnosis scheme of hybrid systems coupling discreteevent and continuous techniques Diagnosability analysis of multimode and hybrid systems Active diagnosis of hybrid systems guided by diagnosability properties The Attitude Control System (ACS), actuator fault diagnosis 4

5 Outline Hybrid modeling framework based on hybrid automata Diagnosis scheme of hybrid systems coupling discreteevent and continuous techniques Diagnosability analysis of multimode and hybrid systems Active diagnosis of hybrid systems guided by diagnosability properties The Attitude Control System (ACS), actuator fault diagnosis 5

6 Hybrid modeling framework () Hybrid system Nominal modes (continuous model) Inputs Discrete events Faulty modes (continuous model) Model-based diagnosis module Observable outputs D I A G N O S I S 6

7 Hybrid modeling framework (2) Hybrid System S = (", Q, #, T, C, (q," )) " = " o # " uo " F $ " uo Underlying discrete-event system M = (Q, ", T, q ) Underlying continuous system called the multimode system " = (#, Q, C, # ) f q2 q f uo q3 Q = {q, q 2, q 3, q 4 } = {f, uo, u, o, } + C i (ζ)= in every mode q i Q o F = {f } q4 7

8 FDI approach: consistency indicators eliminating non observable variables in C Physic laws: A set of constraints C C obs a set of constraints linking only observable variables (Analytic Redundancy Relations) k "C obs # C obs k if Cobs we associate a Boolean consistency indicator called residual and denoted r k is satisfied " r k = otherwise r k = Normal behavior: all residuals are null: [r,, r n ] T = For a fault F we associate a fault signature Sig(F) = [r,, r n ] T that models the expected behavior of residuals in this faulty situation 8

9 DES: the diagnoser approach () System model M = (Q,",T,q ) Q is the set of discrete states " is the set of discrete events " = " o # " uo T $ Q % " & Q is the partial transition function q is the initial state The Diagnoser of a discrete model M, is a deterministic state machine (Sampath, 995): Diag(M) = (Q D," o,t D,q ) - The non observable events are discarded (only observable events are represented) - States are labeled with non observable information (especially fault information) Note: The diagnoser can be used to perform on-line diagnosis and to check the diagnosability property 9

10 DES: the diagnoser approach (2) The diagnoser construction o q 2 u q 3 q 4 o 3 u (q,{ }) { (q 4,{F}),(q 6,{F2), (q 8,{ }) } (q 6,{F2}) f o o 3 q q 5 q 6 f 2 uo q 7 q 8 o 3 q 9 o 3 (q 2,{ }) (q 4,{ }) { (q 9, { }),(q 4,{F}) } F (F2)-uncertain state o 3 indeterminate cycle o 3 F i -indeterminate cycle: is a cycle composed by F i -uncertain states for which there exist two corresponding cycles in the original automaton: one involves only states that carry and the other involves states that do not carry the fault label F i in their labels in the diagnoser cycle

11 Outline Hybrid modeling framework based on hybrid automata Diagnosis scheme of hybrid systems coupling discreteevent and continuous techniques Diagnosability analysis of multimode and hybrid systems Active diagnosis of hybrid systems guided by diagnosability properties The Attitude Control System (ACS), actuator fault diagnosis

12 Diagnosis scheme () PASSIVE DIAGNOSIS MODULE continuous inputs: u continuous outputs: y Residual Bench (Parity space approach) residuals Residual filter mode signature Abstraction of the continuous dynamics in terms of discrete events Observable events o Diagnoser of the hybrid system (built from the behavior automaton) diagnosis 2

13 Diagnosis scheme (2) PASSIVE DIAGNOSIS MODULE continuous inputs: u continuous outputs: y Residual bench residuals Residual filter mode signature Abstraction of the continuous dynamics in terms of discrete events Observable events " # o Diagnoser of the hybrid system (built from the behavior automaton) diagnosis 3

14 Reflexive, mirror and mode signatures Idea: to take any of the anticipated mode models as reference behavior. Mode signature: a theoretical signature that captures the expected values of all system residuals mode q i # x(n +) = A i x(n) + B i u(n) + E X i "(n) $ % y(n) = C i x(n) + D i u(n) + E Y i "(n) (u,y) " $ $ $ $ $ $ $ # R q.. R q i.. % ' ' ' ' ' ' S i/ : mirror signature of q S i/i = : reflexive signature of q i R q ' m Si/m : mirror signature of q i & The mode signature of q i, is the concatenation of all mirror signatures of q i Sig(q i ) = [S T i/ ST i/2,, ST i/m ]T, m is the mode number 4

15 Illustrative example Free-noise hypothesis " x(n +) = A i x(n) + B i u(n) # $ y(n) = C i x(n) + D i u(n) " A =.7 % #",5 4 & #,3 ",3 & #,6 ",3 & $ ' % ( % ( % ( #.7& A 2 =,6 A 3 =,6 A 4 =,3,6 % ( % ( % ( $ 6,8' $ ",3,9' $ ",6,9' " B = $ % " % " 2% $ ' ' B # 2 = B 3 = & $ ' B = $ ' 4 2 $ ' # & # & " c = % " $ ' c 2 = % " " $ ' C 4 = % C 3 = % $ ' $ ' # & # & # & # & f q2 q uo f o q3 q4 " D = D 2 = D 3 = D 4 = $ % ' # & 5

16 Illustrative example: parity space approach Parity order p= $ y (n #) ' & ) $ #,575,47,865 #,673' y 2 (n #) $ (n) = & ) & ) #,776 #,865' $ u (n #)' + & ) & ) %#,47 #,575,673,865 ( & y (n) ) %#,8367 #,673( % u (n) ( & ) % y 2 (n) ( " c $ y (n #) ' & ) $ #,278 #,958,2557 #,98' y 2 (n #) $ (n) = & ) & ) #,8 #,2557' $ u (n #)' + & ) & ) %,536 #,594 #,7,9799 ( & y (n) ) %#,9264,7 ( % u (n) ( & ) % y 2 (n) ( " c2 Computation form of residuals " c3 (n) = (,275 #,5437 #,3625,725) $ y (n #) ' & ) & y 2 (n #) ) +,9425,3625 & y (n) ) & ) % y 2 (n) ( $ & % ( ) u (n #)' ) u (n) ( " c4 (n) = (,275 #,5437 #,3625,725) $ y (n #) ' & ) & y 2 (n #) ) +,9425,3625 & y (n) ) & ) % y 2 (n) ( $ & % ( ) u (n #)' ) u (n) ( 6

17 Illustrative example: mode signatures Theoretical mode signatures Sig(q ) Sig(q 2 ) Sig(q 3 ) Sig(q 4 ) S/ S/2 S/3 S/ S2/ S2/2 S2/3 S2/ S3/ S3/2 S3/3 S3/ S4/ S4/2 S4/3 S4/

18 Abstraction of the continuous dynamics Assumption: the dynamics of discrete input events are slower than the continuous dynamics. Abstraction function f CS "DES : Q # T(Q) " $ Sig ( q i, q j ) a R oij % $ o Sig ( q i, q j ) a R uoij % $ o Sig if Sig(q i ) & Sig(q j ) if Sig(q i ) = Sig(q j ) The hybrid language " Sig = " Sig Sig o # " uo " hyb = "# " Sig * L(S) " # hyb Transient states f t : Q " T(Q,#) $ Q t (q i,q j ) a q ij 8

19 The behavior automaton The behavior automaton = the automaton representation of L(S) B A (S) = (Q beh," hyb,t beh,q ) Q beh = Q" Q t T beh " (Q beh # $ beh % Q beh ) & (q,") a f t (q,t(q,")) if q # Q and " # $ ' (( f % t ) 2 (q) if q # Q t and " # $ Sig 9

20 The behavior automaton: illustrative example R q u f q2 q uo f o q3 q4 + Sig(q )= Sig(q 2 )= Sig(q 3 )= Sig(q 4 )= uo q2 q2 R o32 q24 q3 uo3 R o3 q32 q3 R uo43 q43 q34 o R uo34 R 4 q4 The underlying CS The behavior automaton B A (S) 2

21 The behavior automaton: illustrative example R q u f q2 q uo f o q3 q4 + Sig(q )= Sig(q 2 )= Sig(q 3 )= Sig(q 4 )= uo q2 q2 R o32 q24 q3 uo3 R o3 q32 q3 R uo43 q43 q34 o R uo34 R 4 q4 The underlying CS The behavior automaton B A (S) 2

22 Extension of the diagnoser approach to hybrid systems Behavior automaton B A (S) Diagnoser approach Diagnoser of the hybrid system Diag(B A (S)) = (Q D," D,T D,q D ) Illustrative example 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 - The non observable events are discarded (only observable events are represented). - System modes are labeled with fault information. R 3 (q 2,{F}) Ro32 (q 24,{F}) 5 6 R4 (q 4,{F}) o Ro32 (q 3,{F}) 7 22

23 Passive diagnosis scheme: demonstration () Scenario: [(u o, t = 3s), (f, t = 5s), (, t = 7s), (o, t = 9s)] 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 R Ro32 f q2 q f uo q3 3 (q 2,{F}) (q 24,{F}) 5 6 R4 (q 4,{F}) o q4 o Ro32 7 (q 3,{F}) 23

24 Passive diagnosis scheme: demonstration (2) Scenario: [(u o, t = 3s), (f, t = 5s), (, t = 7s), (o, t = 9s)] 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 R Ro32 f q2 q f uo q3 3 (q 2,{F}) (q 24,{F}) 5 6 R4 (q 4,{F}) o q4 o Ro32 7 (q 3,{F}) 24

25 Passive diagnosis scheme: demonstration (3) Scenario: [(u o, t = 3s), (f, t = 5s), (, t = 7s), (o, t = 9s)] 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 R Ro32 f q2 q f uo q3 3 (q 2,{F}) (q 24,{F}) 5 6 R4 (q 4,{F}) o q4 o Ro32 7 (q 3,{F}) 25

26 Passive diagnosis scheme: demonstration (4) Scenario: [(u o, t = 3s), (f, t = 5s), (, t = 7s), (o, t = 9s)] 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 R Ro32 f q2 q f uo q3 3 (q 2,{F}) (q 24,{F}) 5 6 R4 (q 4,{F}) o q4 o Ro32 7 (q 3,{F}) 26

27 Passive diagnosis scheme: demonstration (5) Scenario: [(u o, t = 3s), (f, t = 5s), (, t = 7s), (o, t = 9s)] 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 R Ro32 f q2 q f uo q3 3 (q 2,{F}) (q 24,{F}) 5 6 R4 (q 4,{F}) o q4 o Ro32 7 (q 3,{F}) 27

28 Passive diagnosis scheme: demonstration (6) Scenario: [(u o, t = 3s), (f, t = 5s), (, t = 7s), (o, t = 9s)] 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 R Ro32 f q2 q f uo q3 3 (q 2,{F}) (q 24,{F}) 5 6 R4 (q 4,{F}) o q4 o Ro32 7 (q 3,{F}) 28

29 Passive diagnosis scheme: demonstration (7) Scenario: [(u o, t = 3s), (f, t = 5s), (, t = 7s), (o, t = 9s)] 2 Ro3 (q,{ }) (q 3,{ }) (q 4,{ }) o 4 R Ro32 f q2 q f uo q3 3 (q 2,{F}) (q 24,{F}) 5 6 R4 (q 4,{F}) o q4 o Ro32 7 (q 3,{F}) 29

30 Outline Hybrid modeling framework based on hybrid automata Diagnosis scheme of hybrid systems coupling discreteevent and continuous techniques Diagnosability analysis of multimode and hybrid systems Active diagnosis of hybrid systems guided by diagnosability properties The Attitude Control System (ACS), actuator fault diagnosis 3

31 Diagnosability of multimode systems Mode diagnosability definition Two modes q i and q j are diagnosable if Sig(q i ) Sig(q j ) Mutual diagnosability definition Two modes q i and q j are not mutually diagnosable if S i/i = S i/j = [,, ] T and S j/i = S j/j = [,,] T = R qi q i R qj q j = 3 rd diagnosability definition Two modes q i and q j are q k -3 rd diagnosable if S i/k S j/k q i q j R qk q k Propositions Two modes q i and q j are diagnosable iff they are mutually or 3 rd diagnosable The multimode system is diagnosable iff all modes are diagnosable (Cocquempot et al. 24) 3

32 Diagnosability of multimode systems: illustrative example Sig(q )= Sig(q 2 )= Sig(q 3 )= Sig(q 4 )= modes q and q 2 are mutual diagnosable modes q and q 2 are not 3 rd diagnosable modes q and q 2 are diagnosable modes q 3 and q 4 are not mutually diagnosable modes q 3 and q 4 are not 3 rd diagnosable modes q 3 and q 4 are not diagnosable The underlying CS 32

33 Diagnosability of hybrid systems The hybrid system Diagnosability definition for hybrid systems S = (", Q, #, T, C, (q," )) is diagnosable if the language * L(S) is diagnosable. " hyb Sufficient criteria CS criterion: the hybrid system is diagnosable if the underlying continuous system is diagnosable. DES criterion: the hybrid system is diagnosable if the underlying discreteevent system is diagnosable. Necessary and sufficient criterion The hybrid system S is not diagnosable iff the diagnoser built from the behavior automaton Diag(B A (S)) contains an indeterminate cycle. 33

34 Diagnosability of hybrid systems: example Sig Sig2 Sig2 Sig3 Sig4 Diagnosability of the hybrid system 34

35 Outline Hybrid modeling framework based on hybrid automata Diagnosis scheme of hybrid systems coupling discreteevent and continuous techniques Diagnosability analysis of multimode and hybrid systems Active diagnosis of hybrid systems guided by diagnosability properties The Attitude Control System (ACS), actuator fault diagnosis 35

36 Active diagnosis PROBLEM the diagnosis returned by the passive diagnosis scheme is ambiguous (the diagnoser state is uncertain) focused reconfiguration requirement Active diagnosis the active diagnosis consists on performing control actions in order to disambiguate or precise the system state the active diagnosis can be performed in an uncertain state: that belongs to an indeterminate cycle that does not belong to an indeterminate cycle! the system can be diagnosable or not ( Sampath 98) 36

37 Controllable and induced controllable paths Controllable events: discrete control inputs and events corresponding to spontaneous mode changes when the continuous dynamics model of the source mode is controllable: " c # " o Induced controllable events: events that model the response of the hybrid system after a control action (continuous control input/discrete control input): " hybic = " ic # " Sig ic $ " hyb Reaction of the continuous dynamics: Reaction of the discrete dynamics: " Sig ic # " Sig " ic # " A controllable path in the behavior automaton is a string of induced-controllable events and consecutive controllable events: s " L(S) # ($ c % $ hybic ) * A controllable path in the behavior automaton corresponds to a observable controllable path in the hybrid system diagnoser 37

38 The active diagnoser () the active diagnoser : (Q D act, T D act, " c # " hybic, q act ) embedded in the classic hybrid diagnoser controllability consideration: contains only controllable paths safety considerations: only control inputs enabled in all possible fault situations can be performed f N f 2 qf qf2 c c c 2 q F q F2 q F2 Classic diagnoser (q F,{F}) (q F2,{F2}) (qf,{f}) (qf2,{f2}) c c 2 (q F,{F}) (q F2,{F2}) 38

39 The active diagnoser (2) the active diagnoser : (Q D act, T D act, " c # " hybic, q act ) embedded in the classic hybrid diagnoser controllability consideration: contains only controllable paths safety considerations: only control inputs enabled in all possible fault situations can be performed f N f 2 qf qf2 c c c 2 q F q F2 q F2 Classic diagnoser (q F,{F}) (q F2,{F2}) (qf,{f}) (qf2,{f2}) c c 2 (q F,{F}) (q F2,{F2}) 39

40 The active diagnoser (3) the active diagnoser : (Q D act, T D act, " c # " hybic, q act ) embedded in the classic hybrid diagnoser controllability consideration: contains only controllable paths safety considerations: only control inputs enabled in all possible fault situations can be performed f N f 2 qf qf2 c c c 2 q F q F2 q F2 Active diagnoser (q F,{F}) (q F2,{F2}) (qf,{f}) (qf2,{f2}) c c 2 (q F,{F}) (q F2,{F2}) 4

41 The active diagnoser (4) the active diagnoser : (Q D act, T D act, " c # " hybic, q act ) embedded in the classic hybrid diagnoser controllability consideration: contains only controllable paths safety considerations: only control inputs enabled in all possible fault situations can be performed f N f 2 qf qf2 c c c 2 q F q F2 q F2 Active diagnoser (q F,{F}) (q F2,{F2}) (qf,{f}) (qf2,{f2}) c 4

42 The active diagnoser seen as a AND-OR Graph state node c q D c 3 Mapping between the active diagnoser and the AND-OR graph q D2 q D6 initial state: uncertain state " Q D act c 2 ic o3 ic o4 state nodes (OR): start of actions observation node ic o q D4 qd3 ic q D5 q D7 q D8 observations nodes (AND): end of actions actions: a " 2 # c observations: o " ic # $ hybic target states: certain states (or more certain) 42

43 Conditional planning for active diagnosis The active diagnosis is formulated as a conditional planning problem The research of an active diagnosis plan is achieved by the exploration of the AND-OR graph corresponding to the active diagnoser A Mini-Max algorithm is implemented for graph exploration An active diagnosis plan is guaranteed if it guarantees to reach a certain state of the active diagnoser from the starting uncertain state 43

44 Active diagnosis: illustrative example h h 2 h 3 V V 2 fault F Modes Valve V F,F 2, F 3 open 2F, 2F 2, 2F 3 3F, 3F 2, 3F 3 fault F 2 fault F 3 close close Valve V 2 open open close h = " r = h < " r 4 = h 2 = " r 2 = h 2 < " r 5 = h 3 = " r 3 = h 3 < " r 6 = OR (F, {F}) (F2, {F2}) (F3, {F3}) closev (3F2, {F2}) (2F, {F}) (2F, {F}) (2F2, {F2}) (2F3, {F3}) (2F2, {F2}) (2F3, {F3}) closev 2 (23F2, {F2}) (23F3, {F3}) (3F3, {F3}) ic R o4 AND OR AND ic R o ic R ic Active diagnosis plan: [closev, if R ic R o3 closev 2 else [ ] ] 44

45 Outline Hybrid modeling framework based on hybrid automata Diagnosis scheme of hybrid systems coupling discreteevent and continuous techniques Diagnosability analysis of multimode and hybrid systems Active diagnosis of hybrid systems guided by diagnosability properties The Attitude Control System (ACS), actuator fault diagnosis 45

46 Hybrid model based diagnosis applied to the Attitude Control System (ACS) Torque setpoint r T rq controller Torque " setpoint$ $ for each $ wheel $ # reaction wheels T cmd T cmd 2 T cmd 3 T cmd 4 % ' ' ' ' & # " & % ( %" 2 ( % " 3 ( % $ ( " 4 ' r H rwsc, T r rqsc satellite Attitude quaternion Rotation vector r " S / R Kinetic momentum theorem: d dt / R [ H r G ] = d [ H r GSatellite + H r GWheels ] = M r GFext = T r rq dt / R Reference frame change: d dt / R d dt / R [ H r GSatellite ] = d [ H r GSatellite ] + " r S / R # H r Satellite dt / R [ H r Wheels ] = d [ H r Wheels ] + " r S / R # H r Wheels dt / R 46

47 ACS: satellite equations r r H GSatellite = I G " S / R # d dt / R d dt / R r " S / R = [I G r " S / R ] + I G r " S / R = r T rq sc # d [ H r GWheels ] dt / S due to wheel the rotation r r [I G " S / R ] + I G " S / R = T r rq sc # d [ H r GWheels ] dt / S % p( ' * q ' *, r % ' T rq sc = ' & r ' ) & T rqsc T rqsc 2 T rqsc 3 ( * *, r % ' H rwsc = ' * ' ) &,. p = 6 qr + 6 (T rq sc # H rwsc ). - q = 7 (T rq sc2 # H rwsc2 ).. r = # 6 pq + 6 (T rq sc # H rwsc 3 3 ) /. r H rwsc H rwsc H rwsc2 H rwsc 3 ( * * * ) + # r " S / R $ H r 4 24 GWheels 43 due to the Gyroscopic coupling Polynomial non-linearity 47

48 ACS: reaction wheel equations T rwi = T roti " f viscous H rwi I $ T roti = " m i T cmd i if T cmd i # T rotmax & % " mi & ' Sign(T cmd i )T rotmax otherwise Motor torque limitation (3 configurations) " Sign( H rwi ) f Coulomb (Static friction: 2 configurations) % ' H rwi = " # T rw i if " # T rwi $ H rwmax & (' Sign(" # T rwi )H rwmax otherwise Wheel velocity limitation (3 configurations) Connection equations: r T rqsc " $ T = C $ as $ $ # T rw T rw2 T rw3 T rw4 % ' ' ' ' & r H rqsc " $ T = C $ as $ $ # H rw H rw2 H rw3 H rw4 % ' ' ' ' & C T as = Spin axe configuration " % $ ' $.77.5 (.5 ' $.77 (.5 (.5' $ ' #.77 (.5.5 & 48

49 ACS: the hybrid model Saturation non linearities are modeled by piece-wise affine functions NOMINAL BEHAVIOR The system is the synchronous product of 5 components: the 4 wheels + the satellite: =2 nominal modes (+ physical consideration) nominal mode of the satellite 2 4 = 2736 nominal modes of the system FAULT BEHAVIOR actuator faults: F, F2, F3, F4 that model motor failures of each wheel each fault may occur in any nominal mode 2 2 = 4 fault modes for each wheel SYSTEM MODES (2+4) 4 = modes single fault assumption: = modes 49

50 ACS: redundancy relations () modes 3 analytic redundancy relations for each mode r i = f i (T cmd,t cmd 2,T cmd 3,T cmd 4, T cmd, T cmd 2, T cmd 3, T cmd 4, p, r, q, p, r, q, p, r, q ) r i2 = f i2 (T cmd,t cmd 2,T cmd 3,T cmd 4, T cmd, T cmd 2, T cmd 3, T cmd 4, p, r, q, p, r, q, p, r, q ) r i3 = f i3 (T cmd,t cmd 2,T cmd 3,T cmd 4, T cmd, T cmd 2, T cmd 3, T cmd 4, p, r, q, p, r, q, p, r, q ) pre-computed analytic redundancy relations the system is diagnosable (all modes are mutually diagnosable) 5

51 ACS: redundancy relations (2) w w2 w3 w4 satellite S Wheel Wheel 2 Wheel 3 Wheel 4 w w w2 w2 w3 w3 w4 w4 w w2 w3 w4 ON-LINE ANALYTIC REDUNDANCY RELATIONS GENERATION 3 generic analytic redundancy relations (using non linear functions) non r linear non = f linear (T cmd,t cmd 2,T cmd 3,T cmd 4, T cmd, T cmd 2, T cmd 3, T cmd 4, p, r, q, p, r, q, p, r, q ) non r linear non 2 = f linear 2 (T cmd,t cmd 2,T cmd 3,T cmd 4, T cmd, T cmd 2, T cmd 3, T cmd 4, p, r, q, p, r, q, p, r, q ) non r linear non 3 = f linear 3 (T cmd,t cmd 2,T cmd 3,T cmd 4, T cmd, T cmd 2, T cmd 3, T cmd 4, p, r, q, p, r, q, p, r, q ) From a current mode we instantiate the residuals of all the possible destination modes (in the worst case 3 ( 3 4 )=243 residuals) 5

52 ACS: demonstration T rot " T rotmax q N T rot2 q N F q N2 F " T rotmax T rot = T " T rot = rotmax T rot2 T rot2 " T rotmax H rw " H rwmax Sign(# ) > T rot3 = T rotmax H rw2 T rot4 " H rwmax Sign(# 2 ) < " T rotmax f at t= 5s """ # H rw " H rwmax Sign(# ) > T rot3 = T rotmax H rw2 T rot4 " H rwmax Sign(# 2 ) < " T rotmax T rot3 <.5Nm """ "# H rw " H rwmax Sign(# ) > T rot3 " T rotmax H rw2 T rot4 " H rwmax Sign(# 2 ) < " T rotmax H rw3 " H rwmax Sign(# 3 ) > H rw4 " H rwmax Sign(# 4 ) < H rw3 " H rwmax Sign(# 3 ) > H rw4 " H rwmax Sign(# 4 ) < H rw3 " H rwmax Sign(# 3 ) > H rw4 " H rwmax Sign(# 4 ) < Fault scenario (q N, { }) (q NF, { }) (q NF2, { }) (q NF3, { }) (q NF4, { }) (q N2, { }) (q N2F, { }) Numbers associated to diagnoser states 52

53 Conclusions and perspectives Contributions The hybrid modeling framework that allows us to couple continuous diagnosis knowledge and discrete-event information The passive diagnosis scheme The diagnosability analysis of multimode and hybrid systems, definition and diagnosability criteria The active diagnosis scheme formulated as a conditional planning problem based on the new concept of active diagnoser The diagnosis of the Attitude Control system Perspectives The use of concurrent hybrid automata to perform diagnosis in a distributed way To couple mode estimation and hybrid state estimation to define continuous control strategy for active diagnosis The improvement of the active diagnosis algorithm to take into account fault probabilities and command costs 53

Hybrid system diagnosis: Test of the diagnoser HYDIAG on a benchmark of the international diagnostic competition DXC 2011

Hybrid system diagnosis: Test of the diagnoser HYDIAG on a benchmark of the international diagnostic competition DXC 2011 Hybrid system diagnosis: Test of the diagnoser HYDIAG on a benchmark of the international diagnostic competition DXC 2011 M. Maiga 1,2, E. Chanthery 1,3, L. Travé-Massuyès 1,2 1 CNRS, LAAS, 7 avenue du

More information

Hybrid automaton incremental construction for online diagnosis

Hybrid automaton incremental construction for online diagnosis Hybrid automaton incremental construction for online diagnosis Jorge Vento, Louise Travé-Massuyès 2,3, Ramon Sarrate and Vicenç Puig Advanced Control Systems (SAC), Universitat Politècnica de Catalunya

More information

FAULT DETECTION for SPACECRAFT ATTITUDE CONTROL SYSTEM. M. Amin Vahid D. Mechanical Engineering Department Concordia University December 19 th, 2010

FAULT DETECTION for SPACECRAFT ATTITUDE CONTROL SYSTEM. M. Amin Vahid D. Mechanical Engineering Department Concordia University December 19 th, 2010 FAULT DETECTION for SPACECRAFT ATTITUDE CONTROL SYSTEM M. Amin Vahid D. Mechanical Engineering Department Concordia University December 19 th, 2010 Attitude control : the exercise of control over the orientation

More information

Comparing diagnosability in Continuous and Discrete-Event Systems

Comparing diagnosability in Continuous and Discrete-Event Systems Comparing diagnosability in Continuous and Discrete-Event Systems Marie-Odile Cordier IRISA, Université de Rennes 1 Rennes, France Louise Travé-Massuyès and Xavier Pucel LAAS-CNRS Toulouse, France Abstract

More information

Monitoring and Active Diagnosis for Discrete-Event Systems

Monitoring and Active Diagnosis for Discrete-Event Systems Monitoring and Active Diagnosis for Discrete-Event Systems Elodie Chanthery, Yannick Pencolé LAAS-CNRS, University of Toulouse, Toulouse, France (e-mail: [elodie.chanthery, yannick.pencole]@laas.fr) University

More information

Diagnosability Analysis of Discrete Event Systems with Autonomous Components

Diagnosability Analysis of Discrete Event Systems with Autonomous Components Diagnosability Analysis of Discrete Event Systems with Autonomous Components Lina Ye, Philippe Dague To cite this version: Lina Ye, Philippe Dague. Diagnosability Analysis of Discrete Event Systems with

More information

Semi-asynchronous. Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER

Semi-asynchronous. Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER Semi-asynchronous Fault Diagnosis of Discrete Event Systems ALEJANDRO WHITE DR. ALI KARIMODDINI OCTOBER 2017 NC A&T State University http://www.ncat.edu/ Alejandro White Semi-asynchronous http://techlav.ncat.edu/

More information

Active Fault Diagnosis for Uncertain Systems

Active Fault Diagnosis for Uncertain Systems Active Fault Diagnosis for Uncertain Systems Davide M. Raimondo 1 Joseph K. Scott 2, Richard D. Braatz 2, Roberto Marseglia 1, Lalo Magni 1, Rolf Findeisen 3 1 Identification and Control of Dynamic Systems

More information

A Physically-Based Fault Detection and Isolation Method and Its Uses in Robot Manipulators

A Physically-Based Fault Detection and Isolation Method and Its Uses in Robot Manipulators des FA 4.13 Steuerung und Regelung von Robotern A Physically-Based Fault Detection and Isolation Method and Its Uses in Robot Manipulators Alessandro De Luca Dipartimento di Informatica e Sistemistica

More information

Diagnosis of Dense-Time Systems using Digital-Clocks

Diagnosis of Dense-Time Systems using Digital-Clocks Diagnosis of Dense-Time Systems using Digital-Clocks Shengbing Jiang GM R&D and Planning Mail Code 480-106-390 Warren, MI 48090-9055 Email: shengbing.jiang@gm.com Ratnesh Kumar Dept. of Elec. & Comp. Eng.

More information

IN THIS paper we investigate the diagnosability of stochastic

IN THIS paper we investigate the diagnosability of stochastic 476 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 50, NO 4, APRIL 2005 Diagnosability of Stochastic Discrete-Event Systems David Thorsley and Demosthenis Teneketzis, Fellow, IEEE Abstract We investigate

More information

APPLICATION OF THE FUZZY STATE FUZZY OUTPUT FINITE STATE MACHINE TO THE PROBLEM OF RECOVERY FROM VIOLATIONS OF ONTOLOGICAL ASSUMPTIONS

APPLICATION OF THE FUZZY STATE FUZZY OUTPUT FINITE STATE MACHINE TO THE PROBLEM OF RECOVERY FROM VIOLATIONS OF ONTOLOGICAL ASSUMPTIONS APPLICATION OF THE FUZZY STATE FUZZY OUTPUT FINITE STATE MACHINE TO THE PROBLEM OF RECOVERY FROM VIOLATIONS OF ONTOLOGICAL ASSUMPTIONS JANOS L. GRANTNER Department of Electrical and Computer Engineering

More information

Robot Dynamics Instantaneous Kinematiccs and Jacobians

Robot Dynamics Instantaneous Kinematiccs and Jacobians Robot Dynamics Instantaneous Kinematiccs and Jacobians 151-0851-00 V Lecture: Tuesday 10:15 12:00 CAB G11 Exercise: Tuesday 14:15 16:00 every 2nd week Marco Hutter, Michael Blösch, Roland Siegwart, Konrad

More information

Semi-asynchronous Fault Diagnosis of Discrete Event Systems

Semi-asynchronous Fault Diagnosis of Discrete Event Systems 1 Semi-asynchronous Fault Diagnosis of Discrete Event Systems Alejandro White, Student Member, IEEE, Ali Karimoddini, Senior Member, IEEE Abstract This paper proposes a diagnostics tool for a Discrete-

More information

Stéphane Lafortune. August 2006

Stéphane Lafortune. August 2006 UNIVERSITY OF MICHIGAN DEPARTMENT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE LECTURE NOTES FOR EECS 661 CHAPTER 1: INTRODUCTION TO DISCRETE EVENT SYSTEMS Stéphane Lafortune August 2006 References for

More information

Diagnosis of Repeated/Intermittent Failures in Discrete Event Systems

Diagnosis of Repeated/Intermittent Failures in Discrete Event Systems Diagnosis of Repeated/Intermittent Failures in Discrete Event Systems Shengbing Jiang, Ratnesh Kumar, and Humberto E. Garcia Abstract We introduce the notion of repeated failure diagnosability for diagnosing

More information

Automata-Theoretic Model Checking of Reactive Systems

Automata-Theoretic Model Checking of Reactive Systems Automata-Theoretic Model Checking of Reactive Systems Radu Iosif Verimag/CNRS (Grenoble, France) Thanks to Tom Henzinger (IST, Austria), Barbara Jobstmann (CNRS, Grenoble) and Doron Peled (Bar-Ilan University,

More information

Online Failure Diagnosis of Stochastic Discrete Event Systems

Online Failure Diagnosis of Stochastic Discrete Event Systems Online Failure iagnosis of Stochastic iscrete Event Systems Jun Chen, Student Member, IEEE and Ratnesh Kumar, Fellow, IEEE Abstract This paper deals with the detection of (permanent) fault in the setting

More information

STRUCTURAL DESIGN OF SYSTEMS WITH SAFE BEHAVIOR UNDER SINGLE AND MULTIPLE FAULTS. and Marcel Staroswiecki

STRUCTURAL DESIGN OF SYSTEMS WITH SAFE BEHAVIOR UNDER SINGLE AND MULTIPLE FAULTS. and Marcel Staroswiecki STRUCTURAL DESIGN OF SYSTEMS WITH SAFE BEHAVIOR UNDER SINGLE AND MULTIPLE FAULTS Mogens Blanke and Marcel Staroswiecki Automation at Ørsted DTU, Build. 326, Technical University of Denmark, Kgs. Lyngby,

More information

Achieving Fault-tolerance and Safety of Discrete-event Systems through Learning

Achieving Fault-tolerance and Safety of Discrete-event Systems through Learning 2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016. Boston, MA, USA Achieving Fault-tolerance and Safety of Discrete-event Systems through Learning Jin Dai, Ali Karimoddini,

More information

FAULT DETECTION AND FAULT TOLERANT APPROACHES WITH AIRCRAFT APPLICATION. Andrés Marcos

FAULT DETECTION AND FAULT TOLERANT APPROACHES WITH AIRCRAFT APPLICATION. Andrés Marcos FAULT DETECTION AND FAULT TOLERANT APPROACHES WITH AIRCRAFT APPLICATION 2003 Louisiana Workshop on System Safety Andrés Marcos Dept. Aerospace Engineering and Mechanics, University of Minnesota 28 Feb,

More information

Decentralized Failure Diagnosis of Discrete Event Systems

Decentralized Failure Diagnosis of Discrete Event Systems IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL., NO., 2005 1 Decentralized Failure Diagnosis of Discrete Event Systems Wenbin Qiu, Student Member, IEEE, and Ratnesh Kumar,

More information

An Efficient Algorithm for Finding Over-constrained Sub-systems for Construction of Diagnostic Tests

An Efficient Algorithm for Finding Over-constrained Sub-systems for Construction of Diagnostic Tests An Efficient Algorithm for Finding Over-constrained Sub-systems for Construction of Diagnostic Tests Mattias Krysander, Jan Åslund, Mattias Nyberg Linköpings universitet, Dept. of Electrical Engineering

More information

Comparing diagnosability in Continuous and Discrete-Event Systems

Comparing diagnosability in Continuous and Discrete-Event Systems Comparing diagnosability in Continuous and Discrete-Event Systems Marie-Odile Cordier INRIA Rennes, France Louise Travé-Massuyès and Xavier Pucel LAAS-CNRS Toulouse, France Abstract This paper is concerned

More information

XMA2C011, Annual Examination 2012: Worked Solutions

XMA2C011, Annual Examination 2012: Worked Solutions XMA2C011, Annual Examination 2012: Worked Solutions David R. Wilkins 1. (a) Let A, B and C be sets. Prove that A (B \ C) = (A B) \ (A C). We show that every element of A (B \ C) is an element of (A B)

More information

Homing and Synchronizing Sequences

Homing and Synchronizing Sequences Homing and Synchronizing Sequences Sven Sandberg Information Technology Department Uppsala University Sweden 1 Outline 1. Motivations 2. Definitions and Examples 3. Algorithms (a) Current State Uncertainty

More information

Chapter 5. Finite Automata

Chapter 5. Finite Automata Chapter 5 Finite Automata 5.1 Finite State Automata Capable of recognizing numerous symbol patterns, the class of regular languages Suitable for pattern-recognition type applications, such as the lexical

More information

Abstractions and Decision Procedures for Effective Software Model Checking

Abstractions and Decision Procedures for Effective Software Model Checking Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture

More information

FAULT diagnosis is crucial for ensuring the safe operation

FAULT diagnosis is crucial for ensuring the safe operation A Qualitative Event-based Approach to Continuous Systems Diagnosis Matthew J. Daigle Member, IEEE, Xenofon D. Koutsoukos Senior Member, IEEE, and Gautam Biswas Senior Member, IEEE Abstract Fault diagnosis

More information

MOST OF the published research on control of discreteevent

MOST OF the published research on control of discreteevent IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 1, JANUARY 1998 3 Discrete-Event Control of Nondeterministic Systems Michael Heymann and Feng Lin, Member, IEEE Abstract Nondeterminism in discrete-event

More information

arxiv: v1 [math.ds] 18 Nov 2008

arxiv: v1 [math.ds] 18 Nov 2008 arxiv:0811.2889v1 [math.ds] 18 Nov 2008 Abstract Quaternions And Dynamics Basile Graf basile.graf@epfl.ch February, 2007 We give a simple and self contained introduction to quaternions and their practical

More information

Resolution of Initial-State in Security Applications of DES

Resolution of Initial-State in Security Applications of DES Resolution of Initial-State in Security Applications of DES Christoforos N. Hadjicostis Abstract A non-deterministic labeled finite automaton is initial-state opaque if the membership of its true initial

More information

Test Statistique Structurel et Fonctionnel

Test Statistique Structurel et Fonctionnel Test Statistique Structurel et Fonctionnel Pascale Thévenod-Fosse, Hélène Waeselynck {thevenod,waeselyn}@laas.fr Journée Club SEE "Systèmes informatiques de confiance" Thème : Test Paris, le 1er juin 1999

More information

Fault Detection and Diagnosis for a Three-tank system using Structured Residual Approach

Fault Detection and Diagnosis for a Three-tank system using Structured Residual Approach Fault Detection and Diagnosis for a Three-tank system using Structured Residual Approach A.Asokan and D.Sivakumar Department of Instrumentation Engineering, Faculty of Engineering & Technology Annamalai

More information

Fault Diagnosis for an Unknown Plant

Fault Diagnosis for an Unknown Plant Fault Diagnosis for an Unknown Plant Mohammad Mahdi Karimi Second year PhD. Candidate, ECE Supervisor: Dr Ali Karimoddini November 2015 mmkarimi@aggies.ncat.edu North Carolina Agricultural and Technical

More information

Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications

Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications Shengbing Jiang and Ratnesh Kumar Abstract The paper studies failure diagnosis of discrete event systems with

More information

Temporal Logic. M φ. Outline. Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness. Ralf Huuck. Kripke Structure

Temporal Logic. M φ. Outline. Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness. Ralf Huuck. Kripke Structure Outline Temporal Logic Ralf Huuck Why not standard logic? What is temporal logic? LTL CTL* CTL Fairness Model Checking Problem model, program? M φ satisfies, Implements, refines property, specification

More information

AIRCRAFT BRAKING DYNAMICS AND BRAKE SYSTEM MODELING FOR FAULT DETECTION AND ISOLATION

AIRCRAFT BRAKING DYNAMICS AND BRAKE SYSTEM MODELING FOR FAULT DETECTION AND ISOLATION AIRCRAFT BRAKING DYNAMICS AND BRAKE SYSTEM MODELING FOR FAULT DETECTION AND ISOLATION Lucas Cardoso Navarro ITA São José dos Campos, São Paulo, Brazil Luiz Carlos Sandoval Goes ITA São José dos Campos,

More information

Set-valued Observer-based Active Fault-tolerant Model Predictive Control

Set-valued Observer-based Active Fault-tolerant Model Predictive Control Set-valued Observer-based Active Fault-tolerant Model Predictive Control Feng Xu 1,2, Vicenç Puig 1, Carlos Ocampo-Martinez 1 and Xueqian Wang 2 1 Institut de Robòtica i Informàtica Industrial (CSIC-UPC),Technical

More information

FAULT DETECTION ON A REACTION WHEEL BASED ON PARAMETER ESTIMATION

FAULT DETECTION ON A REACTION WHEEL BASED ON PARAMETER ESTIMATION FAULT DETECTION ON A REACTION WHEEL BASED ON PARAMETER ESTIMATION Alexandre Carvalho Leite, Hélio Koiti Kuga, Roberto Vieira da Fonseca Lopes Av. dos Astronautas, 1.758, Jd. Granja, Ed. Satélite Av. dos

More information

Intersection Based Decentralized Diagnosis: Implementation and Verification

Intersection Based Decentralized Diagnosis: Implementation and Verification Intersection Based Decentralized Diagnosis: Implementation and Verification Maria Panteli and Christoforos N. Hadjicostis Abstract We consider decentralized diagnosis in discrete event systems that are

More information

DECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES. Wenbin Qiu and Ratnesh Kumar

DECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES. Wenbin Qiu and Ratnesh Kumar DECENTRALIZED DIAGNOSIS OF EVENT-DRIVEN SYSTEMS FOR SAFELY REACTING TO FAILURES Wenbin Qiu and Ratnesh Kumar Department of Electrical and Computer Engineering Iowa State University Ames, IA 50011, U.S.A.

More information

Monitoring and Fault-Diagnosis with Digital Clocks

Monitoring and Fault-Diagnosis with Digital Clocks Author manuscript, published in "6th Int. Conf. on Application of Concurrency to System Design (ACSD'06) (2006)" Monitoring and Fault-Diagnosis with Digital Clocks Karine Altisen Verimag Laboratory Karine.Altisen@imag.fr

More information

CHAPTER 5 SIMULATION AND TEST SETUP FOR FAULT ANALYSIS

CHAPTER 5 SIMULATION AND TEST SETUP FOR FAULT ANALYSIS 47 CHAPTER 5 SIMULATION AND TEST SETUP FOR FAULT ANALYSIS 5.1 INTRODUCTION This chapter describes the simulation model and experimental set up used for the fault analysis. For the simulation set up, the

More information

Finite Automata and Regular Languages (part III)

Finite Automata and Regular Languages (part III) Finite Automata and Regular Languages (part III) Prof. Dan A. Simovici UMB 1 / 1 Outline 2 / 1 Nondeterministic finite automata can be further generalized by allowing transitions between states without

More information

Symbolic 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 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 information

Finite Automata - Deterministic Finite Automata. Deterministic Finite Automaton (DFA) (or Finite State Machine)

Finite Automata - Deterministic Finite Automata. Deterministic Finite Automaton (DFA) (or Finite State Machine) Finite Automata - Deterministic Finite Automata Deterministic Finite Automaton (DFA) (or Finite State Machine) M = (K, Σ, δ, s, A), where K is a finite set of states Σ is an input alphabet s K is a distinguished

More information

A Qualitative Approach to Multiple Fault Isolation in Continuous Systems

A Qualitative Approach to Multiple Fault Isolation in Continuous Systems A Qualitative Approach to Multiple Fault Isolation in Continuous Systems Matthew Daigle and Xenofon Koutsoukos and Gautam Biswas Institute for Software Integrated Systems (ISIS) Department of Electrical

More information

Finite-State Machines (Automata) lecture 12

Finite-State Machines (Automata) lecture 12 Finite-State Machines (Automata) lecture 12 cl a simple form of computation used widely one way to find patterns 1 A current D B A B C D B C D A C next 2 Application Fields Industry real-time control,

More information

Trajectory Planning, Setpoint Generation and Feedforward for Motion Systems

Trajectory Planning, Setpoint Generation and Feedforward for Motion Systems 2 Trajectory Planning, Setpoint Generation and Feedforward for Motion Systems Paul Lambrechts Digital Motion Control (4K4), 23 Faculty of Mechanical Engineering, Control Systems Technology Group /42 2

More information

Büchi Automata and their closure properties. - Ajith S and Ankit Kumar

Büchi Automata and their closure properties. - Ajith S and Ankit Kumar Büchi Automata and their closure properties - Ajith S and Ankit Kumar Motivation Conventional programs accept input, compute, output result, then terminate Reactive program : not expected to terminate

More information

Sri vidya college of engineering and technology

Sri vidya college of engineering and technology Unit I FINITE AUTOMATA 1. Define hypothesis. The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order

More information

CS 322 D: Formal languages and automata theory

CS 322 D: Formal languages and automata theory CS 322 D: Formal languages and automata theory Tutorial NFA DFA Regular Expression T. Najla Arfawi 2 nd Term - 26 Finite Automata Finite Automata. Q - States 2. S - Alphabets 3. d - Transitions 4. q -

More information

Introduction to Kleene Algebras

Introduction to Kleene Algebras Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)

More information

Introduction to Probabilistic Reasoning. Image credit: NASA. Assignment

Introduction to Probabilistic Reasoning. Image credit: NASA. Assignment Introduction to Probabilistic Reasoning Brian C. Williams 16.410/16.413 November 17 th, 2010 11/17/10 copyright Brian Williams, 2005-10 1 Brian C. Williams, copyright 2000-09 Image credit: NASA. Assignment

More information

THE REACTION WHEEL PENDULUM

THE REACTION WHEEL PENDULUM THE REACTION WHEEL PENDULUM By Ana Navarro Yu-Han Sun Final Report for ECE 486, Control Systems, Fall 2013 TA: Dan Soberal 16 December 2013 Thursday 3-6pm Contents 1. Introduction... 1 1.1 Sensors (Encoders)...

More information

Succinctness of the Complement and Intersection of Regular Expressions

Succinctness of the Complement and Intersection of Regular Expressions Succinctness of the Complement and Intersection of Regular Expressions Wouter Gelade and Frank Neven Hasselt University and transnational University of Limburg February 21, 2008 W. Gelade (Hasselt University)

More information

Efficient Simulation of Hybrid Systems: A Hybrid Bond Graph Approach

Efficient Simulation of Hybrid Systems: A Hybrid Bond Graph Approach Efficient Simulation of Hybrid Systems: A Hybrid Bond Graph Approach Indranil Roychoudhury, Matthew J. Daigle, Gautam Biswas, and Xenofon Koutsoukos SGT Inc., NASA Ames Research Center, Moffett Field,

More information

Inverse differential kinematics Statics and force transformations

Inverse differential kinematics Statics and force transformations Robotics 1 Inverse differential kinematics Statics and force transformations Prof Alessandro De Luca Robotics 1 1 Inversion of differential kinematics! find the joint velocity vector that realizes a desired

More information

Sliding Mode Control Strategies for Spacecraft Rendezvous Maneuvers

Sliding Mode Control Strategies for Spacecraft Rendezvous Maneuvers Osaka University March 15, 2018 Sliding Mode Control Strategies for Spacecraft Rendezvous Maneuvers Elisabetta Punta CNR-IEIIT, Italy Problem Statement First Case Spacecraft Model Position Dynamics Attitude

More information

Embedded 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. 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 information

Entropy of tree automata, joint spectral radii and zero-error coding

Entropy of tree automata, joint spectral radii and zero-error coding Entropy of tree automata, joint spectral radii and zero-error coding Cătălin Dima LACL, Univ. Paris-Est Automata Theory and Symbolic Dynamics Workshop, 3-7 June, 2013 Cătălin Dima (LACL, UPEC) Entropy,

More information

ON DIAGNOSIS AND PREDICTABILITY OF PARTIALLY-OBSERVED DISCRETE-EVENT SYSTEMS

ON DIAGNOSIS AND PREDICTABILITY OF PARTIALLY-OBSERVED DISCRETE-EVENT SYSTEMS ON DIAGNOSIS AND PREDICTABILITY OF PARTIALLY-OBSERVED DISCRETE-EVENT SYSTEMS by Sahika Genc A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Electrical

More information

Course Runtime Verification

Course Runtime Verification Course Martin Leucker (ISP) Volker Stolz (Høgskolen i Bergen, NO) INF5140 / V17 Chapters of the Course Chapter 1 Recall in More Depth Chapter 2 Specification Languages on Words Chapter 3 LTL on Finite

More information

THESE. présentée en vue d obtenir le grade de DOCTEUR. Spécialité : Automatique et Informatique Industrielle. Par. LOUAJRI Hanane

THESE. présentée en vue d obtenir le grade de DOCTEUR. Spécialité : Automatique et Informatique Industrielle. Par. LOUAJRI Hanane N d ordre : 41680 THESE présentée en vue d obtenir le grade de DOCTEUR en Spécialité : Automatique et Informatique Industrielle Par LOUAJRI Hanane DOCTORAT DELIVRE CONJOINTEMENT PAR MINES DOUAI ET L UNIVERSITE

More information

Model-based Fault Diagnosis Techniques Design Schemes, Algorithms, and Tools

Model-based Fault Diagnosis Techniques Design Schemes, Algorithms, and Tools Steven X. Ding Model-based Fault Diagnosis Techniques Design Schemes, Algorithms, and Tools Springer Notation XIX Part I Introduction, basic concepts and preliminaries 1 Introduction 3 1.1 Basic concepts

More information

Global Constraints. pp , sections Leo Moisio. T Seminar on Theoretical Computer Science, 2009

Global Constraints. pp , sections Leo Moisio. T Seminar on Theoretical Computer Science, 2009 Talk 8: pp. 185-200, sections 6.3.2-6.5.3 T-79.4001 Seminar on Theoretical Computer Science, 2009 Outline Introduction 1 Introduction Motivation Basic Definitions and Notation 2 3 Introduction to Constraint

More information

Bernhard Steffen, Falk Howar, Malte Isberner TU Dortmund /CMU. B. Steffen Summer School CPS

Bernhard Steffen, Falk Howar, Malte Isberner TU Dortmund /CMU. B. Steffen Summer School CPS Active Automata Learning: From DFA to Interface Programs and Beyond or From Languages to Program Executions or (more technically) The Power of Counterexample Analysis Bernhard Steffen, Falk Howar, Malte

More information

A Model-Based Framework for Stochastic Diagnosability

A Model-Based Framework for Stochastic Diagnosability A Model-Based Framework for Stochastic Diagnosability Gregory Provan Computer Science Department, University College Cork, Cork, Ireland email: g.provan@cs.ucc.ie Abstract We propose a model-based framework

More information

EE249 - Fall 2012 Lecture 18: Overview of Concrete Contract Theories. Alberto Sangiovanni-Vincentelli Pierluigi Nuzzo

EE249 - 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 information

An Introduction to Description Logic VIII Inherent intractability of terminological reasoning

An Introduction to Description Logic VIII Inherent intractability of terminological reasoning An Introduction to Description Logic VIII Inherent intractability of terminological reasoning Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc,

More information

Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66

Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66 Helsinki University of Technology Laboratory for Theoretical Computer Science Research Reports 66 Teknillisen korkeakoulun tietojenkäsittelyteorian laboratorion tutkimusraportti 66 Espoo 2000 HUT-TCS-A66

More information

Verification of analog and mixed-signal circuits using hybrid systems techniques

Verification 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 information

A Comprehensive Diagnosis Methodology for Complex Hybrid Systems: A Case Study on Spacecraft Power Distribution Systems

A Comprehensive Diagnosis Methodology for Complex Hybrid Systems: A Case Study on Spacecraft Power Distribution Systems 1 A Comprehensive Diagnosis Methodology for Complex Hybrid Systems: A Case Study on Spacecraft Power Distribution Systems Matthew J. Daigle Member, IEEE, Indranil Roychoudhury Member, IEEE, Gautam Biswas

More information

What we have done so far

What we have done so far What we have done so far DFAs and regular languages NFAs and their equivalence to DFAs Regular expressions. Regular expressions capture exactly regular languages: Construct a NFA from a regular expression.

More information

Linear Time Logic Control of Discrete-Time Linear Systems

Linear Time Logic Control of Discrete-Time Linear Systems University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering December 2006 Linear Time Logic Control of Discrete-Time Linear Systems Paulo Tabuada

More information

Parameter iden+fica+on with hybrid systems in a bounded- error framework

Parameter iden+fica+on with hybrid systems in a bounded- error framework Parameter iden+fica+on with hybrid systems in a bounded- error framework Moussa MAIGA, Nacim RAMDANI, & Louise TRAVE- MASSUYES Université d Orléans, Bourges, and LAAS CNRS Toulouse, France.!! SWIM 2015,

More information

Finite State Machines. CS 447 Wireless Embedded Systems

Finite 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 information

CS 455/555: Finite automata

CS 455/555: Finite automata CS 455/555: Finite automata Stefan D. Bruda Winter 2019 AUTOMATA (FINITE OR NOT) Generally any automaton Has a finite-state control Scans the input one symbol at a time Takes an action based on the currently

More information

Automata Theory for Presburger Arithmetic Logic

Automata Theory for Presburger Arithmetic Logic Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood

More information

Integrated Fault Diagnosis Based on Petri Net Models

Integrated Fault Diagnosis Based on Petri Net Models 16th IEEE International Conference on Control Applications Part of IEEE Multi-conference on Systems and Control Singapore, 1-3 October 2007 TuC05.3 Integrated Fault Diagnosis Based on Petri Net Models

More information

Why fault tolerant system?

Why fault tolerant system? Why fault tolerant system? Non Fault-Tolerant System Component 1 Component 2 Component N The reliability block diagram of a series systemeach element of the system must operate correctly for the system

More information

Spacecraft Bus / Platform

Spacecraft Bus / Platform Spacecraft Bus / Platform Propulsion Thrusters ADCS: Attitude Determination and Control Subsystem Shield CDH: Command and Data Handling Subsystem Payload Communication Thermal Power Structure and Mechanisms

More information

Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP

Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP Alex Brik 1 and Jeffrey B. Remmel 2 LPNMR 2015 September 2015 1 Google Inc 2 UC San Diego lex Brik and Jeffrey B. Remmel (LPNMR

More information

Outlines. Discrete Time Markov Chain (DTMC) Continuous Time Markov Chain (CTMC)

Outlines. Discrete Time Markov Chain (DTMC) Continuous Time Markov Chain (CTMC) Markov Chains (2) Outlines Discrete Time Markov Chain (DTMC) Continuous Time Markov Chain (CTMC) 2 pj ( n) denotes the pmf of the random variable p ( n) P( X j) j We will only be concerned with homogenous

More information

Practical Evaluation of Transient Voltage Distribution in HVDC/UHVDC Thyristor Valve

Practical Evaluation of Transient Voltage Distribution in HVDC/UHVDC Thyristor Valve Practical Evaluation of Transient Voltage Distribution in HVDC/UHVDC Thyristor Valve Huan Guo guoh07@epri.sgcc.com.cn China Electric Power Research Institute August 31,2011 Introduction Voltage distribution

More information

Show that the following problems are NP-complete

Show that the following problems are NP-complete Show that the following problems are NP-complete April 7, 2018 Below is a list of 30 exercises in which you are asked to prove that some problem is NP-complete. The goal is to better understand the theory

More information

A Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems

A Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems A Learning-based Active Fault-tolerant Control Framework of Discrete-event Systems Jin Dai, Ali Karimoddini and Hai Lin Abstract A fault-tolerant controller is a controller that drives the plant to satisfy

More information

AS3010: Introduction to Space Technology

AS3010: Introduction to Space Technology AS3010: Introduction to Space Technology L E C T U R E 22 Part B, Lecture 22 19 April, 2017 C O N T E N T S Attitude stabilization passive and active. Actuators for three axis or active stabilization.

More information

Application of Adaptive Thresholds in Robust Fault Detection of an Electro- Mechanical Single-Wheel Steering Actuator

Application of Adaptive Thresholds in Robust Fault Detection of an Electro- Mechanical Single-Wheel Steering Actuator Preprints of the 8th IFAC Symposium on Fault Detection, Supervision and Safety of Technical Processes (SAFEPROCESS) August 29-31, 212. Mexico City, Mexico Application of Adaptive Thresholds in Robust Fault

More information

On the Design of Adaptive Supervisors for Discrete Event Systems

On the Design of Adaptive Supervisors for Discrete Event Systems On the Design of Adaptive Supervisors for Discrete Event Systems Vigyan CHANDRA Department of Technology, Eastern Kentucky University Richmond, KY 40475, USA and Siddhartha BHATTACHARYYA Division of Computer

More information

Coordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems

Coordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems Discrete Event Dynamic Systems: Theory and Applications, 10, 33 86 (2000) c 2000 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Coordinated Decentralized Protocols for Failure Diagnosis

More information

Lecture Module 5: Introduction to Attitude Stabilization and Control

Lecture Module 5: Introduction to Attitude Stabilization and Control 1 Lecture Module 5: Introduction to Attitude Stabilization and Control Lectures 1-3 Stability is referred to as a system s behaviour to external/internal disturbances (small) in/from equilibrium states.

More information

Discrete abstractions of hybrid systems for verification

Discrete 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 information

TWO-WAY FINITE AUTOMATA & PEBBLE AUTOMATA. Written by Liat Peterfreund

TWO-WAY FINITE AUTOMATA & PEBBLE AUTOMATA. Written by Liat Peterfreund TWO-WAY FINITE AUTOMATA & PEBBLE AUTOMATA Written by Liat Peterfreund 1 TWO-WAY FINITE AUTOMATA A two way deterministic finite automata (2DFA) is a quintuple M Q,,, q0, F where: Q,, q, F are as before

More information

Logic BIST. Sungho Kang Yonsei University

Logic BIST. Sungho Kang Yonsei University Logic BIST Sungho Kang Yonsei University Outline Introduction Basics Issues Weighted Random Pattern Generation BIST Architectures Deterministic BIST Conclusion 2 Built In Self Test Test/ Normal Input Pattern

More information

Decentralized vs. Monolithic Control of Automata and Weighted Automata

Decentralized vs. Monolithic Control of Automata and Weighted Automata Decentralized vs. Monolithic Control of Automata and Weighted Automata Jan Komenda INSTITUTE of MATHEMATICS Academy of Sciences Czech Republic Institute of Mathematics, Brno branch, November 11, 2016 Outline

More information

FIBER OPTIC GYRO-BASED ATTITUDE DETERMINATION FOR HIGH- PERFORMANCE TARGET TRACKING

FIBER OPTIC GYRO-BASED ATTITUDE DETERMINATION FOR HIGH- PERFORMANCE TARGET TRACKING FIBER OPTIC GYRO-BASED ATTITUDE DETERMINATION FOR HIGH- PERFORMANCE TARGET TRACKING Elias F. Solorzano University of Toronto (Space Flight Laboratory) Toronto, ON (Canada) August 10 th, 2016 30 th AIAA/USU

More information

Hybrid systems and computer science a short tutorial

Hybrid 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 information

September 11, Second Part of Regular Expressions Equivalence with Finite Aut

September 11, Second Part of Regular Expressions Equivalence with Finite Aut Second Part of Regular Expressions Equivalence with Finite Automata September 11, 2013 Lemma 1.60 If a language is regular then it is specified by a regular expression Proof idea: For a given regular language

More information