Computation in networks of passively mobile finite-state sensors
From MaRDI portal
Publication:5501509
DOI10.1145/1011767.1011810zbMath1321.68058OpenAlexW2098579316WikidataQ62472227 ScholiaQ62472227MaRDI QIDQ5501509
Michael J. Fischer, James Aspnes, Dana Angluin, Zoë Diamadi, René Peralta
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011810
mobile agentdiffuse computationfinite-state agentintermittent communicationstable computationsensor net
Related Items
A counter abstraction technique for verifying properties of probabilistic swarm systems, Fast computation by population protocols with a leader, Data Collection in Population Protocols with Non-uniformly Random Scheduler, Unnamed Item, Recent Advances in Population Protocols, Population protocols with unreliable communication, Advances in parameterized verification of population protocols, Unnamed Item, Plane formation by synchronous mobile robots without chirality, The computational power of simple protocols for self-awareness on graphs, Agreeing within a few writes, Lower bounds on the state complexity of population protocols, Sharp Thresholds in Random Simple Temporal Graphs, Fast and succinct population protocols for Presburger arithmetic, Parameterized Analysis of Immediate Observation Petri Nets, Brief Announcement: Population Protocols Decide Double-exponential Thresholds, Improved Tradeoffs for Leader Election, Population protocols: beyond runtime analysis, Protocols with constant local storage and unreliable communication, The computational power of population protocols, Unnamed Item, Computational models for networks of tiny artifacts: a survey, The Dynamics of Probabilistic Population Protocols, Labelled (Hyper)Graphs, Negotiations and the Naming Problem, Expressive Power of Broadcast Consensus Protocols, Verification of Immediate Observation Population Protocols, Automatic Analysis of Expected Termination Time for Population Protocols, Verification of population protocols, On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\), Mediated population protocols, A self-stabilizing transformer for population protocols with covering, Unnamed Item, Time-space trade-offs in population protocols for the majority problem, The complexity of verifying population protocols, Homonym population protocols, Data collection in population protocols with non-uniformly random scheduler, Constructing Self-stabilizing Oscillators in Population Protocols, Unnamed Item, Reachability Problems for Continuous Chemical Reaction Networks, Towards efficient verification of population protocols, On the convergence of population protocols when population goes to infinity, How many cooks spoil the soup?, A Survey on Analog Models of Computation, Flat Petri nets (invited talk)
