DROPS

Document

DOI: 10.4230/LIPIcs.CONCUR.2023.7

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

Authors: Lucie Guillou, Arnaud Sangnier, and Nathalie Sznajder

Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)

Abstract

We consider networks of processes that all execute the same finite-state protocol and communicate via a rendez-vous mechanism. When a process requests a rendez-vous, another process can respond to it and they both change their control states accordingly. We focus here on a specific semantics, called non-blocking, where the process requesting a rendez-vous can change its state even if no process can respond to it. In this context, we study the parameterised coverability problem of a configuration, which consists in determining whether there is an initial number of processes and an execution allowing to reach a configuration bigger than a given one. We show that this problem is EXPSPACE-complete and can be solved in polynomial time if the protocol is partitioned into two sets of states, the states from which a process can request a rendez-vous and the ones from which it can answer one. We also prove that the problem of the existence of an execution bringing all the processes in a final state is undecidable in our context. These two problems can be solved in polynomial time with the classical rendez-vous semantics.

Cite as

Lucie Guillou, Arnaud Sangnier, and Nathalie Sznajder. Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 7:1-7:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{guillou_et_al:LIPIcs.CONCUR.2023.7,
  author =	{Guillou, Lucie and Sangnier, Arnaud and Sznajder, Nathalie},
  title =	{{Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous}},
  booktitle =	{34th International Conference on Concurrency Theory (CONCUR 2023)},
  pages =	{7:1--7:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-299-0},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{279},
  editor =	{P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.7},
  URN =		{urn:nbn:de:0030-drops-190015},
  doi =		{10.4230/LIPIcs.CONCUR.2023.7},
  annote =	{Keywords: Parameterised verification, Coverability, Counter machines}
}

Search Results

Documents authored by Guillou, Lucie

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

Abstract

Cite as

Thanks for your feedback!

Could not send message