Population protocols: beyond runtime analysis
From MaRDI portal
Publication:2695486
DOI10.1007/978-3-030-89716-1_3OpenAlexW3208060402MaRDI QIDQ2695486FDOQ2695486
Authors: Javier Esparza 
Publication date: 31 March 2023
Full work available at URL: https://arxiv.org/abs/2108.13449
Cites Work
- Computation in networks of passively mobile finite-state sensors
- Computation with finite stochastic chemical reaction networks
- The computational power of population protocols
- Fast computation by population protocols with a leader
- Title not available (Why is that?)
- Stably computable predicates are semilinear
- Well-structured transition systems everywhere!
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Complexity analysis of continuous Petri nets
- Computation in networks of passively mobile finite-state sensors
- Fast and exact majority in population protocols
- Verification of population protocols
- Linearizing well quasi-orders and bounding the length of bad sequences
- Checking qualitative liveness properties of replicated systems with stochastic scheduling
- Fair termination for parameterized probabilistic concurrent systems
- The Reachability Problem for Petri Nets Is Not Elementary
- Title not available (Why is that?)
- Large flocks of small birds: on the minimal size of population protocols
- The logical view on continuous Petri nets
- The complexity of verifying population protocols
- Time-space trade-offs in population protocols
- Recent results in population protocols for exact majority and leader election
- Towards efficient verification of population protocols
- Model checking population protocols
- Succinct Population Protocols for Presburger Arithmetic
- Advances in parameterized verification of population protocols
- An SMT-based approach to coverability analysis
- Parameterized Analysis of Immediate Observation Petri Nets
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Automatic analysis of expected termination time for population protocols
- Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
- Complexity of controlled bad sequences over finite sets of \(\mathbb{N}^d\)
Cited In (4)
Uses Software
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)
