2 research outputs found
Parameterized Verification of Systems with Global Synchronization and Guards
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.Comment: Accepted at CAV 202