Pomsets are a model of concurrent computations introduced by Pratt. They can provide a syntax-oblivious description of semantics of coordination models based on asynchronous message-passing, such as Message Sequence Charts (MSCs). 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 for global specifications with "multi-threaded" participants, and (iii) the definition of realisability conditions that can be decided directly over pomsets. A positive by-product of our approach is the efficiency gain in the verification of the realisability conditions obtained when restricting to specific classes of choreographies characterisable in term of behavioural types.
翻译:Pratt 引入了同时计算模式。 它们可以提供基于非同步传递信息模式的协调模式语义的语义描述, 如信件序列图( MSCs ) 。 在本文中, 我们研究一些条件, 以确保通过交流自动表达能够忠实地实现以一组孔子表示的规格。 我们的主要贡献是 (一) 确定终止状态的可变性条件核算定义, (二) 由“ 多读” 参与者组成的全球规格条件, (三) 能够直接在浮标上决定的可变性条件的定义。 我们的方法的一个积极的副产品是,在将行为类型限制在特定种类的行曲特征属性时,在核实所实现的可变现性条件方面,效率的提高。