Checking a mutex algorithm in a process algebra with fairness

Authors:
Flavio Corradini;Maria Rita Di Berardini;Walter Vogler
Affiliations:
Dipartimento di Matematica e Informatica, Università di Camerino;Dipartimento di Matematica e Informatica, Università di Camerino;Institut für Informatik, Universität Augsburg
Venue:
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Year:
2006

Citing 7
Cited 2

Operating system concepts (2nd ed.)

Operating system concepts (2nd ed.)
Communicating sequential processes

Communicating sequential processes
Weak and strong fairness in CCS

Information and Computation
Automated analysis of mutual exclusion algorithms using CCS

Formal Aspects of Computing
The concurrency workbench: a semantics-based tool for the verification of concurrent systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and Concurrency

Communication and Concurrency
Fairness of components in system computations

Theoretical Computer Science - Expressiveness in concurrency

ACTLW - An action-based computation tree logic with unless operator

Information Sciences: an International Journal
Time and Fairness in a Process Algebra with Non-blocking Reading

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.