# Deciding the existence of cut-off in parameterized rendez-vous networks

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

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 11 Jul 2020.

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

- [Safety Verification of Wait-Only Non-Blocking Broadcast Protocols](https://mlsanity.com/paper/2403.18591/) (2024)

## Abstract (arXiv)

We study networks of processes which all execute the same finite-state protocol and communicate thanks to a rendez-vous mechanism. Given a protocol, we are interested in checking whether there exists a number, called a cut-off, such that in any networks with a bigger number of participants, there is an execution where all the entities end in some final states. We provide decidability and complexity results of this problem under various assumptions, such as absence/presence of a leader or symmetric/asymmetric rendez-vous.