Skip to main content

P Systems with Symport/Antiport and Time

  • Conference paper
Membrane Computing (WMC 2006)

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

Included in the following conference series:

Abstract

We consider symport/antiport P systems using the time as the support for the output of a computation. We describe and study the properties of “timed symport/antiport systems”, showing that this new model of membrane systems based on time has more power/flexibility, and thus allows us to improve previous universality results. We were able to improve or match the best results concerning the symport/antiport systems which consider the output as originally defined as the number of molecules found in a pre-defined elementary membrane in the halting configuration of the system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alhazov, A., Freund, R., Rogozhin, Y.: Some Optimal Results on Symport/Antiport P Systems with Minimal Cooperation. In: Gutiérrez-Naranjo, M.A., et al. (eds.) Cellular Computing (Complexity Aspects), ESF PESC Exploratory Workshop, Fénix Editora, Sevilla, pp. 23–36 (2005)

    Google Scholar 

  2. Alhazov, A., Freund, R., Rogozhin, Y.: Computational Power of Symport/Antiport: History, Advances, and Open Problems. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 1–30. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Bernardini, F., Păun, A.: Universality of Minimal Symport/Antiport: Five Membranes Suffice. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 43–54. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Cavaliere, M., Freund, R., Păun, G.: Event–Related Outputs of Computations in P Systems. In: Gutiérrez-Naranjo, M.A., et al. (eds.) Cellular Computing (Complexity Aspects), ESF PESC Exploratory Workshop, Fénix Editora, Sevilla, pp. 107–122 (2005)

    Google Scholar 

  5. Freund, R., Păun, A.: Membrane Systems with Symport/Antiport Rules: Universality Results. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 270–287. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  6. Frisco, P., Hogeboom, J.H.: P systems with Symport/Antiport Simulating Counter Automata. Acta Informatica 41, 145–170 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Frisco, P., Ji, S.: Towards a Hierarchy of Conformons-P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol. 2597, pp. 302–318. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Ibarra, O.H., Păun, A.: Counting Time in Computing with Cells. In: Proceedings of DNA11 conference, London Ontario, Canada, June 6-9, 14 pages (2005)

    Google Scholar 

  9. Ionescu, M., Păun, G., Yokomori, T.: Spiking Neural P Systems. Fundamenta Informaticae 71(2-3), 279–308 (2006)

    MATH  MathSciNet  Google Scholar 

  10. Minsky, M.L.: Recursive Unsolvability of Post’s Problem of “Tag” and Other Topics in Theory of Turing Machines. Annals of Mathematics 74, 437–455 (1961)

    Article  MathSciNet  Google Scholar 

  11. Păun, A., Păun, G.: The Power of Communication: P Systems with Symport/Antiport. New Generation Computing 20(3), 295–306 (2002)

    Article  MATH  Google Scholar 

  12. Păun, G.: Further Twenty-six Open Problems in Membrane Computing. In: The Third Brainstorming Meeting on Membrane Computing, Sevilla, Spain (February 2005)

    Google Scholar 

  13. Păun, G., Pérez-Jiménez, M.J., Sancho-Caparrini, F.: On the Reachability Problem for P Systems with Symport/Antiport. In: Proc. Automata and Formal Languages Conf., Debrecen, Hungary (2002)

    Google Scholar 

  14. Păun, G., Pérez-Jiménez, M.J., Rozenberg, G.: Spike Trains in Spiking Neural P Systems. International Journal of Foundations of Computer Science (in press)

    Google Scholar 

  15. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Berlin (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagda, H., Păun, A., Rodríguez-Patón, A. (2006). P Systems with Symport/Antiport and Time. In: Hoogeboom, H.J., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2006. Lecture Notes in Computer Science, vol 4361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963516_29

Download citation

  • DOI: https://doi.org/10.1007/11963516_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69088-7

  • Online ISBN: 978-3-540-69090-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics