Self-assembling graphs

Vincent Danos, Fabien Tarissan

Research output: Contribution to journalArticlepeer-review

Abstract

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 (Klavin, 2002: Automatic synthesis of controllers for assembly and formation forming. In: Proceedings of the International Conference on Robotics and Automation), in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins’ method dealt only with trees.
Original languageEnglish
Pages (from-to)339-358
Number of pages20
JournalNatural Computing
Volume6
Issue number3
DOIs
Publication statusPublished - Sep 2007

Keywords

  • Concurrency theory
  • distributed algorithm theory
  • process algebra

Fingerprint Dive into the research topics of 'Self-assembling graphs'. Together they form a unique fingerprint.

Cite this