The Boolean Algebra of Cubical Areas as a Tensor Product in the Category of Semilattices with Zero

Nicolas Ninin
(CEA, LIST and University Paris-Sud, France)
Emmanuel Haucourt
(CEA, LIST)

In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such programs are given a semantics using cubical areas. Such a semantics is said to be geometric. The collection of all these cubical areas enjoys 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.

In Ivan Lanese, Alberto Lluch Lafuente, Ana Sokolova and Hugo Torres Vieira: Proceedings 7th Interaction and Concurrency Experience (ICE 2014), Berlin, Germany, 6th June 2014, Electronic Proceedings in Theoretical Computer Science 166, pp. 60–66.
Published: 26th October 2014.

ArXived at: https://dx.doi.org/10.4204/EPTCS.166.7 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org