Modeling Physics
Modeling Physics
Modeling Physics
Plan
• Dynamical system models
– notions of solutions
– Linear dynamical systems
– Connection to automata
– Stability
– Lyapunov method
Map of CPS models
Dynamical systems
Discrete transition Differential Markov chains
systems, automata inclusions
Probabilistic automata,
Markov decision
processes (MDP)
Continuous time,
Hybrid systems continuous state MDPs
From: Wilczek, Frank. A Beautiful Question: Finding Nature's Deep Design (p. 87).
Introduction to dynamical systems
Behaviors of physical processes are described in terms of instantaneous laws
Common notation:
where time ; state
Example. ;
Initial value problem: Given system (1) and initial state , and input find a state
trajectory or solution of (1).
Notions of solution
What is a solution? Many different notions.
Example.
Solution: works for ; check
Problem: As then ; grows too fast
Lipschitz continuity
A function is Lipschitz continuous if there exist such that for any
pair ,
--- (2)
• : national income
• rate of consumer spending
• : rate government expenditure
Linear system and solutions
sequence of integrals
• with
– Continuous everywhere
• is invertible
Solution of linear systems in
Theorem.
Linear time invariant system
Matrix exponential:
Theorem. , that is
Discrete time models / discrete transition systems
• autonomous
• Execution:
–;
• Deterministic
Discretized or sampled-time model
– ; iff
Properties for dynamical systems
What type of properties are we interested in?
• Invariance (as in the case of automata)
• State remains bounded
• Converges to target
• Bounded input gives bounded output (BIBO)
Requirements: Stability
• We will focus on time invariant autonomous systems (closed
• –(1)
systems, systems without inputs)
• is the solution
• norm
• is an equilibrium point if
• For analysis we will assume 0 to be an equilibrium point of (1)
with out loss of generality
Example: Pendulum
upright
Pendulum equation
down
=
friction coefficient
sta
ble
speed=0
un
sta
ble
upright
CCW down
Aleksandr M. Lyapunov
Aleksandr Mikhailovich Lyapunov (June 6 1857–
November 3, 1918) was a Russian
mathematician and physicist.
𝛿2
𝑥0
Phase portrait of pendulum with friction
Butterfly*
=
coupling coefficient
stable ?
Stability of solutions* (instead of points)
• For any define the s-norm
• A dynamical system can be seen as an operator that maps initial states to signals
• The solution is Lyapunov stable if is continuous as for every there exists such that
for every if then
Verifying Stability for Linear Systems
Consider the linear system
Theorem.
1. It is asymptotically stable iff all the eigenvalues of A have strictly negative real
parts (Hurwitz).
2. It is Lyapunov stable iff all the eigenvalues of A have real parts that are either
zero or negative and the Jordan blocks corresponding to the eigenvalues with
zero real parts are of size 1.
Jordan decomposition
For every n x n matrix A, there exists a nonsingular n x n matrix P such that
• Sublevel sets of |
– and iff
• is also continuous
• is radially unbounded if
Verifying Stability
Theorem. (Lyapunov) Consider the system (1) with state space
and suppose there exists a positive definite, continuously
differentiable function . The system is:
1. Lyapunov stable if for all
2. Asymptotically stable if for all
3. It is globally AS if V is also radially unbounded.
Proof sketch: Lyapunov stable if
• Assume
• Consider a ball around the origin of
radius
B𝜀
• Pick a positive number 𝐿𝑏
𝐵𝛿
• Let be a radius of ball around origin
which is inside
• Since along all trajectories V is non-
increasing, starting from each solution
satisfies and therefore remains in
Proof sketch: Asymptotically stable if
• Assume
• Take arbitrary initial state where this comes from some for Lyapunov
stability
• Since and decreasing along it has a limit at
• It suffices to show that this limit is actually 0
• Suppose not, c > 0 then the solution evolves in the compact set for
some sufficiently small
• Let [slowest rate]
B𝜀
• This number is well-defined and negative
• for all t
𝑟
𝑆
• But then eventually
Example 2: Reasoning about stability without solving ODEs
Given that
𝑥˙ 1 =−𝑥 1+𝑔(𝑥 2)
• Use
𝑥˙ 2=−𝑥 2 +h(𝑥 1)
=
Proof.
An aside: Checking inductive invariants
– set of variables
– written as a program
• How do we check that is an inductive invariant?
• Interpretation: then
For example if the LTI system is globally asymptotically stable then there is
a quadratic Lyapunov function that proves it.