Verification of Population Protocols with Unordered Data is undecidable

05/17/2023
by   Roland Guttenberg, et al.
0

We consider the new extension of population protocols with unordered data and show that the corresponding well-specification problem and therefore also other verification problems are undecidable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2021

Population Protocols: Beyond Runtime Analysis

I survey our recent work on the verification of population protocols and...
research
07/15/2020

Peregrine 2.0: Explaining Correctness of Population Protocols through Stage Graphs

We present a new version of Peregrine, the tool for the analysis and par...
research
07/05/2018

Practical and Scalable Security Verification of Secure Architectures

We present a new and practical framework for security verification of se...
research
03/07/2019

Local Reasoning for Parameterized First Order Protocols

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

Quantitative Verification of Opacity Properties in Security Systems

We delineate a methodology for the specification and verification of flo...
research
06/26/2018

Treo: Textual Syntax for Reo Connectors

Reo is an interaction-centric model of concurrency for compositional spe...
research
07/31/2023

Valeriepieris Circles for Spatial Data Analysis

The Valeriepieris circle is the smallest circle that can be draw on the ...

Please sign up or login with your details

Forgot password? Click here to reset