A Set‐Based Planning Methodology to Plan and Execute Dynamic Verification Strategies Under Knowable Uncertainty

ABSTRACT In current practice, a verification strategy (VS) is planned by considering various uncertainties at the beginning of a development program. All relevant uncertainties are expected to be calibrated to facilitate the evaluation of the planned verification strategies. However, not all calibration information about uncertainties may be available at the beginning and some additional activities to discover unknown uncertainties may be necessary. This paper presents a set‐based planning (SBP) methodology for designing and executing system verification strategies under knowable uncertainty (KU). Building on a Bayesian network model of verification and correction activities (CAs), we introduce preparation activities that quantify KU, enabling dynamic planning as new information becomes available. Using a notional satellite communication instrument as a case study, we compare SBP against traditional static planning across scenarios with varying estimation errors in likelihood ratio (LR) values. Results show that SBP consistently achieves higher expected values, with substantial gains when CAs have low success rates. The findings provide practical guidance on when dynamic verification planning yields value and lay the groundwork for extensions to broader classes of uncertainty.

Authors

Institutions

Publication Details

Journal
Systems Engineering
Published
2026-02-16
DOI
https://doi.org/10.1002/sys.70048
Primary Topic
Systems Engineering Methodologies and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Set‐Based Planning Methodology to Plan and Execute Dynamic Verification Strategies Under Knowable Uncertainty

Alejandro Iván Aguirre Salado, Peng Xu
Systems Engineering
Systems Engineering Methodologies and Applications
article

A Set‐Based Planning Methodology to Plan and Execute Dynamic Verification Strategies Under Knowable Uncertainty

Alejandro Iván Aguirre Salado, Peng Xu
article en

Abstract

ABSTRACT In current practice, a verification strategy (VS) is planned by considering various uncertainties at the beginning of a development program. All relevant uncertainties are expected to be calibrated to facilitate the evaluation of the planned verification strategies. However, not all calibration information about uncertainties may be available at the beginning and some additional activities to discover unknown uncertainties may be necessary. This paper presents a set‐based planning (SBP) methodology for designing and executing system verification strategies under knowable uncertainty (KU). Building on a Bayesian network model of verification and correction activities (CAs), we introduce preparation activities that quantify KU, enabling dynamic planning as new information becomes available. Using a notional satellite communication instrument as a case study, we compare SBP against traditional static planning across scenarios with varying estimation errors in likelihood ratio (LR) values. Results show that SBP consistently achieves higher expected values, with substantial gains when CAs have low success rates. The findings provide practical guidance on when dynamic verification planning yields value and lay the groundwork for extensions to broader classes of uncertainty.

Systems Engineering
University of Arizona (US)
Openalex Percentile: Top 54%
Systems Engineering Methodologies and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.