On the diversity of asynchronous communication

Abstract

Asynchronous communication is often viewed as a single entity, the counterpart of synchronous communication. Although the basic concept of asynchronous communication is the decoupling of send and receive events, there is actually room for a variety of additional specification of the communication, for instance in terms of ordering. Yet, these different asynchronous communications are used interchangeably and seldom distinguished. This paper is a contribution to the study of these models, their differences, and how they are related. In this paper, the variety of point-to-point asynchronous communication paradigms is considered with two approaches. In the first and theoretical one, communication models are specified as properties on the ordering of events in distributed executions. In the second and more practical approach that involves composition of peers, they are modeled with transition systems and message histories as part of a framework. The described framework enables to model peer composition and compatibility properties. Besides, an implemented tool chain based on the TLA + formalism and model checking is also proposed and illustrated. The conformance of the two approaches is highlighted. A hierarchy is established between the studied communication models. From the execution viewpoint, it completes existing work in the area by introducing more asynchronous communication models and showing their differences. The framework is shown to offer abstract implementations of the communication models. Both the correctness and the completeness of the descriptions in the framework are studied. This reveals necessary restrictions on the behavior of the peers so that the communication models are actually implementable.

On deciding synchronizability for asynchronously communicating systems

“…Note that a Type:*-1 system describes the FIFO n-1 communication in distributed asynchronous systems [18,19]…”

“…As per [18,19], Type:1-1 system corresponds to the behavior of FIFO 1-1 communication in distributed system, where the following condition holds…”

“…is not possible in this Type:*-* system. The Type:*-* communication is same as the FIFO n-n communication model discussed in [19], where the messages are globally ordered and are consumed in the order they are sent.…”

“…The Type:bag system corresponds to the Fully Asynchronous Communication model discussed in [19], where no order on the sending of message is imposed.…”

“…Proof. The ordering in terms of execution (and therefore, the language) for the different types of systems has been proved in [19]. In the following, for the sake of completeness we present an overview of the proof in the context of language described in terms of send-sequences.…”