Abstract
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. In this work, a discrete structure representation of SN P systems with extended rules and without delay is proposed. Specifically, matrices are used to represent SN P systems. In order to represent the computations of SN P systems by matrices, configuration vectors are defined to monitor the number of spikes in each neuron at any given configuration; transition net gain vectors are also introduced to quantify the total amount of spikes consumed and produced after the chosen rules are applied. Nondeterminism of the systems is assured by a set of spiking transition vectors that could be used at any given time during the computation. With such matrix representation, it is quite convenient to determine the next configuration from a given configuration, since it involves only multiplication and addition of matrices after deciding the spiking transition vector. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Zeng, X., Adorna, H., Martínez-Del-Amor, M. Á., Pan, L., & Pérez-Jiménez, M. J. (2010). Matrix representation of spiking neural P systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6501 LNCS, pp. 377–391). Springer Verlag. https://doi.org/10.1007/978-3-642-18123-8_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.