I show that in a standard process algebra extended with time-outs one can correctly model mutual exclusion in such a way that starvation-freedom holds without assuming fairness or justness, even when one makes the problem more challenging by assuming memory accesses to be atomic. This can be achieved only when dropping the requirement of speed independence.

翻译：本文证明，在扩展了超时机制的标准进程代数中，可以正确地对互斥进行建模，使得即使在假设内存访问具有原子性而增加了问题难度的情况下，也无需假定公平性或正当性即可实现无饥饿性。这一结果仅在放弃速度无关性要求时方可实现。