Alain Finkel ; Etienne Lozes - Synchronizability of Communicating Finite State Machines is not Decidable

lmcs:4764 - Logical Methods in Computer Science, December 20, 2023, Volume 19, Issue 4 - https://doi.org/10.46298/lmcs-19(4:33)2023
Synchronizability of Communicating Finite State Machines is not DecidableArticle

Authors: Alain Finkel ; Etienne Lozes

    A system of communicating finite state machines is synchronizable if its send trace semantics, i.e.the set of sequences of sendings it can perform, is the same when its communications are FIFO asynchronous and when they are just rendez-vous synchronizations. This property was claimed to be decidable in several conference and journal papers for either mailboxes or peer-to-peer communications, thanks to a form of small model property. In this paper, we show that this small model property does not hold neither for mailbox communications, nor for peer-to-peer communications, therefore the decidability of synchronizability becomes an open question. We close this question for peer-to-peer communications, and we show that synchronizability is actually undecidable. We show that synchronizability is decidable if the topology of communications is an oriented ring. We also show that, in this case, synchronizability implies the absence of unspecified receptions and orphan messages, and the channel-recognizability of the reachability set.


    Volume: Volume 19, Issue 4
    Published on: December 20, 2023
    Accepted on: October 13, 2023
    Submitted on: August 20, 2018
    Keywords: Computer Science - Distributed, Parallel, and Cluster Computing,Computer Science - Formal Languages and Automata Theory

    Consultation statistics

    This page has been seen 1042 times.
    This article's PDF has been downloaded 226 times.