License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.46
URN: urn:nbn:de:0030-drops-128581
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12858/
Horn, Florian ;
Sangnier, Arnaud
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks
Abstract
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.
BibTeX - Entry
@InProceedings{horn_et_al:LIPIcs:2020:12858,
author = {Florian Horn and Arnaud Sangnier},
title = {{Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks}},
booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
pages = {46:1--46:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
year = {2020},
volume = {171},
editor = {Igor Konnov and Laura Kov{\'a}cs},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12858},
URN = {urn:nbn:de:0030-drops-128581},
doi = {10.4230/LIPIcs.CONCUR.2020.46},
annote = {Keywords: Parameterized networks, Verification, Cut-offs}
}
|
Keywords: |
|
Parameterized networks, Verification, Cut-offs |
|
Collection: |
|
31st International Conference on Concurrency Theory (CONCUR 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
26.08.2020 |
