Towards a general methodology for formal verification on spiking neural P systems
P systems are non-deterministic, parallel and distributed models of computation inspired by the behaviour and structure of living cells. Spiking neural P systems synthesise the connections that exist between neurons in the human brain, using pulses as a form of transmission of information. Usually,...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/173302 |
| Acceso en línea: | https://hdl.handle.net/11441/173302 https://doi.org/10.1016/j.tcs.2024.114705 |
| Access Level: | acceso abierto |
| Palabra clave: | Membrane computing Spiking neural P systems Formal verification |
| Sumario: | P systems are non-deterministic, parallel and distributed models of computation inspired by the behaviour and structure of living cells. Spiking neural P systems synthesise the connections that exist between neurons in the human brain, using pulses as a form of transmission of information. Usually, when a spiking neural P system is defined to solve any problem, it is checked in several cases to know if it works for them. But this methodology is not sufficient to verify if the system always works in a correct way. In this work, we introduce a methodology to look for characteristics in computations of spiking neural P systems that can be used to formally verify that the model works as it is intended. |
|---|