  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.
