---
title: Time-Interval Stability (PTI)
url: https://www.emergentmind.com/topics/time-interval-stability-pti
type: topic
---

# Time-Interval Stability (PTI)

Time-Interval Stability (PTI) refers to the set of rigorous system-theoretic properties, stability, and performance measures framed explicitly with respect to a *finite* or *prescribed* time interval, rather than classical notions over infinite-horizon or purely asymptotic behavior. PTI is central to modern control and analysis of networked, sampled, switched, and finite-time systems, where stability, dissipativity, and performance must be characterized or certified over bounded intervals—for instance in dwell-time, maximally allowable transfer intervals (MATI), or “prescribed-time” convergence and input-to-state stability. This article presents formal definitions, modeling frameworks, Lyapunov-theoretic and convex computational tools, roles of scheduling protocols and delays, and algorithmic synthesis procedures that together comprise the methodology of time-interval (PTI) stability.

## 1. Notions and Definitions of Time-Interval Stability

PTI encompasses several formally distinct, but closely related, notions all centering on the behavior of dynamical or hybrid systems over a finite or prescribed interval $[t_0, T]$:

- **Finite-Time Stability (FTS):** The state, or input-output map, is bounded in norm on $[t_0, T]$ under admissible disturbances or initial conditions, possibly with prescribed thresholds [1107.5968].

- **Input-Output Finite-Time Stability (IO-FTS):** For a system with state $x(t)$, input $u(t)$, and output $y(t)$, IO-FTS with respect to class $\mathcal{W}$, output weighting $Q(t)\succ0$, and horizon $\Omega=[t_0,T]$ is defined by
  $$
  u(\cdot)\in\mathcal{W} \implies y(t)^\top Q(t) y(t) < 1,\ \forall t\in [t_0, T].
  $$
  This generalizes both $L_2$-gain and ISS to finite horizons and arbitrary weighting [1107.5968].

- **Prescribed-Time Stability (PTS), PT-ISS, and MATI:** PTS refers to convergence, or ISS property, within an a priori designer-specified time interval $[0,T)$, with rates enforced via blow-up functions $\varphi(t)\to\infty$ as $t\to T$. PT-ISS generalizes ISS to require convergence (and gain attenuation) within $T$, using Lyapunov functions whose decrease is accelerated by $\varphi(t)$ [2405.00224]. The *Maximally Allowable Transfer Interval* (MATI) denotes the maximum admissible sampling interval $\tau$ under which robust $L_p$-gain or stability properties are still provable [1604.04421].

- **Dwell-Time/PTI for Switched/Impulsive Systems:** Here, time-interval stability is formulated via the *dwell time* between switches/impulses; the minimal (or maximal) dwell time $T_D$ is the smallest (or largest) interval allowed between discrete events without violating prescribed stability/performance levels [1802.00346, 2002.12102].

| Notion     | Key Property                                      | Interval of Interest       |
|------------|---------------------------------------------------|---------------------------|
| FTS        | State/output boundedness                          | $[t_0, T]$                |
| IO-FTS     | Input-output gain bound                           | $[t_0, T]$                |
| MATI       | Max. data transfer interval for $L_p$-gain        | $[t_k, t_{k+1}]$          |
| PT-ISS/PT-C| Convergence within $T$ via blow-up function       | $[0, T)$                  |
| Dwell-Time | Min/Max switching/impulse interval for stability  | $[t_k, t_{k+1}]$          |

## 2. Lyapunov-Theoretic and Convex Criteria

The establishment of PTI stability fundamentally relies on Lyapunov and dissipation inequalities parameterized over finite intervals, transmission intervals, or via clock/timer variables:

- **Finite-Interval Lyapunov Functions and LMIs:** For LTV/state-space systems, IO-FTS is characterized by existence of a differentiable positive-definite $P(t)$ on $[t_0,T]$ such that the dissipation LMI
  $$
  \begin{pmatrix}
    \dot{P} + A^\top P + PA + C^\top Q C & PB \\
    B^\top P & -R
  \end{pmatrix}(t)
  \preceq 0
  $$
  holds for all $t$, with $R, Q \succ 0$ and associated constraints on jump scale at switching or impulse times [1107.5968].

