A software tool for verification of Spiking Neural P Systems

Authors:
Miguel A. Gutiérrez-Naranjo;Mario J. Pérez-Jiménez;Daniel Ramírez-Martínez
Affiliations:
Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain;Research Group on Natural Computing, Department of Computer Science and Artificial Intelligence, University of Sevilla, Sevilla, Spain
Venue:
Natural Computing: an international journal
Year:
2008

Citing 13
Cited 0

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Molecular computation of solutions to combinatorial problems

Science
Computing with membranes

Journal of Computer and System Sciences
Membrane Computing: An Introduction

Membrane Computing: An Introduction
P System software simulator

Fundamenta Informaticae - Membrane computing
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Artificial Life Applications of a Class of P Systems: Abstract Rewriting Systems on Multisets

WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Tissue P systems

Theoretical Computer Science
Applications of Membrane Computing (Natural Computing Series)

Applications of Membrane Computing (Natural Computing Series)
Spiking Neural P Systems

Fundamenta Informaticae
A model of the quorum sensing system in vibrio fischeri using p systems

Artificial Life
Cyto-Sim

Bioinformatics
On descriptive complexity of p systems

WMC'04 Proceedings of the 5th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The formal verification of a Spiking Neural P System (SN P Systems, for short) designed for solving a given problem is usually a hard task. Basically, the verification process consists of the search of invariant formulae such that, once proved their validity, show the right answer to the problem. Even though there does not exist a general methodology for verifying SN P Systems, in (P驴un et al., Int J Found Comput Sci 17(4):975---1002, 2006) a new tool based on the transition diagram of the P system has been developed for helping the researcher in the search of invariant formulae. In this paper we show a software tool which allows to generate the transition diagram of an SN P System in an automatic way, so it can be considered as an assistant for the formal verification of such computational devices.