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 [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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
Corradini, F., Di Berardini, M.R., Vogler, W.: Fairness of Components in System Computations. Theoretical Computer Science 356, 291–324 (2006)
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
Corradini, F., Vogler, W., Jenner, L.: Comparing the Worst-Case Efficiency of Asynchronous Systems with PAFAS. Acta Informatica 38, 735–792 (2002)
Costa, G., Stirling, C.: A Fair Calculus of Communicating Systems. Acta Informatica 21, 417–441 (1984)
Costa, G., Stirling, C.: Weak and Strong Fairness in CCS. Information and Computation 73, 207–244 (1987)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Milner, R.: Communication and Concurrency. International series in computer science. Prentice Hall International, Englewood Cliffs (1989)
Peterson, J.L., Silberschatz, A.: Operating Systems Concepts. Addison Wiley, Chichester (1985)
Walker, D.J.: Automated Analysis of Mutual Exclusion algorithms using CCS. Formal Aspects of Computing 1, 273–292 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corradini, F., Di Berardini, M.R., Vogler, W. (2006). Checking a Mutex Algorithm in a Process Algebra with Fairness. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_10
Download citation
DOI: https://doi.org/10.1007/11817949_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37376-6
Online ISBN: 978-3-540-37377-3
eBook Packages: Computer ScienceComputer Science (R0)