Uwe Nestmann  Home/Search
Context
Related
| brics.dk/RS/99/Ref...ICSRS9943.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: brics.dk/RS/99/Ref/BRICSRS99... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The pi-calculus with synchronous output and mixed-guarded choices is strictly more expressive than the pi-calculus with asynchronous output and no choice. This result was recently proved by Palamidessi and, as a corollary, she showed that there is no fully compositional encoding from the former into the latter that preserves divergence-freedom and symmetries. This paper argues that there are nevertheless `good' encodings between these calculi... (Update)
Similar documents (at the sentence level):
53.1%: What is a `Good' Encoding of Guarded Choice? - Nestmann (1997) (Correct)
Active bibliography (related documents): More All
0.6: Decoding Choice Encodings - Nestmann, Pierce (1999) (Correct)
0.3: Solo Diagrams - Laneve, Parrow, Victor (2001) (Correct)
0.3: Code Generation From Hierarchical Concurrency Specifications - Roegel, Smolka (2001) (Correct)
Similar documents based on text: More All
1.4: Aliasing Models for Mobile Objects - Nestmann, Hüttel, Kleist, Merro (1999) (Correct)
1.3: Semantics of Objects As Processes SOAP '99 - Hüttel, Kleist, Nestmann, (eds.) (1999) (Correct)
1.2: A Simple Take on Typed Abstract Syntax in Haskell-like Languages - Danvy, Rhiger (2000) (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/article/nestmann99what.html" }
Citations (may not include all citations):854 Information and Computation (context) - Milner, Parrow et al. - 1992
248 Expressing Mobility (context) - Sangiorgi - 1993
197 Barbed Bisimulation - Milner, Sangiorgi - 1992
159 CML: A Higher-Order Concurrent Language (context) - Reppy - 1991
149 Calculus: A Tutorial (context) - Milner
116 Mathematical Structures in Computer Science (context) - Pierce, Sangiorgi et al. - 1996
115 An Asynchronous Model of Locality (context) - Amadio
107 A New Solution of Dijkstra's Concurrent Programming Problem (context) - Lamport - 1974
86 A Partially Deadlock-Free Typed Process Calculus - Kobayashi - 1997
73 Comparing the Expressive Power of the Synchronous and the As.. - Palamidessi - 1997
70 On Asynchronous Communication Semantics - Honda, Tokoro
66 Graph Types for Monadic Mobile Processes - Yoshida
60 Decoding Choice Encodings - Nestmann, Pierce
59 The Name Discipline of Uniform Receptiveness - Sangiorgi
57 the Advantages of Free Choice: A Symmetric and Fully Distrib.. (context) - Rabin, Lehmann - 1994
56 Another Advantage of Free Choice: Completely Asynchronous Ag.. (context) - Ben-Or - 1983
45 Asynchrony and the #-calculus (context) - Boudol - 1992
42 Theoretical Computer Science (context) - Amadio, Castellani et al. - 1998
39 The Reflexive Chemical Abstract Machine and the Join-Calculu.. (context) - Fournet, Gonthier - 1996
24 Multiway Synchronization Verified with Coupled Simulation - Parrow, Sjodin - 1992
23 A Distributed Protocol for Channel-Based Communication with .. - Knabe - 1993
20 A Hierarchy of Equivalences for Asynchronous Calculi - Fournet, Gonthier - 1998
17 A Facile Tutorial (context) - Thomsen, Leth et al. - 1996
15 Constraints as Processes - Victor, Parrow - 1996
15 the Existence of Symmetric Algorithms to Find Leaders in Net.. (context) - Bouge - 1988
15 The Turing-Equivalence of Linda Coordination Primitives (context) - Busi, Gorrieri et al. - 1997
8 ciency Preorder for Processes (context) - Arun-Kumar, Hennessy - 1992
7 Communicating Sequential Processes (context) - Bernstein, Nondeterminism - 1980
7 On Determinacy and Nondeterminacy in Concurrent Programming (context) - Nestmann - 1996
6 A Previous Version appeared as ECRC-Report ECRC (context) - Leth, Thomsen et al. - 1995
5 A Counter-Example to an Algorithm for the Generalized InputO.. (context) - Kumar, Silberschatz - 1997
4 ective Implementation for the Generalized Input-Output Const.. (context) - Buckley, Silberschatz - 1983
4 Notes on Soundness of a Mapping from #-calculus to #-calculu.. (context) - Honda
3 Also published as LFCS report ECS-LFCS (context) - Bellin, Scott et al. - 1994
Documents on the same site (http://www.brics.dk/RS/99/Ref/BRICS-RS-99-Ref/): More
A Runtime System for Interactive Web Services - Brabrand, Møller.. (1999) (Correct)
Foundational and Mathematical Uses of Higher Types - Kohlenbach (1999) (Correct)
Hereditary History Preserving Simulation is Undecidable - Jurdzinski, Nielsen (1999) (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