Pomsets are a model of concurrent computations introduced by Pratt. We adopt pomsets as a syntax-oblivious specification model of distributed systems where coordination happens via asynchronous message-passing.

In this paper, we study conditions that ensure a specification expressed as a set of pomsets can be faithfully realised via communicating automata. Our main contributions are (i) the definition of a realisability condition accounting for termination soundness, (ii) conditions accounting for ‘‘multi-threaded’’ participants, and (iii) an algorithm to check our realisability conditions directly over pomsets, (iv) an analysis of the algorithm and its benchmarking attained with a prototype implementation.

Pomsets是Pratt引入的并发计算模型。我们采用Pomset作为分布式系统的语法忽略规范模型，在该模型中，通过异步消息传递进行协调。

在本文中，我们研究确保通过通信自动机可以忠实地实现表示为一组词组的规范的条件。我们的主要贡献是（i）定义了终止健全性的可实现性条件的定义，（ii）解释了“多线程”参与者的条件，以及（iii）直接在词组上检查我们的可实现性条件的算法，（iv ）通过原型实现对算法及其基准进行分析。