3 papers
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.DC2023
Proceedings 16th Interaction and Concurrency Experience
Clément Aubert, Cinzia Di Giusto, Simon Fowler +1
This volume contains the proceedings of ICE'23, the 16th Interaction and Concurrency Experience, which was held at the NOVA University in Lisbon, Portugal, as a satellite event of…
cs.FL2023
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata
Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel +1
We study the complexity relationship between three models of unbounded memory automata: nu-automata (-A), Layered Memory Automata (LaMA)and History-Register Automata (HRA). Thes…