Analysis of the Four-slot Mechanism

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.

Content

Author and article information

Contributors

Phillip J. Brooke

Conference

Publication date: September 1996

Publication date (Print): September 1996

Pages: 1-14

Affiliations

[0001]Department of Computer Science, The University of York

York, YO1 5DD, England

Article

DOI: 10.14236/ewic/FA1996.3

SO-VID: 3224e78a-89c8-4a53-bc63-9f3921e98da4

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the BCS-FACS Northern Formal Methods Workshop

Conference acronym: NFM

Conference number:

Conference location: Ilkley, UK

Conference date: 23-24 September 1996

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Northern Formal Methods

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/FA1996.3

Self URI (journal page): https://ewic.bcs.org/

Celebrating 65 years of The Computer Journal - free-to-read perspectives - bcs.org/tcj65

Analysis of the Four-slot Mechanism

Abstract