Analysis of the four-slot mechanism

Authors:
Phillip J. Brooke;Jeremy L. Jacob;James M. Armstrong
Affiliations:
Department of Computer Science, The University of York, York, England;Department of Computer Science, The University of York, York, England;Department of Computer Science, The University of York, York, England
Venue:
1FACS'96 Proceedings of the 1st BCS-FACS conference on Northern Formal Methods
Year:
1996

Citing 2
Cited 3

Communicating sequential processes

Communicating sequential processes
Solution of a problem in concurrent programming control

Communications of the ACM

The Formal Classification and Verification of Simpson's 4-Slot Asynchronous Communication Mechanism

FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
The Design of a Tool-Supported Graphical Notation for Timed CSP

IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
Metastability in Asynchronous Wait-Free Protocols

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an analysis of an asynchronous communication mechanism due to Simpson [4]. The properties required of an abstract version of the mechanism are discussed. Simpson's mechanism is described in terms of a process algebraic model. We then use automated techniques to test this mechanism against the properties stated.