Weighted NetKAT: A Programming Language For Quantitative Network Verification
summary
Weighted NetKAT extends NetKAT to be parametric on a semiring and provides both denotational and operational semantics plus a compiler that turns programs into WNKA automata, proving semantic equivalence. Decision procedures check quantitative safety (e.g., all deliveries ≥ 90%) and reachability (e.g., exists delivery ≤ 5 ms) even with unbounded iteration, returning counterexample or witness traces. The framework requires omega‑continuous semirings and supports analyses like latency with the tropical semiring and reliability with the Viterbi semiring, demonstrated on Internet2 Abilene.
AI-written summary · about