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

07/11/2020
by   Florian Horn, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2023

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous

We consider networks of processes that all execute the same finite-state...
research
10/19/2020

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy

In rendez-vous protocols an arbitrarily large number of indistinguishabl...
research
08/18/2022

On the parameterized complexity of symmetric directed multicut

We study the problem Symmetric Directed Multicut from a parameterized co...
research
08/02/2023

Polynomial-delay Enumeration Kernelizations for Cuts of Bounded Degree

Enumeration kernelization was first proposed by Creignou et al. [TOCS 20...
research
11/12/2019

Uniform Partition in Population Protocol Model under Weak Fairness

We focus on a uniform partition problem in a population protocol model. ...
research
07/18/2022

From Infinity to Choreographies: Extraction for Unbounded Systems

Choreographies are formal descriptions of distributed systems, which foc...
research
02/19/2018

Population Protocols Made Easy

We put forward a simple high-level framework for describing a population...

Please sign up or login with your details

Forgot password? Click here to reset