Search

• < Previous
• 1
• Next >

Synchronizability of Communicating Finite State Machines is not Decidable

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&nbsp;[&hellip;]