Automated analysis of mutual exclusion algorithms using CCS
- 1 March 1989
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 1 (1) , 273-292
- https://doi.org/10.1007/bf01887209
Abstract
A number of mutual exclusion algorithms are studied by representing them as agents in the Calculus of Communicating Systems and using an automated tool embodying some of the theory of the Calculus to analyse the representations. It is determined whether or not each of the algorithms preserves mutual exclusion and is live.Keywords
This publication has 20 references indexed in Scilit:
- Temporal logics for CCSPublished by Springer Nature ,1989
- The anchored version of the temporal frameworkPublished by Springer Nature ,1989
- Branching time temporal logicPublished by Springer Nature ,1989
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- Research on Automatic Verification of Finite-State Concurrent SystemsAnnual Review of Computer Science, 1987
- The mutual exclusion problemJournal of the ACM, 1986
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Additional comments on a problem in concurrent programming controlCommunications of the ACM, 1966
- Comments on a problem in concurrent programming controlCommunications of the ACM, 1966
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965