Checking a Mutex Algorithm in a Process Algebra with Fairness

  • Flavio Corradini
  • Maria Rita Di Berardini
  • Walter Vogler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4137)


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 [11] 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.

Unable to display preview. Download preview PDF.


  1. 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. 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
  3. 3.
    Corradini, F., Di Berardini, M.R., Vogler, W.: Fairness of Components in System Computations. Theoretical Computer Science 356, 291–324 (2006)CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    Corradini, F., Di Berardini, M.R., Vogler, W.: Checking a Mutex Algorithm in a Process Algebra with Fairness. Full Version, Avalilable at:
  5. 5.
    Corradini, F., Vogler, W., Jenner, L.: Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS. Acta Informatica 38, 735–792 (2002)CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    Costa, G., Stirling, C.: A Fair Calculus of Communicating Systems. Acta Informatica 21, 417–441 (1984)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Costa, G., Stirling, C.: Weak and Strong Fairness in CCS. Information and Computation 73, 207–244 (1987)CrossRefMathSciNetzbMATHGoogle Scholar
  8. 8.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  9. 9.
    Milner, R.: Communication and Concurrency. International series in computer science. Prentice Hall International, Englewood Cliffs (1989)zbMATHGoogle Scholar
  10. 10.
    Peterson, J.L., Silberschatz, A.: Operating Systems Concepts. Addison Wiley, Chichester (1985)Google Scholar
  11. 11.
    Walker, D.J.: Automated Analysis of Mutual Exclusion algorithms using CCS. Formal Aspects of Computing 1, 273–292 (1989)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Flavio Corradini
    • 1
  • Maria Rita Di Berardini
    • 1
  • Walter Vogler
    • 2
  1. 1.Dipartimento di Matematica e InformaticaUniversità di Camerino 
  2. 2.Institut für InformatikUniversität Augsburg 

Personalised recommendations