An account of the basic theory of confluence in the 7r-calculus is presented, techniques for showing confluence of mobile systems are given, and the utility of some of the theory presented is illustrated via an analysis ...

Transformation rules which increase the scope for concurrent activity within systems prescribed by programs of concurrent object languages are given. The correctness of the rules is proved using a semantic definition by ...

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 ...

An extension to the theory of partial confluence of concurrent systems is presented in the setting of the polyadic π-calculus. The main result, expressed in terms of client-server systems, is that in certain client contexts, ...