Skip to main content
SpringerLink
Log in

Liveness of a mutex algorithm in a fair process algebra

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

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 (Form Asp Comput 1:273–292, 1989) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: a semantics-based tool for the verification of concurrent systems. In: Proceedings of ACM Transaction on Programming Languages and Systems, vol. 15 (1993)

  2. Corradini, F., Di Berardini, M.R., Vogler, W.: PAFAS at work: comparing the worst-case efficiency of three buffer implementations. In: Proceedings of 2nd Asia-Pacific Conference on Quality Software, APAQS 2001, pp. 231–240, IEEE (2001)

  3. Corradini F., Di Berardini M.R., Vogler W.: Fairness of components in system computations. Theor. Comput. Sci. 356(3), 291–324 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Corradini F., Di Berardini M.R., Vogler W.: Fairness of actions in system computations. Acta Inform. 43, 73–130 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Corradini, F., Di Berardini, M., Vogler, W.: Liveness of a MUTEX algorithm in a fair process algebra. Tech. Rep. 2008-03, University of Augsburg. http://www.Informatik.Uni-Augsburg.DE/forschung/reports/ (2008)

  6. Corradini F., Vogler W.: Measuring the performance of asynchronous systems with PAFAS. Theor. Comput. Sci. 335, 187–213 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  7. Corradini F., Vogler W., Jenner L.: Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Inform. 38, 735–792 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  8. Costa G., Stirling C.: A fair calculus of communicating systems. Acta Inform. 21, 417–441 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Costa G., Stirling C.: Weak and strong fairness in CCS. Inform. Comput. 73, 207–244 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Francez N.: Fairness. Springer, Berlin (1986)

    MATH  Google Scholar 

  11. Lüttgen G., Vogler W.: Bisimulation on speed: worst-case efficiency. Inform. Comput. 191(2), 105–144 (2004)

    Article  MATH  Google Scholar 

  12. Lynch N.: Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco (1996)

    MATH  Google Scholar 

  13. Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall International, Englewood Cliffs (1989)

  14. Vogler W.: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. Theor. Comput. Sci. 275, 589–631 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Walker D.J.: Automated analysis of mutual exclusion algorithms using CCS. Form. Asp. Comput. 1, 273–292 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Informatica, Università di Camerino, Camerino, Italy

    Flavio Corradini & Maria Rita Di Berardini

  2. Institut für Informatik, Universität Augsburg, Augsburg, Germany

    Walter Vogler

Authors
  1. Flavio Corradini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Rita Di Berardini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Walter Vogler.

Additional information

An extended abstract appeared under the title ‘Checking a Mutex Algorithm in a Process Algebra with Fairness’ in C. Baier and H. Hermanns, eds., CONCUR 2006, vol. 4137 of Lecture Notes in Computer Science, pp. 142–157, Bonn, Germany, 2006. Springer.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Corradini, F., Di Berardini, M.R. & Vogler, W. Liveness of a mutex algorithm in a fair process algebra. Acta Informatica 46, 209–235 (2009). https://doi.org/10.1007/s00236-009-0092-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-009-0092-9

Keywords

Search

Navigation