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 coarser---but still coinductively defined---equivalence that does not enforce bisimilarity of internal branching decisions. The rigorous correctness proofs for the two choice encodings introduce a novel proof technique exploiting the properties of explicit decodings from translations to source terms.
|
2860
|
Communication and Concurrency
– Milner
- 1989
|
|
318
|
The polyadic -calculus: a tutorial
– Milner
- 1991
|
|
295
|
Functions as processes
– Milner
- 1992
|
|
288
|
An object calculus for asynchronous communication
– Honda, Tokoro
- 1991
|
|
253
|
The linear time -- branching time spectrum
– Glabbeek
- 1990
|
|
246
|
Pict: A programming language based on the pi-calculus
– Pierce, Turner
- 1997
|
|
189
|
The reflexive chemical abstract machine and the join-calculus
– Fournet, Gonthier
- 1996
|
|
189
|
Barbed bisimulation
– Milner, Sangiorgi
- 1992
|
|
140
|
A Calculus of Mobile
– Milner, Parrow, et al.
- 1992
|
|
131
|
The Polyadic π-calculus: a Tutorial
– Milner
- 1991
|
|
126
|
Higher-Order Concurrency
– Reppy
- 1992
|
|
119
|
On reduction-based process semantics
– Honda, Yoshida
- 1995
|
|
113
|
Comparing the expressive power of the synchronous and the asynchronous pi-calculus
– Palamidessi
- 1997
|
|
101
|
A calculus of higher order communicating systems
– Thomsen
- 1989
|
|
82
|
On bisimulations for the asynchronous -calculus
– Amadio, Castellani, et al.
- 1998
|
|
79
|
Concurrent Objects in a Process Calculus
– Pierce, Turner
- 1995
|
|
70
|
A Calculus of
– Milner, Parrow, et al.
- 1992
|
|
69
|
On asynchronous communication semantics
– Honda, Tokoro
- 1992
|
|
67
|
An efficiency preorder for processes
– Arun-Kumar, Hennessy
- 1992
|
|
66
|
A foundation for higher-order concurrent constraint programming
– Smolka
- 1994
|
|
56
|
Asynchrony and the -calculus (note). Rapport de Recherche 1702
– Boudol
- 1992
|
|
55
|
calculus semantics of object-oriented programming languages
– Walker
- 1991
|
|
53
|
The Lazy Lambda Calculus in a Concurrency Scenario
– Sangiorgi
- 1994
|
|
53
|
On the bisimulation proof method
– Sangiorgi
- 1998
|
|
52
|
Objects in the -calculus
– Walker
- 1995
|
|
49
|
A pi-calculus semantics for an object-based design notation
– Jones
- 1993
|
|
49
|
What is a `good' encoding of guarded choice
– Nestmann
- 1997
|
|
47
|
Bisimulation and divergence
– Walker
- 1990
|
|
43
|
Objects in the π-calculus
– Walker
- 1995
|
|
41
|
On bisimulations for the asynchronous π-calculus
– Amadio, Castellani, et al.
- 1998
|
|
32
|
Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis
– Boudol
- 1992
|
|
28
|
Some Facile Chemistry
– Leth, Thomsen
- 1995
|
|
27
|
Multiway synchronization verified with coupled simulation
– Parrow, Sjödin
- 1992
|
|
24
|
A Distributed Protocol for Channel-Based Communication with Choice
– Knabe
- 1993
|
|
23
|
Translating Core Facile
– Amadio
- 1994
|
|
22
|
Dynamic congruence vs. progressing bisimulation for CCS
– Montanari, Sassone
- 1992
|
|
22
|
From -calculus to Higher-Order -calculus --- and back
– Sangiorgi
- 1993
|
|
21
|
Combinatory representation of mobile processes
– Honda, Yoshida
- 1994
|
|
20
|
Two bisimilarities for the -calculus
– Honda
- 1992
|
|
19
|
Polarized name passing
– Odersky
- 1995
|
|
18
|
From a Concurrent -Calculus to the -Calculus
– Amadio, Leth, et al.
- 1995
|
|
18
|
Concurrent semantics for the ��-calculus
– Montanari, Pistore
- 1995
|
|
16
|
Trios in concert
– Parrow
- 2000
|
|
16
|
Process Algebra Semantics of POOL
– Vaandrager
- 1990
|
|
15
|
Functional Computation as Concurrent Computation
– Niehren
- 1996
|
|
13
|
Lazy functions and mobile processes. Rapport de recherche 2515
– Sangiorgi
- 1995
|
|
13
|
An introduction to the π-calculus
– Parrow
- 2001
|
|
11
|
Replication in Concurrent Combinators
– Honda, Yoshida
- 1994
|
|
11
|
On the reduction of chocs bisimulation to ��-calculus bisimulation
– Amadio
- 1993
|
|
10
|
The complete axiomatization of cs-congruence
– Parrow, Sjödin
- 1994
|
|
