NetKAT的概率程序等价性
Probabilistic Program Equivalence for NetKAT
摘要:
我们解决的问题,决定是否两个概率程序是等价的概率NetKAT,一种形式语言,用于指定和推理的分组交换网络的行为。我们表明,这个问题是可判定的历史自由片段的语言开发一个有效的决策过程的基础上随机矩阵。主要的挑战在于推理迭代,我们通过设计一个编码的程序语义作为一个有限状态吸收马尔可夫链,其极限分布可以精确计算。在一个真实世界的数据中心网络的扩展案例研究中,我们通过分析马尔可夫链语义自动验证了各种感兴趣的定量属性,包括故障情况下的弹性。
英文摘要:
We tackle the problem of deciding whether two probabilistic programs are equivalent in Probabilistic NetKAT, a formal language for specifying and reasoning about the behavior of packet-switched networks. We show that the problem is decidable for the history-free fragment of the language by developing an effective decision procedure based on stochastic matrices. The main challenge lies in reasoning about iteration, which we address by designing an encoding of the program semantics as a finite-state absorbing Markov chain, whose limiting distribution can be computed exactly. In an extended case study on a real-world data center network, we automatically verify various quantitative properties of interest, including resilience in the presence of failures, by analyzing the Markov chain semantics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。