Uwe Nestmann  Home/Search
Context
Related
Links: DBLP | lamp.epfl.ch/~uwe/citation...good.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lamp.epfl.ch/~uwe/citations/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The -calculus with synchronous output and mixed-guarded choices is strictly more expressive than the -calculus with asynchronous output and no choice. As a corollary, Palamidessi recently proved that there is no fully compositional encoding from the former into the latter that preserves divergence-freedom and symmetries. This paper shows that there are nevertheless `good' encodings between these calculi. (Update)
Similar documents (at the sentence level):
46.2%: What is a `Good' Encoding of Guarded Choice? - Nestmann (1999) (Correct)
Active bibliography (related documents): More All
0.3: Decoding Choice Encodings - Nestmann, Pierce (1999) (Correct)
0.2: Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
0.2: Protocols for Non-Deterministic Communication over Synchronous.. - Demaine (1998) (Correct)
Similar documents based on text: More All
0.2: An Example Paper - Name (Correct)
0.2: How Many Argument Digits are Needed to Produce n Result Digits? - Heckmann (1999) (Correct)
0.2: Electronic Notes in Theoretical Computer - Science Elsevier To (Correct)
BibTeX entry: (Update)
@article{ nestmann00what,
author = "Uwe Nestmann",
title = "What Is a `Good' Encoding of Guarded Choice?",
journal = "Journal of Information and Computation",
volume = "156",
pages = "287--319",
year = "2000",
url = "citeseer.ist.psu.edu/nestmann97what.html" }
Citations (may not include all citations):854 Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
248 Expressing Mobility (context) - Sangiorgi - 1993
197 Barbed Bisimulation - Milner, Sangiorgi - 1992 ACM DBLP
159 CML: A Higher-Order Concurrent Language (context) - Reppy - 1991 DBLP
115 An Asynchronous Model of Locality (context) - Amadio - 1997
107 A New Solution of Dijkstra's Concurrent Programming Problem (context) - Lamport - 1974 ACM DBLP
86 A Partially Deadlock-Free Typed Process Calculus - Kobayashi - 1997 ACM DBLP
76 The Polyadic -Calculus: A Tutorial - Milner - 1991
73 Comparing the Expressive Power of the Synchronous and the As.. - Palamidessi - 1997
70 On Asynchronous Communication Semantics - Honda, Tokoro - 1991 ACM DBLP
60 Decoding Choice Encodings - Nestmann, Pierce - 1996 ACM DBLP
57 the Advantages of Free Choice: A Symmetric and Fully Distrib.. (context) - Lehmann, Rabin - 1981
56 Another Advantage of Free Choice: Completely Asynchronous Ag.. (context) - Ben-Or - 1983
56 INRIA Sophia-Antipolis (context) - Boudol, the et al. - 1992
47 On Bisimulations for the Asynchronous -Calculus - Amadio, Castellani et al. - 1996
39 The Reflexive Chemical Abstract Machine and the Join-Calculu.. (context) - Fournet, Gonthier - 1996
31 Theoretical Computer Science (context) - Bellin, Scott et al. - 1994 ACM
24 An Effective Implementation for the Generalized Input-Output.. (context) - Buckley, Silberschatz - 1983 ACM DBLP
23 A Distributed Protocol for Channel-Based Communication with .. - Knabe - 1993 ACM DBLP
17 A Facile Tutorial (context) - Thomsen, Leth et al. - 1996 ACM DBLP
15 The Turing-Equivalence of Linda Coordination Primitives (context) - Busi, Gorrieri et al. - 1997
15 the Existence of Symmetric Algorithms to Find Leaders in Net.. (context) - Boug'e - 1988
15 Constraints as Processes - Victor, Parrow - 1996 ACM DBLP
8 Formal Aspects of Computing (context) - Leth, Thomsen et al. - 1995
7 Communicating Sequential Processes (context) - Bernstein, Nondeterminism - 1980 ACM DBLP
7 On Determinacy and Nondeterminacy in Concurrent Programming (context) - Nestmann - 1996
5 A Counter-Example to an Algorithm for the Generalized Input-.. (context) - Kumar, Silberschatz - 1997 ACM DBLP
4 Notes on Soundness of a Mapping from -calculus to -calculus (context) - Honda - 1993
Documents on the same site (http://lamp.epfl.ch/~uwe/citations/): More
On the Generalized Dining Philosophers Problem - Herescu, Palamidessi (2001) (Correct)
Asynchronous process calculi: the first-order and higher-order.. - Sangiorgi (1999) (Correct)
Comparing the Expressive Power of the Synchronous and the.. - Palamidessi (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC