The boolean algebra of cubical areas as a tensor product in the category of semilattices with zero
Abstract
In this paper we describe a model of concurrency enjoying an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with neither loops nor branchings. Such programs are given a semantics using cubical areas that we call geometric. The collection of all cubical areas admits a structure of tensor product in the category of semi-lattice with zero. These results naturally extend to fully fledged concurrent programs up to some technical tricks.