Finite-Time Safety Probability Analysis

• Finite-Time Safety Probability is a measure that evaluates the likelihood a stochastic system remains within a designated safe state over a fixed time interval under uncertainty.
• It employs mathematical tools such as barrier certificates, stochastic control barrier functions, and dynamic programming to derive explicit probabilistic safety bounds.
• These frameworks inform safety-critical controller synthesis, providing noise-aware and tighter guarantees in applications ranging from robotics to infrastructure systems.

A finite-time safety probability quantifies the likelihood that a stochastic system, subject to random disturbances and potentially controlled inputs, remains within a designated safe region of its state space over a fixed time horizon. This probabilistic guarantee is a central object in modern safety-verification and safe control design for stochastic and safety-critical systems, as it reflects the system's risk profile under uncertainty over operationally relevant time intervals. Finite-time safety analysis is formalized through various frameworks, including barrier certificates, stochastic @@@@1@@@@, dynamic programming, and partial differential equation methods, each tailored to discrete- or continuous-time dynamics, with or without control synthesis objectives.

1. Mathematical Formulation of Finite-Time Safety Probability

Consider a stochastic system evolving in discrete or continuous time. For continuous-time systems, the state $x_t \in \mathbb{R}^n$ typically evolves according to an Itô SDE: $dx_t = f(x_t)\,dt + g(x_t)\,dW_t + h(x_t)\,u_t\,dt$ where $f$ is the drift, $g$ the diffusion matrix, $W_t$ is a Wiener process, $h$ the control input matrix, and $u_t$ the control input. For discrete-time systems: $x_{k+1} = f(x_k, w_k)$ with $w_k$ an i.i.d. disturbance.

Given a safe set $S \subset \mathbb{R}^n$, the finite-time safety probability is defined as

$$P_{\text{safe}}(x_0; T) := \mathbb{P}_{x_0}\bigl\{ x_t \in S\ \forall\, t \in [0, T] \bigr\}$$

where, for discrete time, $t$ is replaced by $k$ and $[0,T]$ by $\{0,\dots,N\}$. Other formulations (e.g., recovery or reach-avoid probability) are analogous but adjust the safe/target sets and temporal conditions (Santoyo et al., 2019, Black et al., 2023, Xue, 2024, Mestres et al., 1 Oct 2025).

The event of interest is the invariance: that the state never leaves $S$ over the finite horizon. The probability is often equivalently characterized as $1 - P(\tau \leq T)$ with $\tau = \inf\{t \geq 0 : x_t \notin S\}$ the first-exit time from the safe set.

2. Barrier Certificate Approaches for Probabilistic Guarantees

Barrier functions offer a systematic machinery for stochastic safety analysis. Let $B : \mathbb{R}^n \to \mathbb{R}$ be a twice-differentiable function with level sets encoding the safe and unsafe regions (e.g., $S = \{x\, |\, B(x) \leq 1\}$). The main concept is to relate the evolution of $B(x_t)$ to the likelihood of safety-violation events.

For continuous-time systems, the infinitesimal generator $\mathcal{L}$ applied to $B$ at point $x$ is

$$\mathcal{L}B(x) = \nabla B(x)^\intercal f(x) + \tfrac{1}{2}\operatorname{Tr}\bigl( g(x)g(x)^\intercal \nabla^2 B(x) \bigr) + \nabla B(x)^\intercal h(x)u(x)$$

A stochastic barrier function $B$ serves as a certificate for finite-time safety if, inside the safe set, it satisfies: $$\mathcal{L} B(x) \leq -\alpha B(x) + \beta \quad \text{for } x \in S$$ with $\alpha\geq 0,\, \beta \geq 0$, alongside boundary conditions:

• $B(x)\geq 0$ (nonnegativity)
• $B(x)\leq\gamma<1$ on initial states $x_0 \in S$ (small sublevel)
• $B(x)\geq 1$ on the unsafe boundary $\partial S$.

Analogously, in discrete time, for $v(x)$: $$\mathbb{E}[v(x_{k+1}) | x_k=x] \leq v(x)/\alpha + \beta$$ with similar boundary conditions (Xue, 2024, Mestres et al., 1 Oct 2025). The resulting certificates are often constructed as polynomials using sum-of-squares (SOS) optimization subject to polynomial set descriptions, yielding computationally tractable SDP formulations.

3. Quantitative Safety Bounds and Tightness

Given the above certificate conditions, explicit upper bounds on the finite-time safety violation probability are derived via martingale inequalities and dynamic programming arguments. For the basic continuous-time formulation with barrier function $B$, three cases are prominent (Santoyo et al., 2019, Black et al., 2023):

• $\alpha > 0$, $\beta/\alpha < 1$:

$P\{\tau \leq T\} \leq 1 - (1 - B(x_0))e^{-\beta T}$

• $\alpha > 0$, $\beta/\alpha \geq 1$:

$$P\{\tau \leq T\} \leq \frac{B(x_0) + (e^{\beta T} - 1)\beta/\alpha}{e^{\beta T}}$$

• $\alpha = 0$:

$P\{\tau \leq T\} \leq B(x_0) + \beta T$

Recent developments have introduced risk-aware control barrier functions (RA-CBF) exploiting stochastic level-crossing results to produce even tighter, noise-aware upper bounds, such as

