Pulsed neural networks
Journal of Computer and System Sciences
Handbook of Formal Languages
Membrane Computing: An Introduction
Membrane Computing: An Introduction
Spiking Neuron Models: An Introduction
Spiking Neuron Models: An Introduction
Computation: finite and infinite machines
Computation: finite and infinite machines
Time and Synchronization in Membrane Systems
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Fundamenta Informaticae
Experiments on the reliability of stochastic spiking neural P systems
Natural Computing: an international journal
Asynchronous spiking neural P systems
Theoretical Computer Science
Homogeneous Spiking Neural P Systems
Fundamenta Informaticae
The Oxford Handbook of Membrane Computing
The Oxford Handbook of Membrane Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Parallel and distributed algorithms in p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
International Journal of Computing Science and Mathematics
Reversible spiking neural P systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Universality of sequential spiking neural P systems based on minimum spike number
Theoretical Computer Science
| Hi-index | 0.00 |
Different biological processes take different times to be completed, which can also be influenced by many environmental factors. In this work, a realistic definition of nonsynchronized spiking neural P systems (SN P systems, for short) is considered: during the work of an SN P system, the execution times of spiking rules cannot be known exactly (i.e., they are arbitrary). In order to establish robust systems against the environmental factors, a special class of SN P systems, called time-free SN P systems, is introduced, which always produce the same computation result independent of the execution times of the rules. The universality of time-free SN P systems is investigated. It is proved that these P systems with extended rules (several spikes can be produced by a rule) are equivalent to register machines. However, if the number of spikes present in the system is bounded, then the power of time-free SN P systems falls, and in this case, a characterization of semilinear sets of natural numbers is obtained.