New constructs for synchronization termed synchronization expressions (SEs) have been developed as high-level language constructs for parallel programming languages. We introduce a new family of languages named synchronization languages which we use to give a precise semantic description for SEs. Under this description, relations such as equivalence and inclusion between SEs can be easily understood and tested. In practice, it also provides us with a systematic way for the implementation as well as the simplification of SEs in parallel programming languages. We also show that each synchronization language is closed under the following rewriting rules: (1) a/sub s/b/sub s//spl rarr/b/sub s/a/sub s/, (2) a/sub t/b/sub t//spl rarr/b/sub t/a/sub t/, (3) a/sub s/b/sub t//spl rarr/b/sub t/a/sub s/, (4) a/sub t/a/sub s/b/sub t/b/sub s//spl rarr/b/sub t/b/sub s/a/sub t/a/sub s/ and also h(a/sub t/a/sub s/b/sub t/b/sub s/)/spl rarr/h(b/sub t/b/sub s/a/sub t/a/sub s/) for any morphism h that satisfies certain conditions which will be specified in the paper. We show that this property can be used to reduce the number of states of a finite automaton that describes a synchronization language.
展开▼
机译：已经开发了称为同步表达式（SE）的用于同步的新结构，作为用于并行编程语言的高级语言结构。我们引入了一个名为同步语言的新语言家族，我们可以使用它们来为SE提供精确的语义描述。根据该描述，可以容易地理解和测试SE之间的等价关系和包含关系。在实践中，它还为我们提供了一种系统的方式来实现并行编程语言中SE的实现以及简化SE。我们还表明，每种同步语言在以下重写规则下均处于关闭状态：（1）a / sub s / b / sub s // spl rarr / b / sub s / a / sub s /，（2）a / sub t / b / sub t // spl rarr / b / sub t / a / sub t /，（3）a / sub s / b / sub t // spl rarr / b / sub t / a / sub s /，（ 4）a / sub t / a / sub s / b / sub t / b / sub s // spl rarr / b / sub t / b / sub s / a / sub t / a / sub s /以及h（ a / sub t / a / sub s / b / sub t / b / sub s /）/ spl rarr / h（b / sub t / b / sub s / a / sub t / a / sub s /）满足某些条件的晶态h，将在本文中进行指定。我们证明了该属性可用于减少描述同步语言的有限自动机的状态数。
展开▼
