Probabilistic NetKAT
From MaRDI portal
Publication:2802486
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
Cites work
- scientific article; zbMATH DE number 4004523 (Why is no real title available?)
- scientific article; zbMATH DE number 3538576 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1927574 (Why is no real title available?)
- scientific article; zbMATH DE number 794262 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
- A Scheme for Fast Parallel Communication
- A calculus for network delay. I. Network elements in isolation
- A coalgebraic decision procedure for NetKAT
- A fast compiler for NetKAT
- A probabilistic PDL
- Abstraction, Refinement and Proof for Probabilistic Systems
- Bisimulation for labelled Markov processes
- Bisimulation through probabilistic testing
- Conditioning in probabilistic programming
- Distributing probability over non-determinism
- Frenetic: a network programming language
- Labelled Markov processes.
- Measure transformer semantics for Bayesian machine learning
- Metrics for labelled Markov processes
- Netkat, semantic foundations for networks
- Network calculus. A theory of deterministic queueing systems for the Internet
- Probabilistic NetKAT
- Probability and Nondeterminism in Operational Models of Concurrency
- Semantic domains for combining probability and non-determinism
- Semantics of probabilistic programs
- Stochastic Relations
- Strong completeness for Markovian logics
- Symbolic model checking for probabilistic timed automata
- Taking it to the limit: approximate reasoning for Markov processes
- Using probabilistic Kleene algebra pKA for protocol verification
Cited in
(23)- A fast compiler for NetKAT
- Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
- Netter: probabilistic, stateful network models
- DyNetKAT: an algebra of dynamic networks
- Resilient capacity-aware routing
- Deciding fast termination for probabilistic VASS with nondeterminism
- On lexicographic proof rules for probabilistic termination
- Netkat, semantic foundations for networks
- Probabilistic NetKAT
- NetKAT -- a formal system for the verification of networks
- Borel kernels and their approximation, categorically
- scientific article; zbMATH DE number 2242605 (Why is no real title available?)
- Probabilistic divide \& congruence: branching bisimilarity
- Towards an analysis of dynamic gossip in Net\textsc{kat}
- A complete inference system for skip-free guarded Kleene algebra with tests
- Equational theories of abnormal termination based on Kleene algebra
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- Cantor meets Scott: semantic foundations for probabilistic networks
- A semantics and a logic for \textit{Fuzzy Arden Syntax}
- Undecidable Problems for Probabilistic Network Programming
- On Lexicographic Proof Rules for Probabilistic Termination
- On the hardness of analyzing probabilistic programs
- Frenetic: a network programming language
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)