  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.
