Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras

Michael R Laurence, Georg Struth

Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered. A term $t$ using t…