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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baeten, J.:Procesalgebra, Kluwer programmatuurkunde, 1986.
Baeten, J., Bergstra, J. and Klop, J. W.: Decidability of Bisimulation Equivalence for Processes Generating Context-free Languages, in Springer LNCS 299, 1987.
Clarke, E. and Emerson, E. A.: Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic, in Springer LNCS 131, 1981.
Clarke, E. and Grümberg, O.: Research on Automatic Verification of Finite-State Concurrent Systems.Ann. Rev. Comput. Sci., 2 1987.
Cleaveland, R., Parrow, J. and Steffen, B.: The Concurrency Workbench, to appear in [Gre89].
Cleaveland, R., Parrow, J. and Steffen, B.: A Semantics based Verification Tool for Finite State Systems, to appear inProc. Ninth Int. Symp. on Protocol Specification, Testing and Verification, North Holland, 1989.
Dijkstra, E. W.: Solution of a Problem in Concurrent Programming Control. Comm. ACM, 8/9 1965.
Emerson, E. A. and Lei, C-L.: Modalities for Model Checking: Branching Time Strikes Back. Sci. Comput. Prog., 6 1987.
Emerson, E. A. and Srinivasan, J.: Branching time temporal logic, in Springer LNCS 354, 1989.
Francez, N.:Fairness, Springer, 1986.
Proceedings of Workshop on Automatic Verification Methods for Finite State Systems, Grenoble 1989, to appear in Springer LNCS series.
Hoare, C. A. R.:Communicating Sequential Processes, Prentice-Hall 1985.
Hyman, H.: Comments on a Problem in Concurrent Programming Control.Comm. ACM, 9/1 1966.
Jonsson, B. and Parrow, J.: Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs, in Springer LNCS 349, 1989.
Knuth, D. E.: Additional Comments on a Problem in Concurrent Programming Control. Comm. ACM, 9/5 1966.
Kozen, D.: Results on the Prepositionalμ-Calculus. Theoretical Computer Science, 27 1983.
Lamport, L.: The Mutual Exclusion Problem Part II — Statement and Solutions. JACM, 33/2 1986.
Larsen, K.: Proof Systems for Hennessy-Milner Logic with Recursion to appear inInformation and Computation 1989.
Manna, Z. and Pneuli A.: The Anchored Version of the Temporal Framework, in Springer LNCS 354, 1989.
Milner, R.:A Calculus of Communicating Systems, Springer-Verlag, 1980; available as University of Edinburgh report ECS-LFCS-87-7.
Milner, R.: Calculi for Synchrony and Asynchrony.Theoretical Computer Science, 25 1983.
Milner, R.:Communication and Concurrency, Prentice-Hall, 1989.
Parrow, J.: Verifying a CSMA/CD-Protocol with CCS, University of Edinburgh report ECS-LFCS-87-18, 1987.
Peterson, J. L. and Silberschatz, A.:Operating System Concepts, 2nd ed., Addison Wesley, 1985.
Pratt, V., A Decidable Mu-Calculus, in Proc. 22nd ACM FOCS, 1981.
Queille J., and Sifakis, J.: Specification and Verification of Concurrent Systems in CESAR, in Springer LNCS 137, 1981.
Stirling, C.: Temporal Logics for CCS, in Springer LNCS 354, 1989.
Stirling, C.: Modal and Temporal Logics, chapter to appear inHandbook of Logic in Computer Science, OUP, 1989.
Stirling, C. and Walker, D.: Local Model Checking in the Modal Mu-Calculus, in Springer LNCS 351, 1989.
Stirling, C. and Walker, D.: CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus, to appear in [Gre89].
Walker, D.: Introduction to a Calculus of Communicating Systems, University of Edinburgh report, ECS-LFCS-87-22, 1987.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Walker, D.J. Automated analysis of mutual exclusion algorithms using CCS. Formal Aspects of Computing 1, 273–292 (1989). https://doi.org/10.1007/BF01887209
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01887209