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

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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Horn, Florian, Sangnier, Arnaud
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Horn, Florian
Sangnier, Arnaud
description 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.
doi_str_mv 10.48550/arxiv.2007.05789
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2007_05789</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2007_05789</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-ec251787a5fd0c615ac638d7aa43e3fa413d92bd172ae2cef2a06d820b738bca3</originalsourceid><addsrcrecordid>eNotz71uwjAUQGEvHSrgATrhF3Dqnzh2RkRbWgmJhT26sa_BanGQYyjw9FVpp7Md6SPkSfCqtlrzZ8iXeK4k56bi2tj2kaxe0EUf046WPVK8xLFgckiHQN2psCEEGhM9QoYDFszxhp5mTB5v7DycRpqwfA_5c5yShwBfI87-OyHbt9ft8p2tN6uP5WLNoDEtQye1MNaADp67RmhwjbLeANQKVYBaKN_K3gsjAaXDIIE33kreG2V7B2pC5n_bu6Q75niAfO1-Rd1dpH4AtABHdA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Deciding the existence of cut-off in parameterized rendez-vous networks</title><source>arXiv.org</source><creator>Horn, Florian ; Sangnier, Arnaud</creator><creatorcontrib>Horn, Florian ; Sangnier, Arnaud</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2007.05789</identifier><language>eng</language><subject>Computer Science - Logic in Computer Science</subject><creationdate>2020-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2007.05789$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2007.05789$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Horn, Florian</creatorcontrib><creatorcontrib>Sangnier, Arnaud</creatorcontrib><title>Deciding the existence of cut-off in parameterized rendez-vous networks</title><description>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.</description><subject>Computer Science - Logic in Computer Science</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71uwjAUQGEvHSrgATrhF3Dqnzh2RkRbWgmJhT26sa_BanGQYyjw9FVpp7Md6SPkSfCqtlrzZ8iXeK4k56bi2tj2kaxe0EUf046WPVK8xLFgckiHQN2psCEEGhM9QoYDFszxhp5mTB5v7DycRpqwfA_5c5yShwBfI87-OyHbt9ft8p2tN6uP5WLNoDEtQye1MNaADp67RmhwjbLeANQKVYBaKN_K3gsjAaXDIIE33kreG2V7B2pC5n_bu6Q75niAfO1-Rd1dpH4AtABHdA</recordid><startdate>20200711</startdate><enddate>20200711</enddate><creator>Horn, Florian</creator><creator>Sangnier, Arnaud</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20200711</creationdate><title>Deciding the existence of cut-off in parameterized rendez-vous networks</title><author>Horn, Florian ; Sangnier, Arnaud</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-ec251787a5fd0c615ac638d7aa43e3fa413d92bd172ae2cef2a06d820b738bca3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Computer Science - Logic in Computer Science</topic><toplevel>online_resources</toplevel><creatorcontrib>Horn, Florian</creatorcontrib><creatorcontrib>Sangnier, Arnaud</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Horn, Florian</au><au>Sangnier, Arnaud</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Deciding the existence of cut-off in parameterized rendez-vous networks</atitle><date>2020-07-11</date><risdate>2020</risdate><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.</abstract><doi>10.48550/arxiv.2007.05789</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2007.05789
ispartof
issn
language eng
recordid cdi_arxiv_primary_2007_05789
source arXiv.org
subjects Computer Science - Logic in Computer Science
title Deciding the existence of cut-off in parameterized rendez-vous networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-25T19%3A36%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Deciding%20the%20existence%20of%20cut-off%20in%20parameterized%20rendez-vous%20networks&rft.au=Horn,%20Florian&rft.date=2020-07-11&rft_id=info:doi/10.48550/arxiv.2007.05789&rft_dat=%3Carxiv_GOX%3E2007_05789%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true