SoK: Semantic Decision Engines in Network Control Loops
The paper says control-loop claims for semantic decision engines are rarely backed by deadline measurements.
The authors systematize 139 paper families by interface, execution path, and who owns checks. Of 50 families claiming fit for a control loop or time budget, only four provide matched measurement, and only four of all 139 report deadline attainment. The unsupported gap is sharpest in 72 families without a deterministic computation step. Their bounded tests show queuing and coverage choices can flip whether an engine should be admitted. HF Daily Papers' note
The authors systematize 139 paper families by interface, execution path, and who owns checks. Of 50 families claiming fit for a control loop or time budget, only four provide matched measurement, and only four of all 139 report deadline attainment. The unsupported gap is sharpest in 72 families without a deterministic computation step. Their bounded tests show queuing and coverage choices can flip whether an engine should be admitted. HF Daily Papers' note
score 4