Fairness of Actions in System Computations
Fairness of Actions in System Computations
复制标题
系统计算中动作的公平性
作者：
F. Corradini;M. R. D. Berardini;W. Vogler
本文对比了并行系统计算的两个重要特征：公平性和时间。该研究是在一个规范系统的水平，通过诉诸一个众所周知的过程描述语言。该语言扩展了标签，允许过滤掉那些不（弱）公平的过程执行[如Costa和斯特林（Acta Inf.21：417-441，1984）以及Costa和斯特林（Inf. Comput. 73：207-244，1987）]，以及过程活动的时间上限（如Corradini等人Acta Inf.38：735-792，2002）。我们发现，公平性和时间是密切相关的。两个主要结果。首先，我们证明了每个永恒（或非Zeno）的定时进程执行是公平的。其次，我们提供了一个表征公平执行的定时进程执行方面的非定时进程。这导致使用正则表达式的公平执行的有限表示。
This paper contrasts two important features of parallel system computations: fairness and timing. The study is carried out at a specification system level by resorting to a well-known process description language. The language is extended with labels which allow to filter out those process executions that are not (weakly) fair [as in Costa and Stirling (Acta Inf. 21:417–441, 1984) and in Costa and Stirling (Inf. Comput. 73:207–244, 1987)], and with upper time bounds for the process activities (as in Corradini et al. Acta Inf. 38:735–792, 2002). We show that fairness and timing are closely related. Two main results are stated. First, we show that each everlasting (or non-Zeno) timed process execution is fair. Second, we provide a characterization for fair executions of untimed processes in terms of timed process executions. This results in a finite representation of fair executions using regular expressions.