{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:42:21Z","timestamp":1777596141953,"version":"3.51.4"},"reference-count":32,"publisher":"Cambridge University Press (CUP)","issue":"8","license":[{"start":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T00:00:00Z","timestamp":1419292800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:p>Given a synchronous system, we study the question whether \u2013 or, under which conditions \u2013 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 \u03c0-calculus. For both formalisms it turns out that each \u2018good\u2019 encoding of synchronous interactions using just asynchronous interactions introduces causal dependencies in the translation.<\/jats:p>","DOI":"10.1017\/s0960129514000644","type":"journal-article","created":{"date-parts":[[2014,12,23]],"date-time":"2014-12-23T03:41:39Z","timestamp":1419306099000},"page":"1459-1498","source":"Crossref","is-referenced-by-count":3,"title":["Synchrony versus causality in distributed systems"],"prefix":"10.1017","volume":"26","author":[{"given":"KIRSTIN","family":"PETERS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JENS-WOLFHARD","family":"SCHICKE-UFFMANN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"URSULA","family":"GOLTZ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"UWE","family":"NESTMANN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,12,23]]},"reference":[{"key":"S0960129514000644_ref22","unstructured":"Peters K. (2012) Translational Expressiveness|Comparing Process Calculi using Encodings, Ph.D. thesis, TU Berlin. (Available at: http:\/\/nbn-resolving.de\/urn:nbn:de:kobv:83-opus-37495)"},{"key":"S0960129514000644_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)00123-9"},{"key":"S0960129514000644_ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)80003-6"},{"key":"S0960129514000644_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019974"},{"key":"S0960129514000644_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050124"},{"key":"S0960129514000644_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.05.002"},{"key":"S0960129514000644_ref7","doi-asserted-by":"crossref","unstructured":"Fournet C. and Gonthier G. (1996) The reflexive chemical abstract machine and the join-calculus. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 372\u2013385.","DOI":"10.1145\/237721.237805"},{"key":"S0960129514000644_ref20","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129503004043"},{"key":"S0960129514000644_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.05.001"},{"key":"S0960129514000644_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s001650200022"},{"key":"S0960129514000644_ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0057019"},{"key":"S0960129514000644_ref27","doi-asserted-by":"crossref","unstructured":"Pratt V. R. (1985) The pomset model of parallel processes: Unifying the temporal and the spatial. In: Seminar on Concurrency, Carnegie-Mellon University 180\u2013196.","DOI":"10.1007\/3-540-15670-4_9"},{"key":"S0960129514000644_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60218-6_11"},{"key":"S0960129514000644_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.04.011"},{"key":"S0960129514000644_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28729-9_14"},{"key":"S0960129514000644_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s002360000041"},{"key":"S0960129514000644_ref30","volume-title":"The \u03c0-Calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"},{"key":"S0960129514000644_ref25","doi-asserted-by":"crossref","unstructured":"Peters K. , Nestmann U. and Goltz U. (2013) On distributability in process calculi. In: Proceedings of the 22nd European conference on Programming Languages and Systems. Lecture Notes in Computer Science 310\u2013329.","DOI":"10.1007\/978-3-642-37036-6_18"},{"key":"S0960129514000644_ref19","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2822"},{"key":"S0960129514000644_ref31","unstructured":"Schicke J.-W. (2008) Studienarbeit: Asynchronous Petri net classes. TU Braunschweig."},{"key":"S0960129514000644_ref23","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.41.10"},{"key":"S0960129514000644_ref3","unstructured":"Boudol G. (1992) Asynchrony and the \u03c0-calculus (note). INRIA Research Report RR-1702."},{"key":"S0960129514000644_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85238-4_2"},{"key":"S0960129514000644_ref14","unstructured":"Honda K. (1992) Notes on soundness of a mapping from \u03c0-calculus to \u03bd-calculus. With comments added in October 1993."},{"key":"S0960129514000644_ref28","unstructured":"Priami C. (1996) Enhanced Operational Semantics for Concurrency, Ph.D. thesis, Universita' di Pisa-Genova-Udine."},{"key":"S0960129514000644_ref32","unstructured":"Schicke J.-W. (2009) Diplomarbeit: Synchrony and asynchrony in Petri nets. TU Braunschweig."},{"key":"S0960129514000644_ref26","unstructured":"Petri C. A. (1977) Non-sequential processes. GMD-ISF Report 77.05, GMD."},{"key":"S0960129514000644_ref29","doi-asserted-by":"crossref","unstructured":"Reisig W. (1984) Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness. In: Proceedings of the 11th Colloquium on Automata, Languages and Programming 403\u2013413.","DOI":"10.1007\/3-540-13345-3_37"},{"key":"S0960129514000644_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55719-9_114"},{"key":"S0960129514000644_ref8","doi-asserted-by":"crossref","unstructured":"van Glabbeek R. J. (1993) The linear time - branching time spectrum II. In: Proceedings of the 4th International Conference on Concurrency Theory, 66\u201381.","DOI":"10.1007\/3-540-57208-2_6"},{"key":"S0960129514000644_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28729-9_22"},{"key":"S0960129514000644_ref5","first-page":"1","article-title":"On the expressive power of polyadic synchronisation in \u03c0-calculus","volume":"10","author":"Carbone","year":"2003","journal-title":"Nordic Journal of Computing"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T15:01:17Z","timestamp":1566140477000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000644\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,23]]},"references-count":32,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["S0960129514000644"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000644","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,23]]}}}