Checking a Mutex Algorithm in a Process Algebra with Fairness

CONCUR 2006, Bonn, August 2006
Eds.: C. Baier, H. Hermanns
Springer 2006, Lect. Notes Comput. Sci. 4137, 142 – 157
Copyright by Springer, Berlin, Heidelberg DOI: 10.1007/11817949_10

In earlier work, we have shown that two variants of weak fairness can be expressed comparatively easily in the timed process algebra PAFAS.

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 PAFAS.

Links:

• SpringerLink