Fairness
Script: a communication abstraction mechanism and its verification
Science of Computer Programming
A Methodology for Developing Distributed Programs
IEEE Transactions on Software Engineering
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel program design: a foundation
Parallel program design: a foundation
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
Comments on “Communicating Sequential Processes”
ACM Transactions on Programming Languages and Systems (TOPLAS)
Output Guards and Nondeterminism in “Communicating Sequential Processes”
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Effective Implementation for the Generalized Input-Output Construct of CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Distributed algorithms for ensuring fair interprocess communicatons
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Elements for a course on the design of distributed algorithms
ACM SIGCSE Bulletin
Coordinating first-order multiparty interactions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient fault-tolerant algorithms for distributed resource allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Logically Instantaneous Message Passing in Asynchronous Distributed Systems
IEEE Transactions on Computers
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
A Protocol for Multi-Threaded Processes with Choice in pi-Calculus
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Efficient Synchronization of Asynchronous Processes
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
A top down approach for MAS protocol descriptions
Proceedings of the 2003 ACM symposium on Applied computing
Action systems in incremental and aspect-oriented modeling
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Some impossibility results in interprocess synchronization
Distributed Computing
A fair protocol for non-deterministic message passing
Proceedings of the Third C* Conference on Computer Science and Software Engineering
Distributed implementation of systems with multiparty interactions and priorities
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
| Hi-index | 0.00 |
Many concurrent programming languages including CSP and Ada use synchronous message-passing to define communication between a pair of asynchronous processes. Suggested primitives like the generalized alternative command for CSP and the symmetric select statement for Ada allow a process to nondeterministically select one of several communication statements for execution. The communication statement may be either an input or an output statement. We propose a simple algorithm to implement the generalized alternative command and show that it uses fewer messages than existing algorithms.