Parameterized Verification of Systems with Global Synchronization and Guards

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.

arXiv commentConference version published at CAV 2020; this version contains a correction of guard-compatibility conditions C2.1 and C2.2

References in corpus (7)

• Decidability Issues for Petri Nets -- a survey
• Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
• The Power of Well-Structured Systems
• Parameterized Synthesis
• Tight Cutoffs for Guarded Protocols with Fairness
• Parameterized Verification of Systems with Global Synchronization and Guards
• Parameterized Model Checking of Token-Passing Systems

Cited by in corpus (3)

• Parameterized Verification of Systems with Global Synchronization and Guards
• Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Verification (Extended Version)
• QuickSilver: A Modeling and Parameterized Verification Framework for Systems with Distributed Agreement (Extended Version)