(Enter summary)
Abstract: We study two encodings of the asynchronous #-calculus with input-guarded choice
into its choice-free fragment. One encoding is divergence-free, but refines the atomic
commitment of choice into gradual commitment. The other preserves atomicity, but
introduces divergence. The divergent encoding is fully abstract with respect to weak
bisimulation, but the more natural divergence-free encoding is not. Instead, we show
that it is fully abstract with respect to coupled simulation, a slightly... (Update)
Cited by: More
A Semantic Theory for Global Computing Systems - Daniele Gorla Rosario (2003)
(Correct)
Abstractions for Fault-Tolerant Global Computing - Chothia, Duggan (2004)
(Correct)
On Bisimulations for the Asynchronous π-calculus? - Amadio, Castellani, Sangiorgi (1997)
(Correct)
Similar documents (at the sentence level):
51.3%: Decoding Choice Encodings - Nestmann, Pierce (1997)
(Correct)
Active bibliography (related documents): More All
0.8: Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001)
(Correct)
0.6: What is a `Good' Encoding of Guarded Choice? - Nestmann (1999)
(Correct)
0.5: The Origins of Structural Operational Semantics - Plotkin (2003)
(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)
Related documents from co-citation: More All
40: Information and Computation (context) - Milner, Parrow et al. - 1992
36: An object calculus for asynchronous communication
- Honda, Tokoro - 1991
33: Comparing the expressive power of the Synchronous and the Asynchronous pi-calcul..
- Palamidessi - 1997
BibTeX entry: (Update)
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Montanari and Sassone [MS96], pages 179--194. http://citeseer.ist.psu.edu/article/nestmann99decoding.html More
@inproceedings{ nestmann96decoding,
author = "Uwe Nestmann and Benjamin C. Pierce",
title = "Decoding Choice Encodings",
booktitle = "{CONCUR}~'96: Concurrency Theory, 7th International Conference",
volume = "1119",
publisher = "Springer-Verlag",
address = "Pisa, Italy",
editor = "Ugo Montanari and Vladimiro Sassone",
pages = "179--194",
year = "1996",
url = "citeseer.ist.psu.edu/article/nestmann99decoding.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989 ACM
854
Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
294
An Object Calculus for Asynchronous Communication
- Honda, Tokoro - 1991 ACM DBLP
200
Pict: A Programming Language Based on the Pi-Calculus
- Pierce, Turner - 1999
197
Barbed Bisimulation
- Milner, Sangiorgi ACM DBLP
194
Functions as Processes (context) - Milner ACM DBLP
149
Calculus: A Tutorial (context) - Milner
140
On Reduction-Based Process Semantics
- Honda, Yoshida - 1995 ACM DBLP
127
Information and Computation (context) - Walker, the DBLP
73
Comparing the Expressive Power of the Synchronous and the As..
- Palamidessi - 1997
73
Concurrent Objects in a Process Calculus
- Pierce, Turner ACM DBLP
70
On Asynchronous Communication Semantics
- Honda, Tokoro ACM DBLP
57
calculus Semantics of Object-Oriented Programming Languages (context) - Walker - 1991
56
INRIA Sophia-Antipolis (context) - Boudol, the et al. - 1992
52
The Lazy Lambda Calculus in a Concurrency Scenario
- Sangiorgi - 1994 ACM DBLP
44
Internal Mobility and Agent-Passing Calculi (context) - Sangiorgi ACM DBLP
42
Theoretical Computer Science (context) - Amadio, Castellani et al. - 1998
41
A Foundation for Higher-Order Concurrent Constraint Programm..
- Smolka - 1994 ACM DBLP
39
A Pi-Calculus Semantics for an Object-Based Design Notation (context) - Jones ACM DBLP
39
The Reflexive Chemical Abstract Machine and the JoinCalculus (context) - Fournet, Gonthier - 1996
35
the Bisimulation Proof Method
- Sangiorgi - 1995
35
Combinatory Representation of Mobile Processes
- Honda, Yoshida - 1994 ACM DBLP
24
Multiway Synchronization Verified with Coupled Simulation
- Parrow, Sjodin
24
Progressing Bisimulation for CCS (context) - Montanari, Sassone et al. - 1992
23
A Distributed Protocol for Channel-Based Communication with ..
- Knabe - 1993 ACM DBLP
22
Replication in Concurrent Combinators
- Honda, Yoshida ACM DBLP
22
A Second Generation Calculus for Higher Order Processes (context) - Thomsen - 1993
22
Functional Computation as Concurrent Computation
- Niehren - 1996 ACM DBLP
20
Comparing Combinatory Reduction Systems and HigherOrder Rewr..
- Oostrom, Raamsdonk - 1994
20
Polarized Name Passing (context) - Odersky ACM DBLP
19
Good' Encoding of Guarded Choice (context) - Nestmann
18
The Linear Time -- Branching Time Spectrum II: The semantics..
- Glabbeek - 1993
17
The Complete Axiomatization of cs-Congruence
- Parrow, Sjodin - 1994 ACM DBLP
17
Process Algebra Semantics of POOL (context) - Vaandrager - 1990
16
Two Bisimilarities in #-Calculus (context) - Honda
15
Constraints as Processes
- Victor, Parrow ACM DBLP
14
A Theory of Higher Order Communicating Systems (context) - Thomsen - 1995
14
An investigation into functions as processes
- Sangiorgi ACM DBLP
14
INRIA Sophia-Antipolis (context) - Sangiorgi, mobile et al. - 1995
12
Calculus Specification of Prolog (context) - Li
10
European Computer-Industry Research Centre (context) - Amadio, Facile et al. - 1994
10
Process Calculus and Parallel Object-Oriented Programming La.. (context) - Walker - 1993
9
Trios in Concert
- Parrow - 1999
9
Algebraic Proofs of Properties of Objects (context) - Walker - 1994
9
the reduction of CHOCS bisimulation to #-calculus bisimulati.. (context) - Amadio
8
ciency Preorder for Processes (context) - Arun-Kumar, Hennessy - 1992
8
calculus to Higher-Order #-calculus --- and back (context) - Sangiorgi
8
Implementations of Process Synchronisation and their Analysi.. (context) - Mitchell - 1986
7
From a Concurrent #-Calculus to the #-Calculus (context) - Amadio, Leth et al. - 1995
7
Compiler Correctness for Concurrent Languages
- Gladstein - 1994 ACM DBLP
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
An Operational Approach to Semantics and Translation for Con.. (context) - Li - 1983
5
Constructing Simulations Chunk by Chunk (context) - Gammelgaard - 1991
4
Concurrent Semantics for the #-calculus (context) - Montanari, Pistore - 1995
4
Simulation of SOS Definitions with Term Rewriting Systems (context) - Buth - 1994
4
Towards a Basis for Concurrent Imperative Programming (context) - Odersky
3
the Concept of Simulation in Asynchronous (context) - Priese
3
calculus semantics of logical variables and unification
- Ross
3
Some Results on the #-Calculus (context) - Walker - 1991
3
Distributed Conflicts in Communicating Systems
- Busi, Gorrieri - 1995
3
Theories of Translation Correctness for Concurrent Programmi.. (context) - Millington - 1987
2
An extended abstract appeared in the Proceedings of LICS (context) - Walker, Divergence et al. - 1990
1
Non-deterministic Lazy #-calculus vs (context) - Lavatelli - 1993
The graph only includes citing articles where the year of publication is known.
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