DeepAI
Log In Sign Up

Parameterized Verification of Systems with Global Synchronization and Guards

04/10/2020
by   Nouraldin Jaber, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/17/2020

Towards Refinable Choreographies

We investigate refinement in the context of choreographies. We introduce...
05/20/2019

Verification and Synthesis of Symmetric Uni-Rings for Leads-To Properties

This paper investigates the verification and synthesis of parameterized ...
11/17/2018

On Reachability in Parameterized Phaser Programs

We address the problem of statically checking safety properties (such as...
08/26/2022

Synthesis of Distributed Agreement-Based Systems with Efficiently-Decidable Parameterized Verification

Distributed agreement-based (DAB) systems use common distributed agreeme...
11/05/2021

Parameterized Repair of Concurrent Systems

We present an algorithm for the repair of parameterized systems. The rep...
11/20/2018

FAR-Cubicle - A new reachability algorithm for Cubicle

We present a fully automatic algorithm for verifying safety properties o...
02/23/2018

Parameterized verification of synchronization in constrained reconfigurable broadcast networks

Reconfigurable broadcast networks provide a convenient formalism for mod...