A Process-Calculus Analysis of Concurrent Operations on B-Trees

Abstract

A general theory of interactive systems with changing structure, the π-calculus, is used to study concurrent operations on a variant of the B-tree. An improved algorithm for compression of the data structure is given. Some general results on partially confluent processes and on client-server systems, couched in the π-calculus, are presented.