On P Systems and Almost Periodicity

• Autorzy: Bernardini F. , Gheorghe M. , Manca V.
• Języki publikacji: EN

Abstrakty

EN

The study of P systems as a mathematical model for biological systems is an important research topic in the area of membrane computing. In this respect, the detection of periodicity and almost periodicity as aspects of the system dynamics seems to be of particular relevance for understanding many biological processes and their related phenomena. This paper introduces specific notions of periodicity and almost periodicity for (infinite) sequences of multisets, which are used to describe the dynamics of P systems. Specifically, a variant of P systems, called P systems with resources, is considered where the rules always consume a certain amount of resources, which are provided in the form of a periodic input sequence of multisets. It is then shown that P systems with resources are computationally complete (when halting computations are considered) and that, in general, they can generate sequences of multisets that are not even almost periodic (once the constraint of having halting computation is released). However, if P systems with resources are restricted to be deterministic, it is shown that a characterization of the behaviour of a particular class of P systems with resources can be obtained in terms of almost periodicty.

Słowa kluczowe

EN

membrane computing; P systems; periodicity; almost periodicity; biological model

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2005
• Tom: Vol. 64, nr 1-4
• Strony: 29--42
• Opis fizyczny: Bibliogr. 11 poz.

Twórcy

autor

Bernardini F.

• Department of Computer Science, Sheffeld University, Regent Court, Portobello Street, Sheffield, SI 4DP, UK

autor

Gheorghe M.

• Department of Computer Science, Sheffeld University, Regent Court, Portobello Street, Sheffield, SI 4DP, UK

autor

Manca V.

• Department of Computer Science University of Verona strada Le Grazie 15, 37134 Verona, Italy

Bibliografia

• [1] Bernardini, F., Manca, V.: Dynamical Aspects of P Systems, Biosystems, 70(2), 2003, 82–93.
• [2] Besozzi, D.: Computational and Modelling Power of P systems, Ph.D. Thesis, Universit`a degli Studi di Milano, Milan, Italy, 2004.
• [3] Bianco, L., Fontana, F., Franco, G., Manca, V.: P Systems for Biological Dynamics, 2004, Submitted.
• [4] Freund, R., Kari, L., Oswald, M., Sosik, P.: Computational Universal P Systems without Priorities: Two Catalysts are Sufficient, 2003, Submitted.
• [5] Marcus, S.: Quasiperiodic Infinite Words, Bulletin of EATCS, 82, 2004, 170–174.
• [6] Marcus, S., P˘aun, Gh.: Infinite (Almost Periodic) Words, Formal Languages and Dynamical Systems, Bulletin of EATCS, 54, 1994, 224–232.
• [7] Martin-Vide, C., Mauri, G., Păun, Gh., Rozenberg, G., Salomaa, A., Eds.: Membrane Computing. International Workshop, WMC 2003, Tarragona, Spain, July 2003. Revised Papers, number 2933 in LNCS, Springer, Berlin Heidelberg New York, 2004.
• [8] Păun, Gh.: Computing with Membranes, Journal of Computer and System Sciences, 61(1), 2000, 108–143.
• [9] Păun, Gh.: Membrane Computing. An Introduction, Natural Computing Series, Springer, Berlin Heidelberg New York, 2002.
• [10] Păun, Gh., Rozenberg, G., Salomaa, A., Zandron, C., Eds.: Membrane Computing. International Workshop, WMC-CdeA 02, Curtea de Arges, Romania, August 19-23, 2002. Revised Papers, number 2597 in LNCS, Springer, Berlin Heidelberg New York, 2003.
• [11] Rozenberg, G., Salomaa, A., Eds.: Handbook of Formal Languages, vol. 1–3, Springer, Berlin Heidelberg New York, 1997.