- **Razumikhin-Type and Small-Gain Arguments:** In sampled/distributed systems, Lyapunov–Razumikhin conditions built over inter-transmission intervals enforce decrease properties as long as
  $$
  V(x(t)) \geq \alpha \sup_{s \in [t-h, t]} V(x(s)) \implies \dot{V}(x(t)) \leq -cV(x(t)) + d_0\|w(t)\|^p.
  $$
  Jump conditions depend on scheduling protocol regularity, tightly linking MATI to $L_p$-gain via small-gain inequalities [1604.04421].

- **Blow-Up-Weighted Certificates:** For PT-ISS and prescribed-time convergence, Lyapunov certificates $V(t,x)$ or $V_i(x_i,t)$ satisfy
  $$
  \dot{V} \leq -\varphi(t) V
  $$
  with $\varphi(t)\to\infty$ as $t\to T$, imposing exponential decay in a warped time domain [2405.00224].

- **Timer/Clock-Variable and Dwell-Time LMIs:** In switched/impulsive settings, Lyapunov functionals $V(\tau)$, parameterized by a timer $\tau = t - t_k$, are coupled via flow (intra-interval) and jump (inter-interval) LMIs, which guarantee decrease on every interval of length at least $T_D$ [1802.00346, 2002.12102].

## 3. Maximally Allowable Transfer Interval (MATI) and Impulsive Modeling

Time-interval stability in networked, sampled-data, or impulsive systems is quantitatively described using MATI, where the goal is to guarantee robust $L_p$-performance as a function of the transfer (sampling) interval. The closed-loop is modeled as an impulsive delay system,
$$
\begin{align*}
  \dot{\chi}(t) &= f(t, \chi_t, \omega(t)), \quad t \notin \mathcal{T}, \\
  \chi(t^+) &= h(t, \chi(t^-)), \quad t \in \mathcal{T},
\end{align*}
$$
with state $\chi = (x, e)$ and disturbance stack $\omega$, interspersed by jump/sampling instants $t_k$ such that $t_{k+1}-t_k \leq \tau$.

The MATI $T^*$ is algorithmically computed via:
1. Computation of error-flow gain $L$ and protocol-dependent constants $(a_-, a_+, \rho)$ for the chosen UGES protocol (e.g., Round Robin (RR), Try-Once-Discard (TOD)).
2. Searching over $\tau$, for $(\lambda, M)$ such that the inequalities
   $$
   \begin{aligned}
   &\tau(\lambda + r + (a^2/r)Me^{-\lambda\tau}) < \ln M,\\
   &\tau(\lambda + r + (a^2/(\rho^2 r))e^{\lambda d_{\max}}) < -\ln \rho^2,\\
   &\gamma_W = \frac{2}{\lambda}\sqrt{M},\quad \gamma_W\gamma_H < 1
   \end{aligned}
   $$
   with $\gamma_H$ the $L_p$-gain of the nominal system, are satisfied.
   
   $$
   T^* = \sup \, \{ \tau > 0\,|\, \text{previous conditions hold}\}.
   $$
   This $T^*$ is the maximal sampling interval for which the desired $L_p$-performance holds [1604.04421].

## 4. Dwell-Time and Finite-Interval Analysis of Switched/Impulsive Systems

For switched or impulsive systems subject to dwell-time constraints, time-interval stability is guaranteed by convex tests over the set of admissible intervals:

- **Clock-Dependent Lyapunov-Krasovskii Functionals:** For LPV systems with time-varying or constant delay and piecewise-constant switching, the existence of state- and parameter-dependent functionals $P(\tau,\rho), Q(\tau,\rho), R(\tau,\rho)$ satisfying families of LMIs (across $\tau \in [0,T_D]$ and all parameter pairs) ensures stability under all switching laws adhering to a minimal dwell-time $T_D$ [2002.12102].

- **Infinite-Dimensional Linear Programs and Sum-of-Squares (SOS) Relaxation:** Dwell-time stability for positive impulsive systems is encoded by infinite-dimensional LPs in timer-dependent multipliers, with practical tractable relaxations via SOS polynomial optimization, facilitating algorithmic certification for range, minimal, maximal, or constant dwell-time scenarios [1802.00346].

- **Worst-Case System Reductions:** Under invertible or diagonal uncertainty structure, dwell-time stability can often be checked on a “worst-case” system by eliminating uncertain scalings, further streamlining verification [1802.00346].

