Simulating Boolean Circuits with P Systems

  • Rodica Ceterchi
  • Dragoş Sburlan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2933)


We propose a model for simulating Boolean circuits with P systems. The simulation is done in two steps, by first simulating the gates of such a circuit, and next by showing how these can be combined to obtain actual circuits. The type of P systems used is with symbol objects, context-free rewriting rules and some other features like mobile catalysts, weak priorities and promoters.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Greenlaw, R., Hoover, H.J.: Parallel Computation, Algorithms and Theory of Computation Handbook. In: Atallah, M.J. (ed.). CRC Press, Boca Raton (1999)Google Scholar
  2. 2.
    Ogihara, M., Ray, A.: Simulating Boolean Circuits on a DNA Computer. Technical Report 631, Department of Computer Science, Rutgers University (1996)Google Scholar
  3. 3.
    Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)MATHGoogle Scholar
  4. 4.
    Paun, G., Rozenberg, G.: A Guide to Membrane Computing. Theoretical Computer Science 287(1), 73–100 (2002)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Rodica Ceterchi
    • 1
    • 3
  • Dragoş Sburlan
    • 2
    • 3
  1. 1.Faculty of Mathematics and Computer ScienceUniversity of BucharestRomânia
  2. 2.Faculty of Mathematics and Computer ScienceOvidius University of ConstanţaRomânia
  3. 3.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations