reasoning about stability
play

Reasoning about Stability Mahesh Viswanathan University of - PowerPoint PPT Presentation

Reasoning about Stability Mahesh Viswanathan University of Illinois, Urbana-Champaign MVD, October 2014 Viswanathan Reasoning about Stability Reasoning about Stability Mahesh Viswanathan P. Prabhakar G.E. Dullerud N. Roohi University of


  1. Invariance under Uniformly Continuous Bisimulations Theorem Let T 1 and T 2 be hybrid transition systems with 0 as an equilibrium point. Suppose R is a uniformly continuous bisimulation such that (0 , 0) ∈ R then T 1 is Lyapunov stable w.r.t. 0 i ff T 2 is Lyapunov stable w.r.t. 0 Viswanathan Reasoning about Stability

  2. Invariance under Uniformly Continuous Bisimulations Theorem Let T 1 and T 2 be hybrid transition systems with 0 as an equilibrium point. Suppose R is a uniformly continuous bisimulation such that (0 , 0) ∈ R then T 1 is Lyapunov (Asymptotically) stable w.r.t. 0 i ff T 2 is Lyapunov (Asymptotically) stable w.r.t. 0 Viswanathan Reasoning about Stability

  3. Invariance under Uniformly Continuous Bisimulations Theorem Let T 1 and T 2 be hybrid transition systems with 0 as an equilibrium point. Suppose R is a uniformly continuous bisimulation such that (0 , 0) ∈ R then T 1 is Lyapunov (Asymptotically) stable w.r.t. 0 i ff T 2 is Lyapunov (Asymptotically) stable w.r.t. 0 Above observation generalizes to stronger notions of stability Viswanathan Reasoning about Stability

  4. Invariance under Uniformly Continuous Bisimulations Theorem Let T 1 and T 2 be hybrid transition systems with 0 as an equilibrium point. Suppose R is a uniformly continuous bisimulation such that (0 , 0) ∈ R then T 1 is Lyapunov (Asymptotically) stable w.r.t. 0 i ff T 2 is Lyapunov (Asymptotically) stable w.r.t. 0 Above observation generalizes to stronger notions of stability Uniformly continuous simulations reflect stability notions Viswanathan Reasoning about Stability

  5. Lyapunov’s Second Method System ˙ x = F ( x ) with solution ' ( x , t ) Equilibrium F (0) = 0 Viswanathan Reasoning about Stability

  6. Lyapunov’s Second Method System ˙ x = F ( x ) with solution ' ( x , t ) Equilibrium F (0) = 0 If there exists a “Lyapunov function” for the system then it is Lyapunov stable. Viswanathan Reasoning about Stability

  7. Lyapunov Function An Illustration Viswanathan Reasoning about Stability

  8. Lyapunov Function An Illustration Viswanathan Reasoning about Stability

  9. Lyapunov Function An Illustration Viswanathan Reasoning about Stability

  10. Lyapunov Function An Illustration Viswanathan Reasoning about Stability

  11. Lyapunov’s Method as an Abstraction x = F ( x ) ˙ ϕ Viswanathan Reasoning about Stability

  12. Lyapunov’s Method as an Abstraction x = F ( x ) ˙ ϕ Exists V : R n → R + s.t. V is positive definite C 1 ˙ V ≤ 0 Viswanathan Reasoning about Stability

  13. Lyapunov’s Method as an Abstraction x = F ( x ) ˙ V ( ϕ ) ϕ Exists V : R n → R + s.t. t v 1 − → v 2 i ff exist x 1 , x 2 s.t. V is positive definite C 1 t x 1 − → x 2 , V ( x 1 ) = v 1 and ˙ V ≤ 0 V ( x 2 ) = v 2 . Viswanathan Reasoning about Stability

  14. Lyapunov’s Method as an Abstraction Easily Stable x = F ( x ) ˙ V ( ϕ ) ϕ Exists V : R n → R + s.t. t v 1 − → v 2 i ff exist x 1 , x 2 s.t. V is positive definite C 1 t x 1 − → x 2 , V ( x 1 ) = v 1 and ˙ V ≤ 0 V ( x 2 ) = v 2 . Viswanathan Reasoning about Stability

  15. Lyapunov’s Method as an Abstraction Unif. Cont. Easily Stable Simulation x = F ( x ) ˙ V ( ϕ ) ϕ Exists V : R n → R + s.t. t v 1 − → v 2 i ff exist x 1 , x 2 s.t. V is positive definite C 1 t x 1 − → x 2 , V ( x 1 ) = v 1 and ˙ V ≤ 0 V ( x 2 ) = v 2 . Viswanathan Reasoning about Stability

  16. Other Characterizations Other extensions of Lyapunov’s method to switched systems can also be understood in the abstraction setting Hartman-Grobman Theorem contructs a uniformly continuous bisimilar linearization Viswanathan Reasoning about Stability

  17. Expressing Stability Stabiity cannot be expressed in the classical modal/temporal logics like Hennessy-Milner, LTL, CTL, µ -calculus, etc. Logic equivalence for these logics coincides with bisimulation Viswanathan Reasoning about Stability

  18. Expressing Stability Stabiity cannot be expressed in the classical modal/temporal logics like Hennessy-Milner, LTL, CTL, µ -calculus, etc. Logic equivalence for these logics coincides with bisimulation First order logic over appropriate topologial structures is too strong Viswanathan Reasoning about Stability

  19. Expressing Stability Stabiity cannot be expressed in the classical modal/temporal logics like Hennessy-Milner, LTL, CTL, µ -calculus, etc. Logic equivalence for these logics coincides with bisimulation First order logic over appropriate topologial structures is too strong Is there a (modal) logic that can express stability for which logic equivalence coincides with “continuous” bisimulations? Viswanathan Reasoning about Stability

  20. S 4 : A Modal Logic for Space Orlov[1928], Lewis[1932], G¨ odel[1933], Stone[1937], Tarski[1937] ' ::= p | ¬ ' | ' 1 ∧ ' 2 | ' 1 ∨ ' 2 | I ' | C ' Viswanathan Reasoning about Stability

  21. S 4 : A Modal Logic for Space Orlov[1928], Lewis[1932], G¨ odel[1933], Stone[1937], Tarski[1937] ' ::= p | ¬ ' | ' 1 ∧ ' 2 | ' 1 ∨ ' 2 | I ' | C ' Formulas interpreted as sets of points in a topological space Viswanathan Reasoning about Stability

  22. S 4 : A Modal Logic for Space Orlov[1928], Lewis[1932], G¨ odel[1933], Stone[1937], Tarski[1937] ' ::= p | ¬ ' | ' 1 ∧ ' 2 | ' 1 ∨ ' 2 | I ' | C ' Formulas interpreted as sets of points in a topological space [ [ I ' ] ]: Interior of set defined by ' Viswanathan Reasoning about Stability

  23. S 4 : A Modal Logic for Space Orlov[1928], Lewis[1932], G¨ odel[1933], Stone[1937], Tarski[1937] ' ::= p | ¬ ' | ' 1 ∧ ' 2 | ' 1 ∨ ' 2 | I ' | C ' Formulas interpreted as sets of points in a topological space [ [ I ' ] ]: Interior of set defined by ' [ [ C ' ] ]: Closure of set defined by ' Viswanathan Reasoning about Stability

  24. Bimodal Spatio-Temporal Logic Add to S 4 the usual temporal modalities of ⇤ and ⌃ Viswanathan Reasoning about Stability

  25. Bimodal Spatio-Temporal Logic Add to S 4 the usual temporal modalities of ⇤ and ⌃ Can stability be expressed in the resulting logic? Viswanathan Reasoning about Stability

  26. Bimodal Spatio-Temporal Logic Add to S 4 the usual temporal modalities of ⇤ and ⌃ Can stability be expressed in the resulting logic? No! Viswanathan Reasoning about Stability

  27. Bimodal Spatio-Temporal Logic Add to S 4 the usual temporal modalities of ⇤ and ⌃ Can stability be expressed in the resulting logic? No! [Aiello-van Bentham, Davoren] Logic equivalence in this bi-modal logic coincides with bisimilarity under relations with “weak continuity” properties Viswanathan Reasoning about Stability

  28. Bimodal Spatio-Temporal Logic Add to S 4 the usual temporal modalities of ⇤ and ⌃ Can stability be expressed in the resulting logic? No! [Aiello-van Bentham, Davoren] Logic equivalence in this bi-modal logic coincides with bisimilarity under relations with “weak continuity” properties Open Question: What is the right logic? Viswanathan Reasoning about Stability

  29. Part II How di ffi cult is checking stability computationally? Prabhakar-Viswanathan Viswanathan Reasoning about Stability

  30. What is known about checking Stability? Viswanathan Reasoning about Stability

  31. What is known about checking Stability? Very little! Viswanathan Reasoning about Stability

  32. What is known about checking Stability? Very little! Traditional control theoretic methods focus on identifying su ffi cient conditions that guarantee stability Viswanathan Reasoning about Stability

  33. What is known about checking Stability? Very little! Traditional control theoretic methods focus on identifying su ffi cient conditions that guarantee stability Some complexity results on how di ffi cult it is to find these su ffi cient conditions Viswanathan Reasoning about Stability

  34. What is known about checking Stability? Very little! Traditional control theoretic methods focus on identifying su ffi cient conditions that guarantee stability Some complexity results on how di ffi cult it is to find these su ffi cient conditions [Blondel-Tsitsiklis et. al.] Prove computational lower bounds (undecidability/NP-hardness) on checking stability of special discrete time linear switched systems Viswanathan Reasoning about Stability

  35. Deciding Hybrid Models Traditional techniques to establish decidablity for various properties (like safety, liveness, etc.) of special hybrid models fail for stability Establishing stability needs new ideas Viswanathan Reasoning about Stability

  36. Deciding Hybrid Models Traditional techniques to establish decidablity for various properties (like safety, liveness, etc.) of special hybrid models fail for stability Decidability results rely on establishing the existence of an e ff ectively constructable finite “bisimulation” quotient Establishing stability needs new ideas Viswanathan Reasoning about Stability

  37. Piecewise Constant Derivative (PCD) Systems Viswanathan Reasoning about Stability

  38. Piecewise Constant Derivative (PCD) Systems Viswanathan Reasoning about Stability

  39. Piecewise Constant Derivative (PCD) Systems Viswanathan Reasoning about Stability

  40. Piecewise Constant Derivative (PCD) Systems Viswanathan Reasoning about Stability

  41. Piecewise Constant Derivative (PCD) Systems Viswanathan Reasoning about Stability

  42. Piecewise Constant Derivative (PCD) Systems Viswanathan Reasoning about Stability

  43. Piecewise Constant Derivative (PCD) Systems Viswanathan Reasoning about Stability

  44. Stability in PCD ∀ ✏ > 0 ∃ � > 0 ∀ � . ( � (0) ∈ B � (0)) → ( ∀ t . � ( t ) ∈ B ✏ (0)) Viswanathan Reasoning about Stability

  45. Stability in PCD ∃ � > 0 . ∀ ✏ ∈ (0 , � ] ∀ ✏ > 0 ∃ � > 0 ∀ � . ( � (0) ∈ B � (0)) → ( ∀ t . � ( t ) ∈ B ✏ (0)) Viswanathan Reasoning about Stability

  46. Special Structure Near the Origin The planar partition looks like “wedges”. Viswanathan Reasoning about Stability

  47. Executions near 0 Viswanathan Reasoning about Stability

  48. Executions near 0 Viswanathan Reasoning about Stability

  49. Capturing distance from origin Viswanathan Reasoning about Stability

  50. Capturing distance from origin Viswanathan Reasoning about Stability

  51. Capturing distance from origin Viswanathan Reasoning about Stability

  52. Capturing distance from origin w ( e ) = | d 1 | | d 2 | Viswanathan Reasoning about Stability

  53. Stability Analysis Weighted Graph Viswanathan Reasoning about Stability

  54. Stability Analysis Weighted Graph � = � ( p 1 , p 2 ) � ( p 2 , p 3 ) · · · � ( p 4 , p 5 ) Viswanathan Reasoning about Stability

  55. Stability Analysis Weighted Graph � = � ( p 1 , p 2 ) � ( p 2 , p 3 ) · · · � ( p 4 , p 5 ) w ( � ) = | d ( � ( T )) | | d ( � (0)) | Viswanathan Reasoning about Stability

Recommend


More recommend