We derive new cut-set bounds on the achievable rates in a general multi-terminal network with finite number of states. Multiple states are common in communication networks in the form of multiple channel and nodes’ states. Our results are broadly applicable and provide much tighter upper bounds than the known single state min-cut max-flow theorem, and hence form an important new tool to bound t...

We present a novel approach to semisupervised learning which is based on statistical physics. Most of the former work in the field of semi-supervised learning classifies the points by minimizing a certain energy function, which corresponds to a minimal k-way cut solution. In contrast to these methods, we estimate the distribution of classifications, instead of the sole minimal k-way cut, which ...

We introduce two new major features of the open-source model checker Kind 2 which provide traceability information between specification and design elements such as assumptions, guarantees, or other behavioral constraints in synchronous reactive system models. This version can identify minimal sets elements, known Minimal Inductive Validity Cores, are sufficient to prove a given set safety prop...