Much Ado About Nothing?

In our quest on formalizing distributed algorithms, notably one to solve Distributed Consensus, we have at first found it natural to describe the algorithm using an algebraic process calculus. However, both for the purpose of the mere description as well as for proving its correctness (i.e., its satisfaction of the required properties), process calculus technology has not (yet?) quite come out as the ideal tool to use. In this short paper, we try to point out why. In doing so, we try to hint at what we feel missing in currently existing algebraic process calculi and suggest what could or should be added in order to make them helpful tools for distributed algorithms proofs.