On the send-synchronizability problem for mailbox communication

DOI10.4230/LIPICS.CONCUR.2025.15MaRDI QIDQ7310286zbMATH OpenFDO

Authors Romain Delpy, Anca Muscholl, Grégoire Sutre

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2025.15

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A theory of regular MSC languages
• An automata-based approach for synchronizable mailbox communication
• Communicating automata
• Complete multiparty session type projection with automata
• Generalising Projection in Asynchronous Multiparty Session Types.
• Guessing the Buffer Bound for k-Synchronizability
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 7730616 (Why is no real title available?)
• On communicating automata with bounded channels
• On Communicating Finite-State Machines
• On deciding synchronizability for asynchronously communicating systems
• On the k-synchronizability of systems
• On the completeness of verifying message passing programs under bounded asynchrony
• Synchronisability in mailbox communication
• Synchronizability for Verification of Asynchronously Communicating Systems
• Synchronizability of communicating finite state machines is not decidable
• Synchronizability of communicating finite state machines is not decidable
• Time, clocks, and the ordering of events in a distributed system
• Verifying programs with unreliable channels
• Well-structured transition systems everywhere!

This page was built for publication: On the send-synchronizability problem for mailbox communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310286)