research
∙
08/21/2023
Weakly synchronous systems with three machines are Turing powerful
Communicating finite-state machines (CFMs) are a Turing powerful model o...
share
research
∙
10/24/2022
A partial order view of message-passing communication models
There is a wide variety of message-passing communication models, ranging...
research
∙
10/01/2021
Towards Generalised Half-Duplex Systems
FIFO automata are finite state machines communicating through FIFO queue...
research
∙
06/09/2020
A Complete Axiomatisation for Quantifier-Free Separation Logic
We present the first complete axiomatisation for quantifier-free separat...
research
∙
10/11/2019
Internal Calculi for Separation Logics
We present a general approach to axiomatise separation logics with heapl...
research
∙
09/04/2019
On the k-synchronizability of systems
In this paper, we work on the notion of k-synchronizability: a system is...
research
∙
09/04/2019
On the k-synchronizability for mailbox systems
Asynchronous bounded or unbounded message passing is ubiquitous in commu...
research
∙
10/12/2018