Self Assembling Graphs

A self-assembly algorithm for synchronising agents and have them arrange according to a particular graph is given. This algorithm, expressed using an ad hoc rule-based process algebra, extends Klavins’ original proposal [1], in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins’ method dealt only with trees.

• Type: Conference
• Year: 2005
• Where: IWINAC
• Authors: Vincent Danos, Fabien Tarissan
• Keywords: Hoc Rule-based Process, IWINAC 2005, Particular Graph, Self-assembly Algorithm