167,527 research outputs found
Asynchronous spiking neural P systems
We consider here spiking neural P systems with a non-synchronized (i.e., asynchronous) use of rules: in any step, a neuron can apply or not apply its rules which are enabled by the number of spikes it contains (further spikes can come, thus changing the rules enabled in the next step). Because the time between two firings of the output neuron is now irrelevant, the result of a computation is the number of spikes sent out by the system, not the distance between certain spikes leaving the system. The additional non-determinism introduced in the functioning of the system by the non-synchronization is proved not to decrease the computing power in the case of using extended rules (several spikes can be produced by a rule). That is, we obtain again the equivalence with Turing machines (interpreted as generators of sets of (vectors of) numbers). However, this problem remains open for the case of standard spiking neural P systems, whose rules can only produce one spike. On the other hand we prove that asynchronous systems, with extended rules, and where each neuron is either bounded or unbounded, are not computationally complete. For these systems, the configuration reachability, membership (in terms of generated vectors), emptiness, infiniteness, and disjointness problems are shown to be decidable. However, containment and equivalence are undecidable. © 2009 Elsevier B.V. All rights reserved
Recommended from our members
A dynamic petri net model for iterative and interactive distributed multimedia presentation
Object Composition Petri Nets (OCPN), Priority Petri Nets (P-Net), Dynamic OCPN (DOCPN) and Enhanced P-Nets (EP-Net) have extended the original Petri Net to achieve the modeling of media synchronization and asynchronous user interactions during multimedia playback. Dynamic Petri Net (DPN) has been conceptualized to tackle existing problems in these two areas of modeling distributed multimedia systems. DPN features dynamic modeling elements which allows iteration and hence is able to reduce graph sizes of synchronous playback models while allowing greater details to be shown. DPN also introduces asynchronous event handling techniques that are powerful and effective. DPN was used in the design and modeling of a multimedia orchestration tool which is a typical representation of an application that works in a distributed multimedia system
Asynchronous Spiking Neural P Systems with Local Synchronization
Summary. Spiking neural P systems (SN P systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. Asynchronous SN P systems are non-synchronized systems, where the use of spiking rules (even if they are enabled by the contents of neurons) is not obligatory. In this paper, with a biological inspiration (in order to achieve some specific biological functioning, neurons from the same functioning motif or community work synchronously to cooperate with each other), we introduce the notion of local synchronization into asynchronous SN P systems. The computation power of asynchronous SN P systems with local synchronization is investigated. Such systems consisting of general neurons (resp. unbounded neurons) and using standard spiking rules are proved to be universal. Asynchronous SN P systems with local synchronization consisting of bounded neurons and using standard spiking rules characterize the semilinear sets of natural numbers. These results show that the local synchronization is useful, it provides some “programming capacity ” useful for achieving a desired computational power.
Asynchronous Spiking Neural P Systems with Local Synchronization
Spiking neural P systems (SN P systems, for short) are a class of distributed
parallel computing devices inspired from the way neurons communicate by means of
spikes. Asynchronous SN P systems are non-synchronized systems, where the use of spik-
ing rules (even if they are enabled by the contents of neurons) is not obligatory. In this
paper, with a biological inspiration (in order to achieve some speci c biological func-
tioning, neurons from the same functioning motif or community work synchronously to
cooperate with each other), we introduce the notion of local synchronization into asyn-
chronous SN P systems. The computation power of asynchronous SN P systems with
local synchronization is investigated. Such systems consisting of general neurons (resp.
unbounded neurons) and using standard spiking rules are proved to be universal. Asyn-
chronous SN P systems with local synchronization consisting of bounded neurons and
using standard spiking rules characterize the semilinear sets of natural numbers. These
results show that the local synchronization is useful, it provides some \programming
capacity" useful for achieving a desired computational power.Junta de Andalucía P08 – TIC 0420
Asynchronous Spiking Neural P Systems with Structural Plasticity
Spiking neural P (in short, SNP) systems are computing devices inspired
by biological spiking neurons. In this work we consider SNP systems with structural
plasticity (in short, SNPSP systems) working in the asynchronous (in short, asyn mode).
SNPSP systems represent a class of SNP systems that have dynamic synapses, i.e. neurons
can use plasticity rules to create or remove synapses. We prove that for asyn mode,
bounded SNPSP systems (where any neuron produces at most one spike each step)
are not universal, while unbounded SNPSP systems with weighted synapses (a weight
associated with each synapse allows a neuron to produce more than one spike each step)
are universal. The latter systems are similar to SNP systems with extended rules in
asyn mode (known to be universal) while the former are similar to SNP systems with
standard rules only in asyn mode (conjectured not to be universal). Our results thus
provide support to the conjecture of the still open problem.Ministerio de Economía y Competitividad TIN2012-3743
Asynchronous Spiking Neural P Systems with Multiple Channels and Symbols
Spiking neural P systems (SNP systems, in short) are a class of distributed parallel computation systems, inspired from the way that the neurons process and communicate information by means of spikes. A new variant of SNP systems, which works in asynchronous mode, asynchronous spiking neural P systems with multiple channels and symbols (ASNP-MCS systems, in short), is investigated in this paper. There are two interesting features in ASNP-MCS systems: multiple channels and multiple symbols. That is, every neuron has more than one synaptic channels to connect its subsequent neurons, and every neuron can deal with more than one type of spikes. The variant works in asynchronous mode: in every step, each neuron can be free to fire or not when its rules can be applied. The computational completeness of ASNP-MCS systems is investigated. It is proved that ASNP-MCS systems as number generating and accepting devices are Turing universal. Moreover, we obtain a small universal function computing device that is an ASNP-MCS system with 67 neurons. Specially, a new idea that can solve ``block'' problems is proposed in INPUT modules
No Cycles in Compartments. Starting from Conformon-P Systems
Starting from proofs of results about the computing power of conformon-
P systems, we infer several results about the power of certain classes of tissue-like P
systems with (cooperative) rewriting rules used in an asynchronous way, without cycles
in compartments. This last feature is related to an important restriction appearing when
dealing with lab implementations of P systems, that of avoiding local evolution loops of
objects
- …