%0 Generic
%D 2010
%T On spiking neural P systems
%A Oscar Ibarra
%A Mario J. Pérez-Jiménez
%A Takashi Yokomori
%C Amsterdam, Netherlands
%I Springer Verlag
%K Asynchronous
%K Finite automaton
%K Finite state transducer
%K Formal Verification
%K Sequential
%K Spiking neural P system
%K Systolic trellis automaton
%K Universality
%N 2
%P 475-491
%R 10.1007/s11047-009-9159-3
%U http://www.springerlink.com/content/krhu646461138370/
%V 9
%X This work deals with several aspects concerning the formal verification of SN P systems and the computing power of some variants. A methodology based on the information given by the transition diagram associated with an SN P system is presented. The analysis of the diagram cycles codifies invariants formulae which enable us to establish the soundness and completeness of the system with respect to the problem it tries to resolve. We also study the universality of asynchronous and sequential SN P systems and the capability these models have to generate certain classes of languages. Further, by making a slight modification to the standard SN P systems, we introduce a new variant of SN P systems with a special I/O mode, called SN P modules, and study their computing power. It is demonstrated that, as string language acceptors and transducers, SN P modules can simulate several types of computing devices such as finite automata, a-finite transducers, and systolic trellis automata.
%8 06/2010