Terminating distributed construction of shapes and patterns in a fair solution of automata

DOI10.1007/s00446-017-0309-zzbMath1451.68052OpenAlexW2748107296WikidataQ59613789 ScholiaQ59613789MaRDI QIDQ1656881

Othon Michail

Publication date: 10 August 2018

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-017-0309-z

zbMATH Keywords

fairnessself-replicationself-organizationstructure formationdistributed protocolprogrammable matterhomogeneous populationshape formationdistributed network constructioninteracting automatarandom schedulewell-mixed solution

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14) Network protocols (68M12)

Related Items (5)

Simple and fast approximate counting and leader election in populations ⋮ Shape formation by programmable particles ⋮ Fault tolerant network constructors ⋮ On geometric shape construction via growth operations ⋮ On geometric shape construction via growth operations

Uses Software

• AmoebotSim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic function computation with chemical reaction networks
• Mediated population protocols
• Passively mobile communicating machines that use restricted space
• Computation with finite stochastic chemical reaction networks
• The computational power of population protocols
• Forming sequences of geometric patterns with oblivious mobile robots
• Computation in networks of passively mobile finite-state sensors
• Fast computation by population protocols with a leader
• Efficient reconfiguration of lattice-based modular robots
• Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
• On the Runtime of Universal Coating for Programmable Matter
• ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES
• Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles
• Active self-assembly of algorithmic shapes and patterns in polylogarithmic time
• The program-size complexity of self-assembled squares (extended abstract)
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
• On the Transformation Capability of Feasible Mechanisms for Programmable Matter
• Parallel Computation Using Active Self-assembly
• Exponential Replication of Patterns in the Signal Tile Assembly Model
• On utilizing speed in networks of mobile agents
• Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
• Timing in chemical reaction networks
• Random Walk and the Theory of Brownian Motion
• Simple and efficient local codes for distributed stable network construction

This page was built for publication: Terminating distributed construction of shapes and patterns in a fair solution of automata