Liveness of a mutex algorithm in a fair process algebra

@article{Corradini2009LivenessOA,
  title={Liveness of a mutex algorithm in a fair process algebra},
  author={Flavio Corradini and Maria Rita Di Berardini and Walter Vogler},
  journal={Acta Informatica},
  year={2009},
  volume={46},
  pages={209-235}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Automated analysis of mutual exclusion algorithms using CCS

  • D. J. Walker
  • Form. Asp. Comput. 1, 273–292
  • 1989
Highly Influential
15 Excerpts

Liveness of a MUTEX algorithm in a fair process algebra

  • F. Corradini, M. Di Berardini, W. Vogler
  • Tech. Rep. 2008-03, University of Augsburg. http…
  • 2008
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…