License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2023.24
URN: urn:nbn:de:0030-drops-190184
Go to the corresponding LIPIcs Volume Portal

Mascle, Corto ; Muscholl, Anca ; Walukiewicz, Igor

Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints

LIPIcs-CONCUR-2023-24.pdf (0.7 MB)


In parametric lock-sharing systems processes can spawn new processes to run in parallel, and can create new locks. The behavior of every process is given by a pushdown automaton. We consider infinite behaviors of such systems under strong process fairness condition. A result of a potentially infinite execution of a system is a limit configuration, that is a potentially infinite tree. The verification problem is to determine if a given system has a limit configuration satisfying a given regular property. This formulation of the problem encompasses verification of reachability as well as of many liveness properties. We show that this verification problem, while undecidable in general, is decidable for nested lock usage.
We show Exptime-completeness of the verification problem. The main source of complexity is the number of parameters in the spawn operation. If the number of parameters is bounded, our algorithm works in Ptime for properties expressed by parity automata with a fixed number of ranks.

BibTeX - Entry

  author =	{Mascle, Corto and Muscholl, Anca and Walukiewicz, Igor},
  title =	{{Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints}},
  booktitle =	{34th International Conference on Concurrency Theory (CONCUR 2023)},
  pages =	{24:1--24: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 =		{},
  URN =		{urn:nbn:de:0030-drops-190184},
  doi =		{10.4230/LIPIcs.CONCUR.2023.24},
  annote =	{Keywords: Parametric systems, Locks, Model-checking}

Keywords: Parametric systems, Locks, Model-checking
Collection: 34th International Conference on Concurrency Theory (CONCUR 2023)
Issue Date: 2023
Date of publication: 07.09.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI