Advances in parameterized verification of population protocols

DOI10.1007/978-3-319-58747-9_2zbMath1489.68035OpenAlexW2611901395MaRDI QIDQ2399358

Javier Esparza

Publication date: 22 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58747-9_2

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Network protocols (68M12) Wireless sensor networks as related to computer science (68M18)

Related Items (1)

Population protocols: beyond runtime analysis

Uses Software

• Coq
• z3
• PAT

Cites Work

• Unnamed Item
• Verification of population protocols
• Computation with finite stochastic chemical reaction networks
• The computational power of population protocols
• Towards efficient verification of population protocols
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Fast and Exact Majority in Population Protocols
• Vector Addition System Reversible Reachability Problem
• Decidability of Parameterized Verification
• Model Checking Population Protocols
• Vector Addition System Reversible Reachability Problem
• Stably computable predicates are semilinear
• Presburger Vector Addition Systems
• Computation in networks of passively mobile finite-state sensors
• Well-structured transition systems everywhere!

This page was built for publication: Advances in parameterized verification of population protocols