In earlier work, we have shown that two variants of weak fairness can be expressed comparatively easily in the timed process algebra PAPAS. To demonstrate the usefulness of these results, we complement work by Walker  and study the liveness property of Dekker's mutual exclusion algorithm within our process algebraic setting. We also present some results that allow to reduce the state space of the PAFAS process representing Dekker's algorithm, and give some insight into the representation of fair behaviour in PAPAS. © Springer-Verlag Berlin Heidelberg 2006.
Corradini, F., Di Berardini, M. R., & Vogler, W. (2006). Checking a mutex algorithm in a process algebra with fairness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4137 LNCS, pp. 142–157). Springer Verlag. https://doi.org/10.1007/11817949_10