Coalgebraic Tools for Randomness-Conserving Protocols

07/08/2018
by   Dexter Kozen, et al.
0

We propose a coalgebraic model for constructing and reasoning about state-based protocols that implement efficient reductions among random processes. We provide basic tools that allow efficient protocols to be constructed in a compositional way and analyzed in terms of the tradeoff between latency and loss of entropy. We show how to use these tools to construct various entropy-conserving reductions between processes.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset