Advances in parameterized verification of population protocols
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3148873 (Why is no real title available?)
- Computation in networks of passively mobile finite-state sensors
- Computation in networks of passively mobile finite-state sensors
- Computation with finite stochastic chemical reaction networks
- Decidability of parameterized verification
- Fast and exact majority in population protocols
- Fast computation by population protocols with a leader
- Model checking population protocols
- Presburger vector addition systems
- Stably computable predicates are semilinear
- The computational power of population protocols
- Vector Addition System Reversible Reachability Problem
- Vector addition system reversible reachability problem
- Verification of population protocols
- Well-structured transition systems everywhere!
Cited in
(6)
This page was built for publication: Advances in parameterized verification of population protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399358)