Towards efficient verification of population protocols
From MaRDI portal
Publication:2058386
DOI10.1007/s10703-021-00367-3zbMath1487.68032arXiv1703.04367OpenAlexW3155827701MaRDI QIDQ2058386
Philipp J. Meyer, Stefan Jaax, Michael Blondin, Javier Esparza
Publication date: 8 December 2021
Published in: Formal Methods in System Design, Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04367
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Network protocols (68M12)
Related Items (4)
Advances in parameterized verification of population protocols ⋮ Population protocols: beyond runtime analysis ⋮ Automatic Analysis of Expected Termination Time for Population Protocols ⋮ The complexity of verifying population protocols
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mediated population protocols
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy
- The complexity of logical theories
- Memory requirements for silent stabilization
- The computational power of population protocols
- Computation in networks of passively mobile finite-state sensors
- Semigroups, Presburger formulas, and languages
- Fast and Exact Majority in Population Protocols
- Unbounded-Thread Program Verification using Thread-State Equations
- An SMT-Based Approach to Coverability Analysis
- Model Checking Population Protocols
- Free Choice Petri Nets
- Black Ninjas in the Dark
- Stably computable predicates are semilinear
- The reachability problem for Petri nets is not elementary
- Verification of Population Protocols
- Speed Faults in Computation by Chemical Reaction Networks
- Computation in networks of passively mobile finite-state sensors
This page was built for publication: Towards efficient verification of population protocols
