Amending Choreographies
Amending Choreographies
复制标题
修改编排
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
G. Zavattaro
中科院分区：
文献类型：
--
作者：
Ivan Lanese;F. Montesi;G. Zavattaro
编排是系统行为的全局描述，从中可以通过投影自动获得每个端点实体的局部行为。为了保证其投影是正确的，即它具有与原始编排相同的行为，编排通常必须尊重一些一致性条件。这限制了可以投影的编排集。在本文中，我们提出了一种修改不尊重投影正确性的常见句法条件的编排的转换。具体来说，我们的转换会自动减少并发量，并推断并添加隐藏的通信，使最终的编排尊重所需的条件，同时保留其行为。
Choreographies are global descriptions of system behaviors, from which the local behavior of each endpoint entity can be obtained automatically through projection. To guarantee that its projection is correct, i.e. it has the same behaviors of the original choreography, a choreography usually has to respect some coherency conditions. This restricts the set of choreographies that can be projected. In this paper, we present a transformation for amending choreographies that do not respect common syntactic conditions for projection correctness. Specifically, our transformation automatically reduces the amount of concurrency, and it infers and adds hidden communications that make the resulting choreography respect the desired conditions, while preserving its behavior.