Population Protocols: Beyond Runtime Analysis

2021/08/30 by Esparza, Javier
#Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)

paper · doi:10.48550/arxiv.2108.13449

Abstract

I survey our recent work on the verification of population protocols and their state complexity.

Related

• The Complexity of Verifying Population Protocols
• Peregrine 2.0: Explaining Correctness of Population Protocols through\n Stage Graphs
• Lower Bounds on the State Complexity of Population Protocols
• Population Protocols Are Fast
• Efficient Stable Population Protocols for Parity and Beyond