CCS:这不公平!即使在进度和某些公平性假设下,也不能用类似CCS的语言实现公平性分析器
CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
摘要:
在进程代数社区中,有时建议在某种抽象级别上,任何分布式系统都可以用标准的进程代数规范形式主义(如CCS)建模。这种情绪得到了结果的加强,证明CCS,像许多类似的形式主义,是图灵强大,并提供了一个相互作用的机制。本文反对这种情绪,提出了一个简单的公平调度-一个在适当的变化发生在许多分布式系统-其中没有实现可以表示在CCS中,除非CCS是丰富的公平性假设。由于Dekker和Peterson的互斥协议实现了公平性,因此如果不施加公平性假设,这些协议就不能在CCS中正确地呈现。Peterson在伪代码中正确地表达了该算法,而没有诉诸公平性假设,因此进一步得出CCS缺乏准确捕获这种伪代码的表达能力。
英文摘要:
In the process algebra community it is sometimes suggested that, on some level of abstraction, any distributed system can be modelled in standard process-algebraic specification formalisms like CCS. This sentiment is strengthened by results testifying that CCS, like many similar formalisms, is Turing powerful and provides a mechanism for interaction. This paper counters that sentiment by presenting a simple fair scheduler---one that in suitable variations occurs in many distributed systems---of which no implementation can be expressed in CCS, unless CCS is enriched with a fairness assumption. Since Dekker's and Peterson's mutual exclusion protocols implement fair schedulers, it follows that these protocols cannot be rendered correctly in CCS without imposing a fairness assumption. Peterson expressed this algorithm correctly in pseudocode without resorting to a fairness assumption, so it furthermore follows that CCS lacks the expressive power to accurately capture such pseudocode.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。