Distributed Algorithms Contents Index

Review: Sequential Programming

This chapter is a brief review of nondeterministic iteration , predicates, Hoare triples , invariant and stable predicates, and the use of variant functions (also called loop variants) in proving termination of loops . We use these concepts in designing both sequential and distributed algorithms.

K. Mani Chandy, Emeritus Simon Ramo Professor, California Institute of Technology