Automatic Analysis of Expected Termination Time for Population Protocols

DOI10.4230/LIPIcs.CONCUR.2018.33zbMath1487.68033arXiv1807.00331OpenAlexW2964087325MaRDI QIDQ5009451

Javier Esparza, Michael Blondin, Antonín Kučera

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1807.00331

zbMATH Keywords

performance analysisexpected termination timepopulation protocols

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14) Network protocols (68M12) Wireless sensor networks as related to computer science (68M18)

Related Items

Population protocols: beyond runtime analysis

Uses Software

• z3

Cites Work

• Unnamed Item
• Unnamed Item
• Verification of population protocols
• Automatic average-case analysis of algorithms
• Speed faults in computation by chemical reaction networks
• Towards efficient verification of population protocols
• Automated recurrence analysis for almost-linear expected-runtime bounds
• How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
• Computation in networks of passively mobile finite-state sensors
• Fast and Exact Majority in Population Protocols
• Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
• Convergence Speed of Binary Interval Consensus
• Time-Space Trade-offs in Population Protocols
• Computation in networks of passively mobile finite-state sensors
• Stable leader election in population protocols requires linear time