| Stability Method                  | Key Mathematical Tool                         | Reference           |
|-----------------------------------|-----------------------------------------------|---------------------|
| Lyapunov-Razumikhin for impulses  | Impulsive-delay inequalities, small gain      | [1604.04421]        |
| Clock-dependent LK functionals    | Parameterized LMIs in $(\tau,\rho)$           | [2002.12102]        |
| SOS/LP relaxation                 | Convex positivity of timer-dependent polynomials| [1802.00346]      |

## 5. Prescribed-Time Stability and Blow-Up Lyapunov Techniques

In prescribed-time (PT) stability, convergence and disturbance attenuation are imposed a priori within a designer-chosen time $T$ via use of time-varying “blow-up” functions $\varphi(t)$:
- $\varphi(t)$ is a blow-up function if $\varphi(t) \to \infty$ as $t \to T$ and $\int_0^t \varphi(s) ds \to \infty$ as $t \to T$.
- Lyapunov certificates $V(t,x)$ must satisfy
  $$
  \dot{V} \leq -\varphi(t) V
  $$
  (cascade/feedback interconnections allow $+ bV_2$ or $+ p(V_1)$ cross-terms).

Key results include:
- Cascade and feedback interconnections with such properties combine via small-gain/diagonal stability conditions to yield PT-convergence for the full interconnected system.
- PT-ISS extends classical ISS by requiring both convergence in $T$ and uniform bounds in bounded disturbance [2405.00224].

## 6. Computational and Algorithmic Procedures

The practical verification and controller synthesis for PTI stability typically follow an explicitly algorithmic workflow:

1. **Model the system in an impulsive, switched, or clock-dependent framework, with timer $\tau$ or block-sampled structure, as appropriate to protocol or network scenario (e.g., NCSs, LPV, positive/distributed-delay, etc.) [1604.04421, 2002.12102, 1802.00346].**

2. **Formulate Lyapunov (or Lyapunov–Razumikhin/Lyapunov–Krasovskii) conditions dependent on the chosen interval, timer, and possibly parameter, with protocol-dependent jump/flow/jump-scaling inequalities.**

3. **Cast the verification conditions as parametric LMIs (for LTV/LPV), infinite-dimensional LPs (for positive/special structure), or small-gain inequalities (for compositional analysis, e.g., MATI, PT-ISS).**

4. **For dwell- or sampling-interval-dependent properties, search over interval parameter (e.g., $\tau$) to maximize allowable interval or minimize conservative gain (supremal $T^*$, maximal $h$, minimal $\gamma$).**

5. **Where needed, employ gridded parameterization, polynomial/SOS relaxation, or explicit worst-case system reduction for tractable convex optimization.**

6. **Apply controller synthesis extensions (e.g., clock-dependent gain-scheduled feedback, observer design) via augmented LMI/LP frameworks [2002.12102].**

## 7. Applications and Connections

PTI stability criteria have found application across domains:
- **Networked Control Systems (NCS):** Sampling- and transmission-interval stability (MATI) under UGES protocols, with explicit computation for RR, TOD [1604.04421].
- **Switched and Impulsive Systems:** Dwell-time constrained stability and $L_1/\ell_1$ performance for uncertain, positive, or delayed systems [1802.00346].
- **Delayed, LPV, and Sampled Systems:** Clock/Krasovskii-based dwell-time LMI analysis and gain-scheduling synthesis [2002.12102].
- **Prescribed-Time Stabilization:** Uniform convergence or ISS by any $T>0$ for nonlinear, interconnected systems with polynomial-type time warping [2405.00224].
- **Stroboscopic/Torus Invariant Analysis:** Set-based explicit invariant “tubes” for periodic/parametric ODEs, certifying interval invariance and limit-cycle capture [2012.09310].
- **Biological/Physiological Time Intervals:** The concept of “Physiological Temperature Interval” (PTI) formalizes critical maintenance intervals in biological systems directly in terms of molecular and thermodynamic bounds [1307.7295].

---

Time-interval stability thus forms an essential conceptual and computational backbone for finite-horizon analysis of deterministic, switched, sampled, delayed, and networked systems—enabling robust certification and synthesis when only interval-wise, rather than asymptotic, properties are meaningful or achievable. Each instantiation—MATI, IO-FTS, PT-ISS, dwell-time—translates infinite-horizon stability analogues into explicit, quantifiable, algorithmically tractable finite-time regimes. 

**References**: [1604.04421], [1107.5968], [2405.00224], [1802.00346], [2002.12102], [2012.09310], [1307.7295]

Source: https://www.emergentmind.com/topics/time-interval-stability-pti