Skip to main content
SpringerLink
Log in
Book cover

International Work-Conference on the Interplay Between Natural and Artificial Computation

IWINAC 2005: Mechanisms, Symbols, and Models Underlying Cognition pp 498–507Cite as

Self Assembling Graphs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3561))

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 [1], 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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Klavins, E.: Automatic synthesis of controllers for assembly and formation forming. In: Proceedings of the International Conference on Robotics and Automation (2002)

    Google Scholar 

  2. Drexler, E., Smalley, R.: Controversy about molecular assemblers (2003), Available at http://www.foresight.org/NanoRev/Letter.html

  3. Nagpal, R.: Programmable self-assembly using biologically-inspired multiagent control. In: Falcone, R., Barber, S.K., Korba, L., Singh, M.P. (eds.) AAMAS 2002. LNCS (LNAI), vol. 2631. Springer, Heidelberg (2003)

    Google Scholar 

  4. Hasty, J., McMillen, D., Collins, J.J.: Engineered gene circuits. Nature 420, 224–230 (2002)

    Article  Google Scholar 

  5. Milner, R.: Communicating and mobile systems: the π-calculus. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  6. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)

    Google Scholar 

  7. Danos, V., Laneve, C.: Core formal molecular biology. In: Degano, P. (ed.) ESOP 2003. LNCS, vol. 2618, pp. 302–318. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Vincent Danos

  2. Équipe PPS, Université Paris VII,  

    Fabien Tarissan

Authors
  1. Vincent Danos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabien Tarissan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. E.T.S.I. Informática, Universidad Nacional de Educación a Distancia, 28040, Madrid, Spain

    José Mira

  2. E.T.S. de Ingeniería Informática, Departamento de Intelifencia Artificial, Universidad Nacional de Educación a Distancia, Juan del Rosal, 16, 28040, Madrid, Spain

    José R. Álvarez

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Danos, V., Tarissan, F. (2005). Self Assembling Graphs. In: Mira, J., Álvarez, J.R. (eds) Mechanisms, Symbols, and Models Underlying Cognition. IWINAC 2005. Lecture Notes in Computer Science, vol 3561. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499220_51

Download citation

  • DOI: https://doi.org/10.1007/11499220_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26298-5

  • Online ISBN: 978-3-540-31672-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation