Communicating sequential processes
Communicating sequential processes
Script: a communication abstraction mechanism and its verification
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new and efficient implementation of multiprocess synchronization
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
A Methodology for Developing Distributed Programs
IEEE Transactions on Software Engineering
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic theory of processes
Parallel program design: a foundation
Parallel program design: a foundation
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
Coordinating first-order multiparty interactions
ACM Transactions on Programming Languages and Systems (TOPLAS)
G-LOTOS: a graphical language for concurrent systems
Computer Networks and ISDN Systems
Efficient implementation of synchronous communication over asynchronous networks
Journal of Parallel and Distributed Computing
An Effective Implementation for the Generalized Input-Output Construct of CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and Concurrency
The Complete Axiomatization of Cs-congruence
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Multiway Synchrinizaton Verified with Coupled Simulation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
| Hi-index | 0.24 |
A multiway synchronization protocol makes it possible for several processes to synchronize in an environment where communication is asynchronous. We present the design of such a protocol. The design methodology is based on formulating the behaviour of the entities as transition systems. This admits a correctness proof: we show that the protocol is correct relatively an 'ideal' non-distributed algorithm, in the sense that the protocol and the ideal algorithm cannot be separated by any amount of testing. The proof method is based on cs-equivalence.