Concurrent message passing in communicating sequential processes

Abstract

The authors examine a model of concurrency among concurrent sequential processes with asynchronous message sending done using ordinary and FLUSH message passing primitives. Using two paradigms, the authors show that FLUSH primitives permit more accurate modeling of problem situations than synchronous message passing. They also show that FLUSH message passing primitives allow for a greater concurrency in message passing than synchronous message passing primitives. An implementation of the primitives using counters is outlined.<>