Limited Asynchronous Spiking Neural P Systems

• Autorzy: Pan L. , Wang J. , Hoogeboom H.J.
• Języki publikacji: EN

Abstrakty

EN

In a biological system, if a long enough time interval is given, an enabled chemical reaction will finish its reaction in the given time interval. With this motivation, it is natural to impose a bound on the time intervalwhen an enabled spiking rule in a spiking neural P system (SN P system, for short) remains unused. In this work, a new working mode of SN P systems is defined, which is called limited asynchronous mode. In an SN P system working in limited asynchronous mode, if a rule is enabled at some step, this rule is not obligatorily used. From this step on, if the unused rule may be used later, it should be used in the given time interval. If further spikes make the rule non-applicable, then the computation continues in the new circumstances. The computation result of a computation in an SN P system working in limited asynchronous mode is defined as the total number of spikes sent into the environment by the system. It is proved that limited asynchronous SN P systems with standard spiking rules are universal. If the number of spikes present in each neuron of a limited asynchronous SN P system with standard spiking rules is bounded during a computation, then the power of a limited asynchronous SN P system with standard spiking rules falls drastically, and we get a characterization of semilinear sets of numbers.

Słowa kluczowe

EN

membrane computing; spiking neural P systems; asynchronous models; turing computability

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2011
• Tom: Vol. 110, nr 1-4
• Strony: 271--293
• Opis fizyczny: Bibliogr. 10 poz., wykr.

Twórcy

autor

Pan L.

autor

Wang J.

autor

Hoogeboom H.J.

• Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333 CA Leiden, The Netherlands,

Bibliografia

• [1] Cavaliere, M., Egecioglu, O., Ibarra, O. H., Woodworth, S., Ionescu, M., Pǎun, Gh.: Asynchronous spiking neural P systems: decidability and undecidability. Proc. 13th International Meeting on DNA Computing, (Garzon,M. H., Yan, H. Eds.), LNCS 4848, Springer,Memphis, USA, 2008, 246-255.
• [2] Chen, H., Ionescu, M., Ishdorj, T.-O., Pǎun, A., Pǎun, Gh., Pérez-Jiménez, M.J.: Spiking neural P systems with extended rules: universality and languages. Natural Computing, 7(2), 2008, 147-166.
• [3] Ibarra, O. H., Leporari, A., Pǎun, A., Woodworth, S.: Spiking neural P systems. Chapter 13 in Handbook of Membrane Computing (Pǎun, Gh., Rozenberg, G., Salomaa, A. Eds.), Oxford University Press, 2010, 311-334.
• [4] Ibarra, O. H., Pǎun, A., Pǎun, G., et al.: Normal forms for spiking neural P systems. Theoretical Computer Science, 372, 2007, 196-217.
• [5] Ionescu, M., Pǎun, Gh., Yokomori, T.: Spiking neural P systems. Fundamenta Informaticae, 71(2-3), 2006, 279-308.
• [6] Minsky, M.: Computation - Finite and Infinite Machines. Prentice Hall, 1967.
• [7] Pǎun, Gh.: Membrane Computing - An Introduction. Springer-Verlag, 2002.
• [8] Rozenberg, G., Salomaa, A. eds.: Handbook of Formal Languages, 3 volumes. Springer-Verlag, Berlin, 1997.
• [9] Zeng, X., Zhang, X., Pan L.: Homogeneous spiking neural P systems. Fundamenta Informaticae, 97(1-2), 2009, 1-20.
• [10] The P System Web Page: http://ppage.psystems.eu.