Parameterized verification of systems with global synchronization and guards
From MaRDI portal
Publication:2225108
DOI10.1007/978-3-030-53288-8_15zbMATH Open1478.68192arXiv2004.04896OpenAlexW3043232031MaRDI QIDQ2225108
Publication date: 4 February 2021
Abstract: Inspired by distributed applications that use consensus or other agreement protocols for global coordination, we define a new computational model for parameterized systems that is based on a general global synchronization primitive and allows for global transition guards. Our model generalizes many existing models in the literature, including broadcast protocols and guarded protocols. We show that reachability properties are decidable for systems without guards, and give sufficient conditions under which they remain decidable in the presence of guards. Furthermore, we investigate cutoffs for reachability properties and provide sufficient conditions for small cutoffs in a number of cases that are inspired by our target applications.
Full work available at URL: https://arxiv.org/abs/2004.04896
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Title not available (Why is that?) ⋮ Synthesis of distributed agreement-based systems with efficiently-decidable verification
This page was built for publication: Parameterized verification of systems with global synchronization and guards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225108)
