The boolean algebra of cubical areas as a tensor product in the category of semilattices with zero

Research output: Contribution to journalConference articlepeer-review

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.

Original languageEnglish
Pages (from-to)60-66
Number of pages7
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume166
DOIs
Publication statusPublished - 26 Oct 2014
Externally publishedYes
Event7th Interaction and Concurrency Experience, ICE 2014 - Berlin, Germany
Duration: 6 Jun 2014 → …

Fingerprint

Dive into the research topics of 'The boolean algebra of cubical areas as a tensor product in the category of semilattices with zero'. Together they form a unique fingerprint.

Cite this