An Effective Implementation for the Generalized Input-Output Construct of CSP

74Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

Writing distributed algorithms in Hoare's CSP becomes more convenient if output statements are allowed in the guards of alternative and iterative commands. The major drawbacks of the previously published implementations of this construct are discussed. Criteria for an effective implementation are presented, and an algorithm that meets these criteria is constructed. © 1983, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Buckley, G. N., & Silberschatz, A. (1983). An Effective Implementation for the Generalized Input-Output Construct of CSP. ACM Transactions on Programming Languages and Systems (TOPLAS), 5(2), 223–235. https://doi.org/10.1145/69624.357208

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free