# Formal Validation of Neural Networks as Timed Automata

We propose a formalisation of spiking neural networks based on timed automata networks. Neurons are modelled as timed automata waiting for inputs on a number of different channels (synapses), for a given amount of time (the accumulation period). When this period is over, the current potential value is computed taking into account the current inputs and the previous decayed potential value. If the current potential overcomes a given threshold , the automaton emits a broadcast signal over its output channel, otherwise it restarts another accumulation period. After each emission, the automaton is constrained to remain inactive for a fixed refractory period . Spiking neural networks are formalised as sets of automata, one for each neuron, running in parallel and sharing channels according to the structure of the network. The model is then validated against some crucial properties defined via proper temporal logic formulae

*Neural networks, Leaky Integrate and Fire Model, Timed Automata, Temporal Logic, Model Checking*

```
BibTeX | EndNote | ACM Ref
@inproceedings{DeMaria:2017:FVN:3156346.3156350,
author = {De Maria, Elisabetta and Di Giusto, Cinzia and Ciatto, Giovanni},
title = {Formal Validation of Neural Networks As Timed Automata},
booktitle = {Proceedings of the 8th International Conference on Computational Systems-Biology and Bioinformatics},
series = {CSBio '17},
year = {2017},
isbn = {978-1-4503-5350-2},
location = {Nha Trang City, Viet Nam},
pages = {15--22},
numpages = {8},
url = {http://doi.acm.org/10.1145/3156346.3156350},
doi = {10.1145/3156346.3156350},
acmid = {3156350},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Leaky Integrate and Fire Model, Model Checking, Neural networks, Temporal Logic, Timed Automata},
}
```