scispace - formally typeset
Book ChapterDOI

Representation of Spiking Neural P Systems with Anti-spikes through Petri Nets

01 Dec 2010-pp 651-658

TL;DR: A formal method based on Petri nets is proposed, which provides a natural and powerful framework to formalize SN P systems with anti-spikes, which enables the use of existing tools for Petrinets to study the computability and behavioural properties of SN P system withAnti-spike.

AbstractSpiking Neural P(SN P) system with anti-spikes uses two types of objects called spikes and anti-spikes which can encode binary digits in a natural way. We propose a formal method based on Petri nets, which provides a natural and powerful framework to formalize SN P systems with anti-spikes. This enables the use of existing tools for Petri nets to study the computability and behavioural properties of SN P systems with anti-spikes.

...read more

Content maybe subject to copyright    Report


Citations
More filters
Journal ArticleDOI
TL;DR: A novel method of constructing logic circuits that work in a neural-like manner is demonstrated, as well as shed some lights on potential directions of designing neural circuits theoretically.
Abstract: In biological nervous systems, the operation of interacting neurons depends largely on the regulation from astrocytes. Inspired by this biological phenomenon, spiking neural P systems, i.e. SN P systems, with astrocyte-like control were proposed and were proven to have "Turing completeness" as computing models. In this work, the application of such systems for creating logical operators is investigated. Specifically, it is obtained in a constructive way that SN P systems with astrocyte-like control can synthesize the operations of Boolean logic gates, i.e. AND, OR, NOT, NOR, XOR and NAND gates. The resulting systems are simple and homogeneous, which means only one type of neuron with a unique spiking rule is used. With these neural-like logic gates, more complex Boolean circuits with cascade connections can be constructed. As such, they can be used to implement finite computing devices, such as the finite transducers. These results demonstrate a novel method of constructing logic circuits that work in a neural-like manner, as well as shed some lights on potential directions of designing neural circuits theoretically.

104 citations

Journal ArticleDOI
TL;DR: A methodology to simulate SN PA systems using a Petri net tool called Pnet Lab provides a promising way to represent typical working processes of these systems because of its parallel execution semantics and appropriateness.
Abstract: Petri Nets are promising methods for modelling and simulating biological systems. Spiking Neural P system with anti-spikes (SN PA systems) is a biologically inspired computing model that incorporates two types of objects called spikes and anti-spikes thus representing binary information in a natural way. In this paper, we propose a methodology to simulate SN PA systems using a Petri net tool called Pnet Lab. It provides a promising way for SN PA systems because of its parallel execution semantics and appropriateness to represent typical working processes of these systems. This enables us to verify system properties, system soundness and to simulate the dynamic behaviour.

11 citations


Cites methods from "Representation of Spiking Neural P ..."

  • ...In [8,9], SN P systems with delay and SN P systems with anti-spikes are translated into new variants of Petri net models....

    [...]


References
More filters
Journal Article
TL;DR: In this article, the authors introduce a class of neural-like P systems which they call spiking neural P systems (in short, SN P systems), in which the result of a computation is the time between the moments when a specified neuron spikes.
Abstract: This paper proposes a way to incorporate the idea of spiking neurons into the area of membrane computing, and to this aim we introduce a class of neural-like P systems which we call spiking neural P systems (in short, SN P systems). In these devices, the time (when the neurons fire and/or spike) plays an essential role. For instance, the result of a computation is the time between the moments when a specified neuron spikes. Seen as number computing devices, SN P systems are shown to be computationally complete (both in the generating and accepting modes, in the latter case also when restricting to deterministic systems). If the number of spikes present in the system is bounded, then the power of SN P systems falls drastically, and we get a characterization of semilinear sets. A series of research topics and open problems are formulated.

589 citations

Journal ArticleDOI
TL;DR: This simple extension of spiking neural P systems is shown to considerably simplify the universality proofs in this area, where all rules become of the form bc → b′ or bc → lambda , where b,b′ are spikes or anti-spikes.
Abstract: Besides usual spikes employed in spiking neural P systems, we consider “anti-spikes", which participate in spiking and forgetting rules, but also annihilate spikes when meeting in the same neuron. This simple extension of spiking neural P systems is shown to considerably simplify the universality proofs in this area: all rules become of the form bc → b′ or bc → lambda , where b,b′ are spikes or anti-spikes. Therefore, the regular expressions which control the spiking are the simplest possi- ble, identifying only a singleton. A possible variation is not to produce anti-spikes in neurons, but to consider some “inhibitory synapses", which transform the spikes which pass along them into anti-spikes. Also in this case, universality is rather easy to obtain, with rules of the above simple forms.

157 citations

Book ChapterDOI
Kurt Jensen1
02 Apr 1997
TL;DR: Coloured Petri Nets (CP-nets or CPN) is a graphical oriented language for design, specification, simulation and verification of systems well-suited for systems in which communication, synchronisation and resource sharing are important.
Abstract: Coloured Petri Nets (CP-nets or CPN) is a graphical oriented language for design, specification, simulation and verification of systems. It is in particular well-suited for systems in which communication, synchronisation and resource sharing are important. Typical examples of application areas are communication protocols, distributed systems, imbedded systems, automated production systems, work flow analysis and VLSI chips.

129 citations

01 Jan 2011
TL;DR: This work brings together two topics recently introduced in membrane computing, the much investigated spiking neural P systems and the distributed P systems, and introduces SN dP systems, with the possibility to input, at their request, spikes from the environment.

108 citations