<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Mario J. Pérez-Jiménez</style></author><author><style face="normal" font="default" size="100%">Daniel Ramírez-Martínez</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A software tool for verification of Spiking Neural P Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Natural Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Membrane computing; Spiking Neural P systems; Transition diagram</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2008</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11047-008-9083-y</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">7</style></volume><pages><style face="normal" font="default" size="100%">485-497</style></pages><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">4</style></issue><notes><style face="normal" font="default" size="100%">online version (http://dx.doi.org/10.1007/s11047-008-9083-y)</style></notes></record></records></xml>