Checking a Mutex Algorithm in a Process Algebra with Fairness
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.
Unable to display preview. Download preview PDF.
- 1.Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: a semantics-based tool for the verification of concurrent systems. Proceedings of ACM Transaction on Programming Languages and Systems 15 (1993)Google Scholar
- 2.Corradini, F., Di Berardini, M.R., Vogler, W.: Fairness of Actions in System Computations. Acta Informatica Extended abstract: Relating Fairness and Timing in Process Algebras (to appear); In: Amadio, R., Lugiez, D. (eds.) Proc. of CONCUR 2003, LNCS, vol. 2761, pp. 446–460. Springer, Heidelberg (2003)Google Scholar
- 4.Corradini, F., Di Berardini, M.R., Vogler, W.: Checking a Mutex Algorithm in a Process Algebra with Fairness. Full Version, Avalilable at: http://www.cs.unicam.it/docenti/flavio.corradini
- 10.Peterson, J.L., Silberschatz, A.: Operating Systems Concepts. Addison Wiley, Chichester (1985)Google Scholar