Synchronous development of asynchronous systems

Avoiding diamonds in desynchronisation

“…Now by enriching the transfer condition of branching bisimilarity (just like how the termination predicate is handled in the definition of branching bisimulation; see [16]) we ensure that an asynchronous system constructed from a desynchronisable synchronous system has the following communication property: "every sent message is eventually received". Note that this property was already present in the previous works [3,8,9] on desynchronisability; although, it was never made explicit with the respective equivalences studied previously. For instance, the communication property was called absence of computation interference in [9]; while, [3] used sender domination to satisfy the above property.…”

“…Buffers Equivalences Udding [9] Wires Trace equivalence Balemi [7] Queues Trace equivalence Fischer and Janssen [3] Bags Failure equivalence Beohar and Cuijpers [8] Bags Branching bisimulation Table 1: Buffers and equivalences studied previously in the context of desynchronisation.…”

“…For instance, the communication property was called absence of computation interference in [9]; while, [3] used sender domination to satisfy the above property. Thus, by making the communication property explicit in our setup we are able to show that our conditions are also necessary for desynchronisability, which was previously absent in [3,[7][8][9].…”

“…The challenge is then to design the synchronous system in such a way that the addition of communication buffers does not alter its behaviour (in any relevant way) [3]. A synchronous system that is not altered by the addition of communication buffers is called desynchronisable.…”

“…In previous research [3,[7][8][9], well-posedness and the diamond property were already present as sufficient conditions for desynchronisability, while the other two properties are new with respect to these references because external actions were not allowed in the specification of communicating processes and the equivalences studied in these papers were coarser than branching bisimulation 1 . Table 1 provides the list of buffers and equivalences studied previously in the context of desynchronisation.…”