Peters, KirstinSchicke-Uffmann, Jens-WolfhardGoltz, UrsulaNestmann, Uwe2017-11-232017-11-2320140960-1295https://depositonce.tu-berlin.de/handle/11303/7170http://dx.doi.org/10.14279/depositonce-6445Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich.This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.Given a synchronous system, we study the question whether – or, under which conditions – the behaviour of that system can be realized by a (non-trivially) distributed and hence asynchronous implementation. In this paper, we partially answer this question by examining the role of causality for the implementation of synchrony in two fundamental different formalisms of concurrency, Petri nets and the π-calculus. For both formalisms it turns out that each ‘good’ encoding of synchronous interactions using just asynchronous interactions introduces causal dependencies in the translation.en004 Datenverarbeitung; InformatikArticle1469-8072