@inproceedings{39c4e54552244594bee3c081ab76c3ff,
title = "Self Assembling Graphs",
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{\textquoteright} original proposal [1], in that it relies only on point-to-point communication, and can deal with any assembly graph whereas Klavins{\textquoteright} method dealt only with trees.",
author = "Vincent Danos and Fabien Tarissan",
year = "2005",
doi = "10.1007/11499220_51",
language = "English",
isbn = "978-3-540-26298-5",
volume = "3561",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "498--507",
editor = "Jos{\'e} Mira and Jos{\'e}R. {\'A}lvarez",
booktitle = "Mechanisms, Symbols, and Models Underlying Cognition",
address = "United Kingdom",
}