Smolka, S;
Kumar, P;
Foster, N;
Kozen, D;
Silva, A;
(2017)
Cantor meets Scott: semantic foundations for probabilistic networks.
ACM SIGPLAN Notices - POPL '17
, 52
(1)
pp. 557-571.
10.1145/3093333.3009843.
Preview |
Text
Silva_Cantor meets Scott. Semantic foundations for probabilistic networks_AAM.pdf - Accepted Version Download (2MB) | Preview |
Abstract
ProbNetKAT is a probabilistic extension of NetKAT with a denotational semantics based on Markov kernels. The language is expressive enough to generate continuous distributions, which raises the question of how to compute effectively in the language. This paper gives an new characterization of ProbNetKAT’s semantics using domain theory, which provides the foundation needed to build a practical implementation. We show how to use the semantics to approximate the behavior of arbitrary ProbNetKAT programs using distributions with finite support. We develop a prototype implementation and show how to use it to solve a variety of problems including characterizing the expected congestion induced by different routing schemes and reasoning probabilistically about reachability in a network.
| Type: | Article |
|---|---|
| Title: | Cantor meets Scott: semantic foundations for probabilistic networks |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1145/3093333.3009843 |
| Publisher version: | https://doi.org/10.1145/3093333.3009843 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10085265 |
Loading...
Loading...Loading...Loading...Archive Staff Only
 |
View Item |
