2026-07-26T01:38:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:20794 2024-08-29T05:40:58Z ddc:004 open_access

An Automata-Based Approach for Synchronizable Mailbox Communication Delpy, Romain Muscholl, Anca Sutre, Grégoire Concurrent programming Mailbox communication Verification We revisit finite-state communicating systems with round-based communication under mailbox semantics. Mailboxes correspond to one FIFO buffer per process (instead of one buffer per pair of processes in peer-to-peer systems). Round-based communication corresponds to sequences of rounds in which processes can first send messages, then only receive (and receives must be in the same round as their sends). A system is called synchronizable if every execution can be re-scheduled into an equivalent execution that is a sequence of rounds. Previous work mostly considered the setting where rounds have fixed size. Our main contribution shows that the problem whether a mailbox communication system complies with the round-based policy, with no size limitation on rounds, is PSPACE-complete. For this we use a novel automata-based approach, that also allows to determine the precise complexity (PSPACE) of several questions considered in previous literature. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Romain Delpy and Anca Muscholl and Grégoire Sutre 2024 Is Part Of LIPIcs, Volume 311, 35th International Conference on Concurrency Theory (CONCUR 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2024.22 urn:nbn:de:0030-drops-207947 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2024.22 eng https://creativecommons.org/licenses/by/4.0/legalcode