(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 renes 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 coarser ... (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):
36.4%: Decoding Choice Encodings - Nestmann, Pierce (1997)
(Correct)
Active bibliography (related documents): More All
0.7: Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001)
(Correct)
0.3: Chapter 6. An Investigation into Functions as Processes - Unknown
(Correct)
0.2: What is a `Good' Encoding of Guarded Choice? - Nestmann (1997)
(Correct)
Similar documents based on text: More All
0.3: Comparing the Expressive Power of the Synchronous and the.. - Palamidessi (1997)
(Correct)
0.2: March 1999. 21 pp. Appears in Mendelzon, editor, - Eighth International World
(Correct)
0.1: Solos in Concert - Laneve, Victor (1999)
(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.comp.nus.edu.sg/660622.html More
@misc{ nestmann-decoding,
author = "U. Nestmann and B. Pierce",
title = "Decoding choice encodings",
text = "Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Montanari
and Sassone [MS96], pages 179--194.",
url = "citeseer.comp.nus.edu.sg/660622.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
294
An Object Calculus for Asynchronous Communication
- Honda, Tokoro - 1991
200
Pict: A programming language based on the pi-calculus
- Pierce, Turner - 1996
197
Barbed bisimulation
- Milner, Sangiorgi - 1992
140
On Reduction-Based Process Semantics
- Honda, Yoshida - 1995
137
Laboratory for Foundations of Computer Sci ence (context) - Milner, Parrow et al. - 1992
116
volume 788 of Lecture Notes in Computer Science (context) - Sannella, European et al. - 1994
73
Concurrent Objects in a Process Calculus
- Pierce, Turner - 1995
70
On Asynchronous Communication Semantics
- Honda, Tokoro - 1992
57
calculus Semantics of Object-Oriented Programming Languages (context) - Walker - 1991
56
INRIA Sophia-Antipolis (context) - rard, Asynchrony et al. - 1992
52
The Lazy Lambda Calculus in a Concurrency Scenario
- Sangiorgi - 1994
44
Internal Mobility and Agent-Passing Calculi (context) - Sangiorgi - 1995
41
A Foundation for Higher-Order Concurrent Constraint Programm..
- Smolka - 1994
39
A Pi-Calculus Semantics for an Object-Based Design Notation (context) - Jones
35
Combinatory Representation of Mobile Processes
- Honda, Yoshida - 1994
35
the Bisimulation Proof Method
- Sangiorgi - 1995
23
A Distributed Protocol for Channel-Based Communication with ..
- Knabe - 1993
22
A Second Generation Calculus for Higher Order Processes (context) - Thomsen - 1993
22
Functional Computation as Concurrent Computation
- Niehren
22
Replication in Concurrent Combinators
- Honda, Yoshida - 1994
20
Polarized Name Passing (context) - Odersky - 1995
17
The Complete Axiomatization of cs-Congruence
- Parrow, Sj - 1994
17
Process algebra semantics of POOL (context) - Vaandrager - 1990
16
Two Bisimilarities in -Calculus (context) - Honda - 1993
15
Higher-Order Concurrency (context) - Reppy - 1992
15
Constraints as processes
- rn, Joachim - 1996
14
INRIA Sophia-Antipolis (context) - Sangiorgi, mobile et al. - 1995
14
An Investigation into Functions as Processes
- Sangiorgi - 1994
14
A Theory of Higher Order Communicating Systems (context) - Thomsen - 1995
11
The Linear Time Branching Time Spectrum II: The semantics of..
- van Glabbeek
11
Programming in the Pi-Calculus: An Experiment in Programming.. (context) - Pierce - 1996
10
Process Calculus and Parallel Object-Oriented Programming La.. (context) - Walker - 1993
10
The ReAEexive Chemical Abstract Machine and the Join-Calculu.. (context) - dric, Georges
10
European Com puter-Industry Research Centre (context) - Amadio, Facile et al. - 1994
10
volume 715 of Lecture Notes in Computer Science (context) - Best, International et al. - 1993
9
the Reduction of CHOCS Bisimulation to -Calculus Bisimulatio.. (context) - Amadio - 1993
9
Multiway Synchronization Veried with Coupled Simula tion (context) - Parrow, Sj - 1992
9
Trios in Concert
- Parrow - 1995
8
Implementations of Process Synchronisation and their Analysi.. (context) - Mitchell - 1986
7
From -Calculus to Higher-Order -Calculus and Back (context) - Sangiorgi - 1993
7
Compiler Correctness for Concurrent Languages
- Gladstein - 1994
7
From a Concurrent -Calculus to the -Calculus (context) - Amadio, Leth et al. - 1995
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
3
Non-determinisitc lazy -calculus vs (context) - Lavatelli - 1993
3
Some Results on the -Calculus (context) - Walker - 1991
3
the Concept of Simulation in Asynchronous (context) - Priese - 1978
2
Some Thoughts on Asynchrony (context) - Sangiorgi - 1995
2
Theories of Translation Correctness for Concurrent Porgrammi.. (context) - Millington - 1987
1
Previously published as Computer Science Report (context) - Arun-Kumar, Hennessy et al. - 1992
1
Technical Report CNRINRIA Sophia Antipoli (context) - Amadio, Castellani et al. - 1996
1
Comparing Combinatory Reduction Sys tems and Higher-Order Re.. (context) - van Oostrom, van Raamsdonk - 1994
1
Published in Logic and Algebra of Specication (context) - Milner, -calculus et al. - 1993
1
Extended abstract appeared in LICS (context) - Walker, Divergence et al. - 1990
1
Simulation of SOS Denitions with Term Rewriting Systems (context) - Buth
1
Distributed ConAEicts in Communicating Systems (context) - Busi, Gorrieri - 1995
1
Calculus Semantics of Logical Variables and Unication (context) - Ross - 1992
1
Final version published in Information and Computation (context) - Walker, the et al. - 1995
1
calculus specication of Prolog (context) - Li
The graph only includes citing articles where the year of publication is known.
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 at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.