2026-07-28T21:25:39Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12858 2024-03-06T10:50:52Z ddc:004 open_access

Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks Horn, Florian Sangnier, Arnaud Parameterized networks Verification Cut-offs 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Florian Horn and Arnaud Sangnier 2020 Is Part Of LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2020.46 urn:nbn:de:0030-drops-128581 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.46 eng https://creativecommons.org/licenses/by/3.0/legalcode