Coalgebraic tools for randomness-conserving protocols
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 state and...
Saved in:
Published in | Journal of logical and algebraic methods in programming Vol. 125; p. 100734 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier Inc
01.02.2022
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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 state and loss of entropy. We show how to use these tools to construct various entropy-conserving reductions between processes. |
---|---|
ISSN: | 2352-2208 |
DOI: | 10.1016/j.jlamp.2021.100734 |