Probabilistic NetKAT
DOI10.1007/978-3-662-49498-1_12zbMATH Open1335.68027OpenAlexW2913846715MaRDI QIDQ2802486FDOQ2802486
Authors: Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt, Alexandra Silva 
Publication date: 26 April 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49498-1_12
Recommendations
- Probabilistic networks
- scientific article; zbMATH DE number 795219
- Netter: probabilistic, stateful network models
- Probabilistic TCP-net
- scientific article; zbMATH DE number 1822433
- scientific article; zbMATH DE number 1754158
- A probabilistic analysis of Kademlia networks
- Probabilistic network values
- scientific article; zbMATH DE number 4037218
Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- Netkat, semantic foundations for networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bisimulation for labelled Markov processes
- Semantic domains for combining probability and non-determinism
- Title not available (Why is that?)
- Bisimulation through probabilistic testing
- Title not available (Why is that?)
- Metrics for labelled Markov processes
- A probabilistic PDL
- Symbolic model checking for probabilistic timed automata
- Taking it to the limit: approximate reasoning for Markov processes
- A calculus for network delay. I. Network elements in isolation
- Labelled Markov processes.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stochastic Relations
- Distributing probability over non-determinism
- Probability and Nondeterminism in Operational Models of Concurrency
- Title not available (Why is that?)
- Abstraction, Refinement and Proof for Probabilistic Systems
- Semantics of probabilistic programs
- Network calculus. A theory of deterministic queueing systems for the Internet
- A Scheme for Fast Parallel Communication
- Using probabilistic Kleene algebra pKA for protocol verification
- Strong completeness for Markovian logics
- A coalgebraic decision procedure for NetKAT
- A fast compiler for NetKAT
- Probabilistic NetKAT
- Conditioning in probabilistic programming
- Frenetic: a network programming language
- Measure transformer semantics for Bayesian machine learning
Cited In (22)
- Probabilistic divide \& congruence: branching bisimilarity
- A semantics and a logic for \textit{Fuzzy Arden Syntax}
- Undecidable Problems for Probabilistic Network Programming
- Towards an analysis of dynamic gossip in Net\textsc{kat}
- Netter: probabilistic, stateful network models
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- On the hardness of analyzing probabilistic programs
- On Lexicographic Proof Rules for Probabilistic Termination
- Borel kernels and their approximation, categorically
- Frenetic: a network programming language
- Probabilistic NetKAT
- Equational theories of abnormal termination based on Kleene algebra
- On lexicographic proof rules for probabilistic termination
- DyNetKAT: an algebra of dynamic networks
- Resilient capacity-aware routing
- Cantor meets Scott: semantic foundations for probabilistic networks
- Title not available (Why is that?)
- A fast compiler for NetKAT
- A complete inference system for skip-free guarded Kleene algebra with tests
- Netkat, semantic foundations for networks
- NetKAT -- a formal system for the verification of networks
- Deciding fast termination for probabilistic VASS with nondeterminism
Uses Software
This page was built for publication: Probabilistic NetKAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802486)
