We re-engineer a pomset-based abstract semantics (and the associated semantic constraints) recently proposed for compositionally specified choreographies for systems of components communicating over first-in-first-out channels. We prove that the original semantics over-specifies components' behaviour and that for this (but not only this) reason, the original semantic constraints are insufficient for the realizability of choreographies. We remove the problematic over-specification in the semantics, extend the semantics to explicitly specified interaction pomset sets, define an abstract syntax of choreographies and rephrase choreography semantics in terms of it, and newly provide a syntax-independent definition of choreography well-formedness. We prove that choreographies well-formed in the new sense are realizable and under a certain additional condition also causal-consistent reversible. Devising a set of rules for inferring well-formedness of choreographies compositionally, we correct the semantic constraints originally claimed sufficient for operands of individual composition operators. Our constraints and our definition of choreography well-formedness are in certain ways also less restrictive than the original ones. In particular, we newly allow also choreographies exploiting accidental event orderings.

我们对最近提出的基于Pomset的抽象语义（以及相关的语义约束）进行了重新设计，以针对通过先进先出通道进行通信的组件系统进行结构指定的编排。我们证明了原始语义过度指定了组件的行为，并且出于这个（但不仅是这个）原因，原始语义约束不足以实现编排。我们消除了语义上的过度规范问题，将语义扩展到明确指定的交互pomset集，定义了编排的抽象语法，并以此重新表述了编排语义，并重新提供了与语法无关的编排良好格式的定义。我们证明，在新的意义上精心编排的编排是可以实现的，并且在一定的附加条件下，因果一致的可逆性也是可以实现的。通过设计一套规则来推断编​​排的格式正确性，我们纠正了原本声称足以满足各个编排运算符操作数要求的语义约束。在某些方面，我们的约束和对舞蹈编排格式的定义的限制也比原始约束少。特别是，我们最近还允许利用意外事件顺序进行编排。在某些方面，我们的约束和对舞蹈编排格式的定义的限制也比原始约束少。特别是，我们最近还允许利用意外事件顺序进行编排。在某些方面，我们的约束和对舞蹈编排格式的定义的限制也比原始约束少。特别是，我们最近还允许利用意外事件顺序进行编排。