Struct DetectabilityBound 

pub struct DetectabilityBound {
    pub delta_0: f32,
    pub alpha: f32,
    pub kappa: f32,
    pub tau_upper: Option<f32>,
    pub bound_satisfied: Option<bool>,
}

Deterministic detectability upper bound τ_upper.

Computes the latency upper bound from DSFB-Lattice Theorem 1:

τ_upper = δ₀ / (α − κ)   iff α > κ

Returns None if α ≤ κ (divergence rate does not exceed noise floor).

Fields

delta_0: f32

Initial offset δ₀ = ‖r_initial‖ from nominal.

alpha: f32

Observed divergence rate α (from Lyapunov λ or empirical slew rate).

kappa: f32

Noise-floor rate κ.

tau_upper: Option<f32>

Computed bound τ_upper (sample periods). None if α ≤ κ.

bound_satisfied: Option<bool>

Whether observed crossing time t_cross ≤ τ_upper + ε.

Implementations

impl DetectabilityBound

pub fn compute(delta_0: f32, alpha: f32, kappa: f32) -> Self

Compute the τ_upper bound given δ₀, α, κ.

pub fn validate_crossing(&mut self, t_cross: f32, epsilon: f32)

Validate whether the observed crossing time satisfies the bound.

t_cross = number of samples from episode start to envelope crossing. epsilon = tolerance for sample-period quantisation (default: 1.0).

Trait Implementations

impl Clone for DetectabilityBound

fn clone(&self) -> DetectabilityBound

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for DetectabilityBound

impl Debug for DetectabilityBound

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for DetectabilityBound

fn eq(&self, other: &DetectabilityBound) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for DetectabilityBound