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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Danos V, Krivine J and Tarissan J ‘Self Assembling Trees’. In: Proceedings of the 2005 Artifical Evolution Conference (to appear)
Danos V., Laneve C. (20030. Core formal molecular biology. LNCS 2618:302–318
Danos V, Laneve C (2004) `Formal molecular biology'. Theoretical Computer Science 325(1):69–110
Danos V., Tarissan F. (2005). Self assembling graphs. LNCS 3561:498–507
Drexler E and Smalley R (2003) `Controversy about molecular assemblers'. Available at www.foresight.org/NanoRev/Letter.html.
Hasty J., McMillen D., Collins J.J. (2002). Engineered gene circuits. Nature 420:224–230
Klavins E (2002) `Automatic synthesis of controllers for assembly and formation forming'. In: Proceedings of the International Conference on Robotics and Automation
Milner R (1999) Communicating and mobile systems: the π-calculus. Cambridge University Press, Cambridge
Nagpal R (2002) `Programmable self-assembly using biologically-inspired multiagent control', In: Autonomous Agents and Multiagent Systems Conference (AAMAS)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Danos, V., Tarissan, F. Self-assembling graphs. Nat Comput 6, 339–358 (2007). https://doi.org/10.1007/s11047-006-9013-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-006-9013-9