Population protocols: beyond runtime analysis
From MaRDI portal
Publication:2695486
Cites work
- scientific article; zbMATH DE number 3148873 (Why is no real title available?)
- scientific article; zbMATH DE number 6850453 (Why is no real title available?)
- Advances in parameterized verification of population protocols
- An SMT-based approach to coverability analysis
- Automatic analysis of expected termination time for population protocols
- Checking qualitative liveness properties of replicated systems with stochastic scheduling
- Complexity analysis of continuous Petri nets
- Complexity of controlled bad sequences over finite sets of \(\mathbb{N}^d\)
- 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
- Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
- Fair termination for parameterized probabilistic concurrent systems
- Fast and exact majority in population protocols
- Fast computation by population protocols with a leader
- Large flocks of small birds: on the minimal size of population protocols
- Linearizing well quasi-orders and bounding the length of bad sequences
- Model checking population protocols
- Parameterized Analysis of Immediate Observation Petri Nets
- Recent results in population protocols for exact majority and leader election
- Stably computable predicates are semilinear
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Succinct Population Protocols for Presburger Arithmetic
- The Reachability Problem for Petri Nets Is Not Elementary
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The complexity of verifying population protocols
- The computational power of population protocols
- The logical view on continuous Petri nets
- Time-space trade-offs in population protocols
- Verification of population protocols
- Well-structured transition systems everywhere!
Cited in
(3)
This page was built for publication: Population protocols: beyond runtime analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695486)
