Author:
PETERS KIRSTIN,SCHICKE-UFFMANN JENS-WOLFHARD,GOLTZ URSULA,NESTMANN UWE
Abstract
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.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Reference32 articles.
1. 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)
2. On the Expressive Power of Joint Input
3. Non-interleaving semantics for mobile processes
4. Distributable nets
5. A fully abstract semantics for causality in the $\pi$ -calculus
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mixed choice in session types;Information and Computation;2024-06
2. On the Expressiveness of Mixed Choice Sessions;Electronic Proceedings in Theoretical Computer Science;2022-09-06
3. Mixed sessions;Theoretical Computer Science;2022-01
4. Mixed Sessions;Programming Languages and Systems;2020