Verification of Population Protocols with Unordered Data is undecidable
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.