activity
20182024
most citedExecution-time opacity control for timed automata

3 citations · 3 across the 4 of their papers we have counts for

collaborators

6 papers

cs.FL2024

Synchronisability in Mailbox Communication

Cinzia Di Giusto, Laetitia Laversa, Kirstin Peters

We revisit the problem of synchronisability for communicating automata, i.e., whether the language of send messages for an asynchronous system is the same as the language of send m…

cs.CR2024★ 3 cited

Execution-time opacity control for timed automata

Étienne André, Marie Duflot, Laetitia Laversa +1

Timing leaks in timed automata (TA) can occur whenever an attacker is able to deduce a secret by observing some timed behaviour. In execution-time opacity, the attacker aims at ded…

cs.CL2022

A partial order view of message-passing communication models

Cinzia Di Giusto, Davide Ferré, Laetitia Laversa +1

There is a wide variety of message-passing communication models, ranging from synchronous ''rendez-vous'' communications to fully asynchronous/out-of-order communications. For larg…

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…