Skip to main content

Regulating Rule Application with Membrane Boundaries in P Systems

  • Conference paper
  • First Online:
Book cover Membrane Computing (CMC 2015)

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

Included in the following conference series:

Abstract

Recently a new framework based on multiset approximation spaces were introduced for modeling the abstract notion of “closeness to membranes” in P systems. In real biotic/chemical interactions, however, objects not only have to be close enough to membranes, so that they are able to pass through them, but they also need to be in an unstable state, in a state where they are ready to engage into any type of interactions at all. In order to develop these ideas, we employ multiset approximation spaces for the description of stability and instability. We also demonstrate how the applicability and the use of reaction rules can be regulated during computations using the notion of membrane boundaries. An important feature of this type of regulation is the fact that it does not rely on the maximal parallel way of rule application, therefore it can be used to enhance the computational power of systems with asynchronous, sequential, or any other type of derivation modes. As an example, we show how P systems can generate any recursively enumerable set of numbers independently of the applied derivation mode, which is interesting, since without membrane boundaries asynchronous or sequential systems generate the Parikh sets of matrix languages only.

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 EPUB and 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

References

  1. Csajbók, Z.E.H., Mihálydeák, T.: Maximal parallelism in membrane systems with generated membrane boundaries. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds.) CiE 2014. LNCS, vol. 8493, pp. 103–112. Springer, Heidelberg (2014)

    Google Scholar 

  2. 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. Springer, Heidelberg (2003)

    Google Scholar 

  3. Mihálydeák, T., Csajbók, Z.E.H.: Membranes with boundaries. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds.) CMC 2012. LNCS, vol. 7762, pp. 277–294. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Mihálydeák, T., Csajbók, Z.E.H., Takács, P.: Communication rules controlled by generated membrane boundaries. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 265–279. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  5. Minsky, M.: Computation - Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  6. Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11(5), 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    Book  MATH  Google Scholar 

  8. Păun, A., Păun, G.: The power of communication: P systems with symport/antiport. New Gener. Comput. 20(3), 295–305 (2002)

    Article  MATH  Google Scholar 

  9. Păun, G.: Computing with membranes. J. Comput. Syst. Sci. 61(1), 108–143 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)

    Book  Google Scholar 

  11. Păun, G., Rozenberg, G., Salomaa, A. (eds.): Oxford Handbooks. Oxford University Press Inc., New York (2010)

    MATH  Google Scholar 

  12. Sosík, P.: P systems versus register machines: two universality proofs. In: Păun, G., Zandron, C. (eds.) Pre-Proceedings of Workshop on Membrane Computing (WMC-CdeA2002), pp. 371–382. Romania, Curtea de Argeş (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to György Vaszil .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mihálydeák, T., Vaszil, G. (2015). Regulating Rule Application with Membrane Boundaries in P Systems. In: Rozenberg, G., Salomaa, A., Sempere, J., Zandron, C. (eds) Membrane Computing. CMC 2015. Lecture Notes in Computer Science(), vol 9504. Springer, Cham. https://doi.org/10.1007/978-3-319-28475-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28475-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28474-3

  • Online ISBN: 978-3-319-28475-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics