一句话：提出参数化于半环的加权 NetKAT 语言，并借助加权自动机实现对定量网络性质的自动判定。
网络验证常需处理带宽、延迟、概率等定量性质，而既有 NetKAT 类语言主要支持布尔式的可达性与安全性推理。本文提出加权 NetKAT，一个以半环为参数的领域特定语言，可在统一框架下刻画多种定量语义。作者给出其指称语义以及与之等价的操作语义，后者基于新提出的加权 NetKAT 自动机（WNKA），用于捕获语言的有状态行为。借助 WNKA，作者得到一族通用判定过程，即使存在可能无界的迭代，也能全自动地推理定量安全性与可达性。最后以 Internet2 的 Abilene 网络为底层拓扑开展案例研究，说明该框架的可用性。
We introduce weighted NetKAT, a domain-specific language for modeling and verifying quantitative network properties. The language is parametric on a semiring, enabling the treatment of a wide range of quantities in a uniform way. We provide a denotational semantics and an equivalent operational semantics, the latter based on a novel model of weighted NetKAT automata (WNKA) capturing the stateful behavior of our language. With WNKA, we obtain a class of generic decision procedures for reasoning about quantitative safety and reachability in a fully automatic way, even in the presence of possibly unbounded iteration. We demonstrate the applicability of our framework in a case study using Internet2's Abilene network as the underlying topology.
@article{paperbot3760,
title = {Weighted NetKAT: A Programming Language for Quantitative Network Verification},
author = {Emmanuel Suárez Acevedo and Tiago Ferreira and Kevin Batz and Oliver Bøving and Nate Foster and Alexandra Silva},
journal = {Proceedings of the ACM on Programming Languages},
volume = {10},
number = {PLDI},
year = {2026},
doi = {10.1145/3808318}
}