A theory of conjunction and concurrency

TL;DR: A lattice-theoretic fixed-point theorem about increasing functions is proved, and examples of its application in several areas of computing science are given.

Abstract: Some general conditions under which the specification of a concurrent system can be expressed as the conjunction of specifications for its component processes are explored. A lattice-theoretic fixed-point theorem about increasing functions is proved, and examples of its application in several areas of computing science are given. Some consequences are drawn for the design of concurrent algorithms, high-level programming languages, and fine-grained concurrent computer architectures. >