Self-assembling Graphs - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

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 rule-based process algebra, extends Klavins' original proposal, in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins' method dealt only with trees.

Dates et versions

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

Identifiants

Citer

Vincent Danos, Fabien Tarissan. Self-assembling Graphs. International Work-conference on the Interplay between Natural and Artificial Computation (IWINAC'05), 2005, Las Palmas de Gran Canaria, Spain. pp.498-507, ⟨10.1007/b137289⟩. ⟨hal-00150794⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More