activity
20052026
most citedSynchronizability of Communicating Finite State Machines is not Decidable

17 citations · 77 across the 18 of their papers we have counts for

collaborators

21 papers

cs.LO2026

HistMSO: A Logic for Reasoning about Consistency Models with MONA

Isabelle Coget, Étienne Lozes

Reasoning about consistency models for replicated data systems is a challenging task that requires a deep understanding of both the consistency models themselves and a large part o…

cs.FL2025★ 1 cited

On the Impact of the Communication Model on Realisability

Cinzia Di Giusto, Etienne Lozes, Pascal Urso

Multiparty Session Types (MPST) provide a type-theoretic foundation for specifying and verifying communication protocols in distributed systems. MPST rely on the notion of global t…

cs.FL2025★ 1 cited

Realisability and Complementability of Multiparty Session Types

Cinzia Di Giusto, Etienne Lozes, Pascal Urso

Multiparty session types (MPST) are a type-based approach for specifying message-passing distributed systems. They rely on the notion of global type specifying the global behaviour…

cs.CL2023

Weakly synchronous systems with three machines are Turing powerful

Cinzia Di Giusto, Davide Ferré, Etienne Lozes +1

Communicating finite-state machines (CFMs) are a Turing powerful model of asynchronous message-passing distributed systems. In weakly synchronous systems, processes communicate thr…

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.DC2021★ 2 cited

Towards Generalised Half-Duplex Systems

Cinzia Di Giusto, Loïc Germerie Guizouarn, Etienne Lozes

FIFO automata are finite state machines communicating through FIFO queues. They can be used for instance to model distributed protocols. Due to the unboundedness of the FIFO queues…