Asynchronous P Systems and P Systems Working in the Sequential Mode

  • Rudolf Freund
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3365)

Abstract

In the area of P systems, applying the rules in a maximally parallel way is one of the most common features of many models introduced so far. Whereas the idea of membranes as well as many operations and rules used in membrane systems have a concrete biological background, the universal clock assumed to control the parallel application of rules is unrealistic, but on the other hand relevant for many interesting theoretical results, especially when proving computational completeness and solving computationally hard problems. Based on a quite general definition of tissue P systems, we investigate several models of P systems and compare their computational power in the classic case (i.e., applying the rules in the maximally parallel mode) and in the case of applying the rules in an asynchronous way (i.e., an arbitrary number of rules may be applied in one derivation step) or in the sequential mode (i.e., exactly one rule is applied in one derivation step). Moreover, we also recall some results for (tissue) P systems working in an asynchronous or sequential mode already in the original definition. Finally, we also raise several questions for future research in this subarea of (tissue) P systems working in the asynchronous mode and (tissue) P systems working in the sequential mode.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Besozzi, D., Csuhaj-Varjú, E., Mauri, G., Zandron, C.: Size and power of extended gemmating P systems. In: [24], pp. 92–101 (2004)Google Scholar
  2. 2.
    Besozzi, D., Mauri, G., Păun, G., Zandron, C.: Gemmating P systems: collapsing hierarchies. Theoretical Computer Science 296(2), 253–267 (2003)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Besozzi, D., Zandron, C., Mauri, G., Sabadini, N.: P systems with gemmation of mobile membranes. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 136–153. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Cavaliere, M., Sburlan, D.: Time-Independent P Systems. This volumeGoogle Scholar
  5. 5.
    Csuhaj-Varjú, E., Dassow, J., Kelemen, J., Păun, G.: Grammar Systems: A Grammatical Approach to Distribution and Cooperation. Gordon and Breach, London (1994)MATHGoogle Scholar
  6. 6.
    Csuhaj-Varjú, E., Vaszil, G.: Reducing the size of extended gemmating P systems. This volumeGoogle Scholar
  7. 7.
    Dang, Z., Ibarra, O.H.: On P systems operating in sequential mode. In: Ilie, L., Wotschke, D. (eds.) Pre-proceedings of the Workshop Descriptional Complexity of Formal Systems (DCFS) 2004. Report No. 619, Univ. of Western Ontario, London, Canada, pp. 164–177 (2004)Google Scholar
  8. 8.
    Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)Google Scholar
  9. 9.
    Freund, R., Freund, F., Margenstern, M., Oswald, M., Rogozhin, Y., Verlan, S.: P systems with cutting/recombination rules assigned to membranes. In: Martín-Vide, C., Mauri, G., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol. 2933, pp. 191–202. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Freund, R.: Generalized P systems. In: Ciobanu, G., Păun, G. (eds.) FCT 1999. LNCS, vol. 1684, pp. 281–292. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  11. 11.
    Freund, R., Freund, F.: Molecular computing with generalized homogeneous P-systems. In: Condon, A., Rozenberg, G. (eds.) DNA Based Computers, Proceedings DNA 6, Leiden, pp. 113–125 (2000)Google Scholar
  12. 12.
    Freund, R.: Sequential P-systems. Romanian Journal of Information Science and Technology 4(1-2), 77–88 (2001)Google Scholar
  13. 13.
    Freund, R., Kari, L., Oswald, M., Sosík, P.: Computationally universal P systems without priorities: Two catalysts are sufficient. To appear in Theoretical Computer ScienceGoogle Scholar
  14. 14.
    Freund, R., Leporati, A., Oswald, M., Zandron, C.: Sequential P systems with unit rules and energy assigned to membranes. In: [22], pp.168–182 (2004)Google Scholar
  15. 15.
    Freund, R., Păun, G.: Deterministic P systems. (2004) (Submitted)Google Scholar
  16. 16.
    Freund, R., Păun, G., Pérez Jiménez, M.J.: Tissue-like P systems with channel states. In: [22], 206–223 (2004)Google Scholar
  17. 17.
    Freund, R.: P systems working in the sequential mode on arrays and strings. In: Proceedings Developments in Language Theory 2004 (to appear)Google Scholar
  18. 18.
    Frisco, P.: About P systems with symport/antiport. In: [22], pp. 224–236 (2004)Google Scholar
  19. 19.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)MATHGoogle Scholar
  20. 20.
    Păun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108–143 (2000); and TUCS Research Report 208 (1998) http://www.tucs.fi MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Păun, G.: Membrane Computing: An Introduction. Springer, Berlin (2002)Google Scholar
  22. 22.
    Păun, G., Nuñez, A.R., Jiménez, A.R., Caparrini, F.S.: Second Braainstorming Week on Membrane Computing. Dept. of Computer Sciences and Artificial Intelligence, Univ. of Sevilla Tech. Report 01/2004, Sevilla, Spain (February 2004)Google Scholar
  23. 23.
    The P Systems Web Page: http://psystems.disco.unimib.it/ Google Scholar
  24. 24.
    Salomaa, A., Rozenberg, G. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Rudolf Freund
    • 1
  1. 1.Faculty of InformaticsVienna University of TechnologyWienAustria

Personalised recommendations