Search arXiv⌕ Search

arXiv · 2610.02424

Towards a Theory of Quantitative Vulnerability Analysis for Engineering Systems

Abstract

Since the 1980s, risk analysis for engineering systems has been defined based on a tuple of scenarios, $\mathcal{S}$, likelihoods, $L$, and consequences, $C$, where $Risk = (\mathcal{S},L,C)$. We argue that equating this triplet with risk alone is insufficient and potentially misleading. Instead, we define this tuple as a vulnerability space $\mathcal{V} = (\mathcal{S},L,C)$, which becomes risk only when one makes specific interpretations of likelihood and consequence. Here, an interpretation has mathematical meaning, and defines a map that assigns data elements about system vulnerability to a perspective. Formally, we define a vulnerability perspective as a specific choice of interpretations of likelihood and consequence data that allows vulnerability analysis measures to be defined and analyzed. We argue that risk is only one of four common perspectives on $\mathcal{V}$ and demonstrate mathematically why each perspective should remain a distinct concept. First, we show how interpretation of $C$ as a set-valued function produces reliability measures, not risk measures. Then, we show how interpretation of $L$ via possibility theory will produce adversarial and safety measures distinct from risk. This new theoretical framework clarifies the conceptual, mathematical, and practical differences between risk, reliability, adversarial, and safety perspectives---four common engineering system analyses often conflated in the literature. A consequence of our theory is that no single perspective will reveal all vulnerabilities of an engineering system, suggesting decision-making via risk analysis may incur unavoidable and underappreciated tradeoffs from other vulnerability perspectives.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel A. Eisenberg, David L. Alderson. 2026-10-01. Towards a Theory of Quantitative Vulnerability Analysis for Engineering Systems. https://arxiv.org/abs/2610.02424

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

From Inference to Control: Structure-Guided Control of Hypergraph Dynamics

Controllability determines whether a system's state can be guided toward any desired configuration, making it a fundamental prerequisite for designing effective control strategies. In the context of networked systems, controllability is a well-established concept. However, many real-world systems, from biological collectives to engineered infrastructures, exhibit higher-order interactions that cannot be captured by simple graphs. Moreover, the interaction structures might be unknown and difficult to measure directly. Here, we close this gap by combining hypergraph inference with the identification of controllable nodes. Building on the inferred structure, we design a controller that, given a set of controllable nodes, steers the system toward a desired configuration. We formulate analytical controllability guarantees for polynomial systems. For non-polynomial dynamics on hypergraphs, we propose a heuristic method for identifying controllable nodes and validate the proposed approach using Kuramoto oscillators.

eess.SY↗

Input Dexterity and Output Negotiation in Feedback-Linearizable Nonlinear Systems

We introduce a task-relative taxonomy of actuator inputs for nonlinear systems within the input-output feedback-linearization framework. Given a flat output specifying the task, inputs are classified as essential, redundant, or dexterity: essential inputs are required for exact linearization, redundant inputs can be removed without effect, and dexterity inputs can be deactivated while preserving exact linearization of a reduced task. We show that a subset is dexterity if and only if, under a suitable dynamic prolongation, it can appear as additional output channels (flat-input complement) on a common validity set. Whenever a family of systems obtained by (de)activating dexterity inputs admits a common prolongation, the family can be interpreted as a single prolonged system endowed with different output selections. This enables a unified linearizing controller that negotiates between full and reduced tasks without transients on shared outputs under compatibility and dwell-time conditions. Simulations on a fully actuated aerial platform illustrate graceful task downgrades from six-dimensional pose tracking as lateral-force channels are deactivated.

eess.SY↗

Input-to-state stabilization of linear systems under data-rate constraints

We study feedback stabilization of linear systems under data-rate constraints in the presence of completely unknown disturbances. A communication and control strategy is proposed based on sampled and quantized state measurements, where the quantization range is dynamically adjusted using reachable-set approximations and a disturbance estimate derived from quantization parameters. The strategy alternates between stabilizing and searching stages to recapture the state after escapes from the quantization range. Under a data-rate condition, it guarantees input-to-state stability (ISS) with respect to the disturbance. An additional quantization symbol is introduced to establish ISS near the equilibrium. A simulation example illustrates the effectiveness of the proposed approach.

eess.SY↗