Probabilistic NetKAT
From MaRDI portal
Publication:2802486
DOI10.1007/978-3-662-49498-1_12zbMath1335.68027OpenAlexW2913846715MaRDI QIDQ2802486
Alexandra Silva, Dexter Kozen, Mark Reitblatt, Nate Foster, Konstantinos Mamouras
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
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (11)
Borel kernels and their approximation, categorically ⋮ DyNetKAT: an algebra of dynamic networks ⋮ Equational Theories of Abnormal Termination Based on Kleene Algebra ⋮ Deciding Fast Termination for Probabilistic VASS with Nondeterminism ⋮ On the hardness of analyzing probabilistic programs ⋮ Netter: probabilistic, stateful network models ⋮ Probabilistic divide \& congruence: branching bisimilarity ⋮ Probabilistic NetKAT ⋮ Resilient capacity-aware routing ⋮ Undecidable Problems for Probabilistic Network Programming ⋮ A semantics and a logic for \textit{Fuzzy Arden Syntax}
Uses Software
Cites Work
- Semantic domains for combining probability and non-determinism
- Metrics for labelled Markov processes
- Using probabilistic Kleene algebra pKA for protocol verification
- A probabilistic PDL
- Semantics of probabilistic programs
- Bisimulation through probabilistic testing
- Symbolic model checking for probabilistic timed automata
- Bisimulation for labelled Markov processes
- Probabilistic NetKAT
- A Coalgebraic Decision Procedure for NetKAT
- Strong Completeness for Markovian Logics
- Taking It to the Limit: Approximate Reasoning for Markov Processes
- A fast compiler for NetKAT
- A calculus for network delay. I. Network elements in isolation
- A Scheme for Fast Parallel Communication
- Abstraction, Refinement and Proof for Probabilistic Systems
- Frenetic
- Stochastic Relations
- NetKAT
- Distributing probability over non-determinism
- Probability and Nondeterminism in Operational Models of Concurrency
- Measure Transformer Semantics for Bayesian Machine Learning
- Network calculus. A theory of deterministic queueing systems for the Internet
- Conditioning in probabilistic programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Probabilistic NetKAT