Population protocols: beyond runtime analysis
From MaRDI portal
Publication:2695486
DOI10.1007/978-3-030-89716-1_3OpenAlexW3208060402MaRDI QIDQ2695486
Publication date: 31 March 2023
Full work available at URL: https://arxiv.org/abs/2108.13449
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Verification of population protocols
- Linearizing well quasi-orders and bounding the length of bad sequences
- Computation with finite stochastic chemical reaction networks
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The computational power of population protocols
- The complexity of verifying population protocols
- Towards efficient verification of population protocols
- Checking qualitative liveness properties of replicated systems with stochastic scheduling
- Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Advances in parameterized verification of population protocols
- Fast and Exact Majority in Population Protocols
- Complexity Analysis of Continuous Petri Nets
- An SMT-Based Approach to Coverability Analysis
- Fair Termination for Parameterized Probabilistic Concurrent Systems
- Time-Space Trade-offs in Population Protocols
- Model Checking Population Protocols
- Automatic Analysis of Expected Termination Time for Population Protocols
- Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
- The Reachability Problem for Petri Nets Is Not Elementary
- Complexity of controlled bad sequences over finite sets of Nd
- Stably computable predicates are semilinear
- The Logical View on Continuous Petri Nets
- Computation in networks of passively mobile finite-state sensors
- Succinct Population Protocols for Presburger Arithmetic
- Well-structured transition systems everywhere!
- Parameterized Analysis of Immediate Observation Petri Nets
This page was built for publication: Population protocols: beyond runtime analysis
