Synchronizability of Communicating Finite State Machines is not Decidable

Abstract : A system of communicating finite state machines is synchronizable [1, 4] 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 rendezvous synchronizations. This property was claimed to be decidable in several conference and journal papers [1, 4, 3, 2] for either mailboxes (*-1) or peer-to-peer (1-1) 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 syn-chronizability 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.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Etienne Lozes <>
Submitted on : Tuesday, November 13, 2018 - 1:31:41 PM
Last modification on : Wednesday, November 28, 2018 - 1:14:01 AM
Document(s) archivé(s) le : Thursday, February 14, 2019 - 2:18:53 PM


Publisher files allowed on an open archive



Alain Finkel, Etienne Lozes. Synchronizability of Communicating Finite State Machines is not Decidable. 44th International Colloquium on Automata, Languages, and Programming ICALP 2017, 2017, Varsaw, Poland. ⟨10.4230/LIPIcs.ICALP.2017.122⟩. ⟨hal-01920609⟩



Record views


Files downloads