Self-assembling graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Natural Computing Année : 2006

Self-assembling graphs

Vincent Danos
Fabien Tarissan

Résumé

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 rulebased 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-topoint communication, and can deal with any assembly graph whereas Klavins' method dealt only with trees.

Dates et versions

hal-00150785 , version 1 (31-05-2007)

Identifiants

Citer

Vincent Danos, Fabien Tarissan. Self-assembling graphs. Natural Computing, 2006, 20 p. ⟨10.1007/s11047-006-9013-9⟩. ⟨hal-00150785⟩
27 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More