$$P(\tau \leq T) \leq 1 - \operatorname{erf}\left( \frac{1-\gamma}{\sqrt{2}\,\eta\,T} \right)$$

where $\eta$ is a bound on the noise-gain, rendering the bound explicit in the noise strength and provably tighter than classical bounds in many regimes (Black et al., 2023).

For discrete time, the bound for a candidate barrier $v$ and $N$ steps, with $\alpha\in(0,1]$ and $\beta\leq 1$, is: $$P_{\text{safe}}(x_0;N) \leq U_N(x_0) := \alpha^{-N} v(x_0) + [\alpha\beta/(\alpha - 1)](1 - \alpha^{-N})$$ (Xue, 2024).

Extensions to lower bounds for safety, and both upper and lower bounds for reach-avoid problems, are established through sign-reversing variations of the barrier conditions (Xue, 2024, Xue et al., 23 Sep 2025).

4. Computational and Optimization Techniques

The search for suitable barrier certificates is typically cast as a nonconvex optimization over polynomial functions constrained by sum-of-squares positivity on semialgebraic sets. For continuous-time SDEs, the problem takes the form:

• Find $B(x)$ polynomial, minimize (proxy for safety violation probability), subject to:
  • $B(x)\geq 0$ on $S$
  • $B(x)\leq \gamma$ on initial set
  • $B(x) \geq 1$ on unsafe set
  • $\mathcal{L} B(x) \leq -\alpha B(x) + \beta$ on $S$ (Santoyo et al., 2019, Santoyo et al., 2019)
• For discrete time, analogous conditions hold with appropriate expectation operators (Xue, 2024, Mestres et al., 1 Oct 2025).

Key practical limitations include scalability to high-dimensional state spaces (the degree and the number of variables in the SDP), and the trade-off between tightness of bounds and computational tractability. Recent advancements have removed the boundedness requirement on the auxiliary barrier function, thus enabling the use of unbounded polynomial templates over unbounded safe sets and expanding applicability (Xue et al., 23 Sep 2025).

Alternative numerical methods employ partial differential equations (Fokker–Planck or backward Kolmogorov equations) or dynamic programming recursions for finite-horizon verification, recovery, and risk-sensitive (e.g., CVaR) safety analysis (Chern et al., 2021, Chapman et al., 2019).

5. Control Synthesis for Prescribed Safety Probabilities

Synthesizing controllers that ensure finite-time safety with prescribed risk levels includes:

• Joint optimization over the barrier function and the feedback law for systems affine in control. Typical parameterizations are polynomial or quadratic-in-monomials feedbacks, with regularization to avoid unbounded control (Santoyo et al., 2019, Santoyo et al., 2019).
• Convex quadratic-program (QP)-based formulations, particularly with RA-CBF constraints or probabilistic control barrier functions (pCBF), enable real-time implementation. The control law is selected to satisfy the barrier constraint at each time step, optionally minimizing a nominal cost subject to the risk-level requirement (Black et al., 2023, Mestres et al., 1 Oct 2025, Wang et al., 2021).

For discrete-time settings, pCBFs guarantee that by ensuring a per-step safety condition with failure rate $\delta$, the long-horizon safety is at least $(1-\delta)^H$ over $H$ steps; the system designer can solve for $\delta$ to meet a global reliability requirement (Mestres et al., 1 Oct 2025). Methods include distribution-aware, moment-based, and data-driven conditions (e.g., scenario optimization, conformal prediction, concentration inequalities), making the constraints computationally tractable for realistic scenarios.

6. Extensions, Applications, and Empirical Benchmarks

Finite-time safety probability analysis underpins the design and verification of safety-critical autonomous systems, robotics, and infrastructure control. Methods are directly applied in areas such as:

• Mobile robot safety and highway merging under noise (Black et al., 2023)
• Population growth, oscillators, and ecological models (Feng et al., 2020)
• Discrete-time reach-avoid problems for risk-sensitive design (via CVaR metrics) (Chapman et al., 2019)
• Learning algorithms with safety guarantees in unknown environments, e.g., parallel sequential probability ratio test methods for multi-armed bandits (Castellano et al., 2020).

Empirical benchmarks, including high-dimensional systems and real hardware (e.g., quadruped robots traversing stochastic terrain), validate the tightness of theoretical bounds. Case studies serve as testbeds for comparisons between classical martingale, barrier-based, and risk-aware methodologies, revealing that the latter consistently yield less conservative, noise-adaptive finite-time safety probabilities (Black et al., 2023, Mestres et al., 1 Oct 2025).

7. Theoretical and Practical Implications

Finite-time safety probability frameworks have clarified the limitations of myopic, stepwise safety analysis, showing the necessity of global (finite-horizon) approaches to prevent risk accumulation. The theoretical infrastructure provided by barrier certificates, RA-CBFs, and their discrete-time generalizations forms the backbone of certified stochastic safe control (Santoyo et al., 2019, Xue, 2024).

Removal of boundedness assumptions on barrier certificates (Xue et al., 23 Sep 2025) and development of refined dynamic-programming recursions for risk-sensitive reachability (Chapman et al., 2019) have enhanced both the expressive power and computational feasibility of the methodology.

A plausible implication is that as system complexity and uncertainty dimensions increase, scalable, noise-aware, and optimally-tuned finite-time safety certification—incorporating both tight upper and lower probabilistic bounds—will become integral to the deployment of safety-critical stochastic systems in practice.