On Self-assembly in Population P Systems

  • Francesco Bernardini
  • Marian Gheorghe
  • Natalio Krasnogor
  • Jean-Louis Giavitto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3699)


We introduce a model of self-assembly P systems as devices that use some of the features of population P systems to progressively grow a graph structure by forming new bonds between the existing cells and some new cells which are brought into the system step by step. The new cells are then able to self-assemble locally either at the level of cells or at the level of neighbourhoods of cells by using bond-making rules according to a specific self-assembly model. We describe two self-assembly models, called respectively parallel single-point self-assembly and parallel multi-point self-assembly. Then, we precisely state the problem of programmable self-assembly for P systems as the problem of uniquely generating a given graph by means of self-assembly P systems. In this respect, we show how to define a self-assembly P systems that uniquely generates a complete binary tree by using a “minimal” set of resources.


Graph Structure Transformation Rule Seed Cell Transitive Closure Derivation Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abelson, H., Allen, D., Coore, D., Hanson, C., Homsy, G., Knight, F.T., Nagpal, R., Rauch, E., Sussman, J.G., Weiss, R.: Amorphous Computing. Communication of the ACM 43, 74–82 (2000)CrossRefGoogle Scholar
  2. 2.
    Bernardini, F., Gheorghe, M.: Population P Systems. Journal of Universal Computer Science 20, 509–539 (2002)Google Scholar
  3. 3.
    Giavitto, J.-L., Michel, O.: The Topological Structure of Membrane Computing. Fundamenta Informaticae 49, 107–129 (2002)MathSciNetGoogle Scholar
  4. 4.
    Klavins, E.: Automatic Synthesis of Controllers for Assembly and Formation Forming. In: Proceedings of the International Conference on Robotics and Automation (2002)Google Scholar
  5. 5.
    Krasnogor, N., Gustafson, S.: A Family of Conceptual Problems in the Automated Design of Systems Self-Assembly. In: Proceedings of the 2nd International Conference on the Foundations of Nanoscience: Self-Assembled Architectures and Devices (2005)Google Scholar
  6. 6.
    Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  7. 7.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1-3. Springer, Heidelberg (1997)zbMATHGoogle Scholar
  8. 8.
    Winfree, E.: Algorithmic Self-Assembly of DNA. PhD Thesis, California Institute of Technology (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Francesco Bernardini
    • 1
  • Marian Gheorghe
    • 1
  • Natalio Krasnogor
    • 2
  • Jean-Louis Giavitto
    • 3
  1. 1.Department of Computer ScienceThe University of Sheffield, Regent CourtSheffieldUK
  2. 2.Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science and Information TechnologyUniversity of NottinghamNottinghamUK
  3. 3.Laboratoire de Méthodes Informatiques UMR 8042CNRS-Univesité d’Evry, Tour Evry 2, GENOPOLE 523EvryFrance

Personalised recommendations