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

05/20/2019
by   Ali Ebnenasir, et al.
0

This paper investigates the verification and synthesis of parameterized protocols that satisfy leadsto properties R Q on symmetric unidirectional rings (a.k.a. uni-rings) of deterministic and constant-space processes under no fairness and interleaving semantics, where R and Q are global state predicates. First, we show that verifying R Q for parameterized protocols on symmetric uni-rings is undecidable, even for deterministic and constant-space processes, and conjunctive state predicates. Then, we show that surprisingly synthesizing symmetric uni-ring protocols that satisfy R Q is actually decidable. We identify necessary and sufficient conditions for the decidability of synthesis based on which we devise a sound and complete polynomial-time algorithm that takes the predicates R and Q, and automatically generates a parameterized protocol that satisfies R Q for unbounded (but finite) ring sizes. Moreover, we present some decidability results for cases where leadsto is required from multiple distinct R predicates to different Q predicates. To demonstrate the practicality of our synthesis method, we synthesize some parameterized protocols, including agreement and parity protocols.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/10/2020

Parameterized Verification of Systems with Global Synchronization and Guards

Inspired by distributed applications that use consensus or other agreeme...
research
03/07/2019

Local Reasoning for Parameterized First Order Protocols

First Order Logic (FOL) is a powerful reasoning tool for program verific...
research
08/28/2018

Reactive Synthesis: Branching Logics and Parameterized Systems

Reactive synthesis is an automatic way to translate a human intention ex...
research
09/28/2020

Parameterized Synthesis with Safety Properties

Parameterized synthesis offers a solution to the problem of constructing...
research
11/04/2020

Probabilistic Bisimulation for Parameterized Systems (Technical Report)

Probabilistic bisimulation is a fundamental notion of process equivalenc...
research
05/12/2022

Bounded Verification of Doubly-Unbounded Distributed Agreement-Based Systems

The ubiquity of distributed agreement protocols, such as consensus, has ...
research
10/16/2017

Symmetric Synthesis

We study the problem of determining whether a given temporal specificati...

Please sign up or login with your details

Forgot password? Click here to reset