Synchronisability in mailbox communication

DOI10.4204/EPTCS.412.3MaRDI QIDQ6940581zbMATH OpenFDO

Authors Cinzia Di Giusto, Laetitia Laversa, Kirstin Peters

Publication date 19 August 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.412.3

Mathematics Subject Classification ID

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

Cites work

• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A variant of a recursively unsolvable problem
• Communicating automata
• Guessing the Buffer Bound for k-Synchronizability
• scientific article; zbMATH DE number 7730616 (Why is no real title available?)
• 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
• On the diversity of asynchronous communication
• Synchronizability of communicating finite state machines is not decidable
• Synchronous, asynchronous, and causally ordered communication
• Time, clocks, and the ordering of events in a distributed system

Cited in

(2)

• An automata-based approach for synchronizable mailbox communication
• On the send-synchronizability problem for mailbox communication

This page was built for publication: Synchronisability in mailbox communication

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