Skip to main content

Advertisement

Springer Nature Link
Log in

Self-assembling graphs

  • Published:
Natural Computing Aims and scope Submit manuscript

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

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

    Google Scholar 

  • Danos V, Laneve C (2004) `Formal molecular biology'. Theoretical Computer Science 325(1):69–110

    Google Scholar 

  • Danos V., Tarissan F. (2005). Self assembling graphs. LNCS 3561:498–507

    Google Scholar 

  • 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

    Article  Google Scholar 

  • 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)

Download references

Author information

Authors and Affiliations

  1. Équipe PPS, CNRS & Université, Paris VII, France

    Vincent Danos & Fabien Tarissan

Authors
  1. Vincent Danos
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Fabien Tarissan
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Vincent Danos.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11047-006-9013-9

Keywords