Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra

Paul Brunet (1) , David Pym (1)

1 UCL-CS - Department Computer Science [London]

Concurrent Kleene Algebra is an elegant tool for equational reasoning about concurrent programs. An important feature of concurrent programs that is missing from CKA is the ability to restrict legal interleavings. To remedy this we extend the standard model of CKA, namely pomsets, with a new feature, called boxes, which can specify that part of the system is protect from outside interference. We study the algebraic properties of this new model. Another drawback of CKA is that the language used for expressing properties of programs is the same as that which is used to express programs themselves. This is often too restrictive for practical purposes. We provide a logic, 'pomset logic', that is an assertion language for specifying such properties, and which is interpreted on pomsets with boxes. We develop the basic metatheory for the relationship between pomset logic and CKA and illustrate this relationship with simple examples.

Domaines: Catégories et ensembles [math.CT]; Logique en informatique [cs.LO]; Théorie et langage formel [cs.FL]

Paul Brunet, David Pym. Pomsets with Boxes: Protection, Separation, and Locality in Concurrent Kleene Algebra. 2019. ⟨hal-02337757v1⟩