SoK：网络控制回路中的语义决策引擎
SoK: Semantic Decision Engines in Network Control Loops
浏览论文内容
中文总结 AI 辅助
本文系统化分析139个语义决策引擎论文族，指出其声称适配控制回路但缺乏测量支持，提出最低报告记录、设计规则及研究议程。
中文摘要 AI 辅助
语义决策引擎（如 Jev）可能返回有效答案，但仍会错过网络截止时间、选择不可行的动作或使服务未经验证。我们通过决策接口、执行路径和检查所有权对139个论文族进行了系统化分类。其中50个论文族声称其引擎适合控制回路或时间预算，但只有4个通过匹配的测量支持这一声明。在所有139个中，有4个报告了截止时间达成率。差距集中在决策没有确定性计算步骤的地方。这72个论文族提出了22项声明，均未得到支持，且仅在2个中指定了覆盖所有者。在单一事件模型下的有界测试表明，每个差距都可能逆转准入判决。一个满足每个孤立请求10秒预算的决策，在决策排队于重放执行时间之前时，对任何请求都无法满足。同一引擎通过一项覆盖检查，却未能通过另一项。我们推导出最低报告记录、设计规则以及将决策引擎纳入控制回路的研究议程。
英文摘要
A semantic decision engine such as Jev can return a valid answer and still miss a network deadline, select an infeasible action or leave the service unverified. We systematize 139 paper families by decision interface, execution path and check ownership. Fifty families claim that their engine fits a control loop or time budget, but only four support the claim with matched measurement. Across all 139, four report deadline attainment. The gap concentrates where the decision has no deterministic computation step. Those 72 families make 22 of the claims, none supported, and name a coverage owner in only two. Bounded tests under one event model show that each gap can reverse an admission verdict. A decision that meets a 10 s budget for every isolated request meets it for none once decisions queue ahead of replayed execution times. The same engine passes one coverage check and fails another. We derive a minimum reporting record, design rules and a research agenda for admitting decision engines to control loops.
发表机构
- University of Technology Sydney（悉尼科技大学）
机构由 AI 辅助整理，请以论文原文为准。
