# A partial order view of message-passing communication models

arXiv: https://arxiv.org/abs/2210.13062 · HTML: https://mlsanity.com/paper/2210.13062/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 5 of its 47 references that are in the map.
- First posted on arXiv 24 Oct 2022.

## Builds on (most cited first, 5 of 5)

- [On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony](https://mlsanity.com/paper/1804.06612/) (2018)
- [Static Analysis of Communicating Processes using Symbolic Transducers](https://mlsanity.com/paper/1611.07812/) (2016)
- [Verifying Asynchronous Interactions via Communicating Session Automata](https://mlsanity.com/paper/1901.09606/) (2019)
- [Non-Sequential Theory of Distributed Systems](https://mlsanity.com/paper/1904.06942/) (2019)
- [On the k-synchronizability of systems](https://mlsanity.com/paper/1909.01627/) (2019)

## Built on by (most cited first, 1 of 1)

- [Weakly synchronous systems with three machines are Turing powerful](https://mlsanity.com/paper/2308.10578/) (2023)

## Abstract (arXiv)

There is a wide variety of message-passing communication models, ranging from synchronous ''rendez-vous'' communications to fully asynchronous/out-of-order communications. For large-scale distributed systems, the communication model is determined by the transport layer of the network, and a few classes of orders of message delivery (FIFO, causally ordered) have been identified in the early days of distributed computing. For local-scale message-passing applications, e.g., running on a single machine, the communication model may be determined by the actual implementation of message buffers and by how FIFO queues are used. While large-scale communication models, such as causal ordering, are defined by logical axioms, local-scale models are often defined by an operational semantics. In this work, we connect these two approaches, and we present a unified hierarchy of communication models encompassing both large-scale and local-scale models, based on their concurrent behaviors. We also show that all the communication models we consider can be axiomatized in the monadic second order logic, and may therefore benefit from several bounded verification techniques based on bounded special treewidth.