3 papers
cs.FL2021
Guessing the buffer bound for k-synchronizability
Cinzia Di Giusto, Laetitia Laversa, Etienne Lozes
A communicating system is -synchronizable if all of the message sequence charts representing the executions can be divided into slices of sends followed by receptions. I…
cs.FL2019
On the k-synchronizability of systems
Cinzia Di Giusto, Cinzia Giusto, Laetitia Laversa +1
In this paper, we work on the notion of k-synchronizability: a system is k-synchronizable if any of its executions, up to reordering causally independent actions, can be divided in…
q-bio.NC2018
Spiking Neural Networks modelled as Timed Automata with parameter learning
Elisabetta De Maria, Cinzia Di Giusto, Laetitia Laversa
In this paper we present a novel approach to automatically infer parameters of spiking neural networks. Neurons are modelled as timed automata waiting for inputs on a number of dif…