The following pages link to Probabilistic NetKAT (Q2802486):
Displaying 16 items.
- Towards an analysis of dynamic gossip in Net\textsc{kat} (Q1617832) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
- Resilient capacity-aware routing (Q2044217) (← links)
- A semantics and a logic for \textit{Fuzzy Arden Syntax} (Q2099984) (← links)
- Borel kernels and their approximation, categorically (Q2134827) (← links)
- Netter: probabilistic, stateful network models (Q2234099) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- A fast compiler for NetKAT (Q2981979) (← links)
- Equational Theories of Abnormal Termination Based on Kleene Algebra (Q2988362) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Undecidable Problems for Probabilistic Network Programming (Q5111285) (← links)
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (Q6487312) (← links)
- On Lexicographic Proof Rules for Probabilistic Termination (Q6488476) (← links)
- A complete inference system for skip-free guarded Kleene algebra with tests (Q6535242) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
