Formal languages
Stochastic Petri nets: an elementary introduction
Advances in Petri nets 1989
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Membrane Computing: An Introduction
Membrane Computing: An Introduction
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Computation: finite and infinite machines
Computation: finite and infinite machines
Fundamenta Informaticae
Normal forms for spiking neural P systems
Theoretical Computer Science
Cycles and communicating classes in membrane systems and molecular dynamics
Theoretical Computer Science
Termination Problems in Chemical Kinetics
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Computation with finite stochastic chemical reaction networks
Natural Computing: an international journal
Asynchronous spiking neural P systems: decidability and undecidability
DNA13'07 Proceedings of the 13th international conference on DNA computing
Analysis and simulation of dynamics in probabilistic p systems
DNA'05 Proceedings of the 11th international conference on DNA Computing
WMC'04 Proceedings of the 5th international conference on Membrane Computing
Time-free spiking neural p systems
Neural Computation
Parallel and distributed algorithms in p systems
CMC'11 Proceedings of the 12th international conference on Membrane Computing
| Hi-index | 0.00 |
In the area of membrane computing, time-freeness has been defined as the ability for a timed membrane system to produce always the same result, independently of the execution times associated to the rules. In this paper, we use a similar idea in the framework of spiking neural P systems, a model inspired by the structure and the functioning of neural cells. In particular, we introduce stochastic spiking neural P systems where the time of firing for an enabled spiking rule is probabilistically chosen and we investigate when, and how, these probabilities can influence the ability of the systems to simulate, in a reliable way, universal machines, such as register machines.