(Enter summary)
Abstract: We consider the problem of encoding the -calculus with mixed choice into the asynchronous
-calculus via a uniform translation while preserving a reasonable semantics. Although it has
been shown that this is not possible with an exact encoding, we suggest a randomized approach
using a probabilistic extension of the asynchronous -calculus, and we show that our solution is
correct with probability 1 under any proper adversary wrt a notion of testing semantics. This
result establishes the... (Update)
Cited by: More
A Randomized Encoding of the π-Calculus with Mixed Choice - Palamidessi, Herescu (2001)
(Correct)
Similar documents (at the sentence level):
30.2%: A Randomized Distributed Encoding of the π-Calculus.. - Palamidessi, Herescu (2002)
(Correct)
25.8%: The Probabilistic Asynchronous π-Calculus - Herescu (2002)
(Correct)
17.1%: Probabilistic Asynchronous π-Calculus - Herescu, Palamidessi (2000)
(Correct)
Active bibliography (related documents): More All
0.5: Research Overview and Plans - Catuscia Palamidessi March
(Correct)
0.5: Two Decentralized Algorithms for Strong Interaction Fairness for.. - Joung (2000)
(Correct)
0.3: Information Societies Technology - Ist Programme Contract
(Correct)
Similar documents based on text: More All
0.3: On the Generalized Dining Philosophers Problem - Herescu, Palamidessi (2001)
(Correct)
0.3: YOO (Why Object-Orientation) - Rensink (2000)
(Correct)
0.2: Memory in Motion: A Study of Storage Structures in QCA - Frost, Rodrigues.. (2002)
(Correct)
Related documents from co-citation: More All
2: the advantage of free choice: a symmetric and fully distributed solution to the .. (context) - Lehmann, Rabin - 1981
2: Theoretical Computer Science (context) - Milner, Parrow et al. - 1993
2: the generalized dining philosophers problem (context) - Herescu, Palamidessi - 2001
BibTeX entry: (Update)
Catuscia Palamidessi and Oltea M. Herescu. A randomized encoding of the -calculus with mixed choice. Technical report, Dept. of Comp. Sci. and Eng., The Pennsylvania State University, 2001. Postscript available at http://cse.psu.edu/~catuscia/papers/probenc/report.ps. http://citeseer.ist.psu.edu/article/palamidessi01randomized.html More
@misc{ palamidessi01randomized,
author = "C. Palamidessi and O. Herescu",
title = "A randomized encoding of the -calculus with mixed choice",
text = "Catuscia Palamidessi and Oltea M. Herescu. A randomized encoding of the
-calculus with mixed choice. Technical report, Dept. of Comp. Sci. and Eng.,
The Pennsylvania State University, 2001. Postscript available at http://cse.psu.edu/~catuscia/papers/probenc/report.ps.",
year = "2001",
url = "citeseer.ist.psu.edu/article/palamidessi01randomized.html" }
Citations (may not include all citations):
854
Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
294
An object calculus for asynchronous communication
- Honda, Tokoro - 1991 ACM DBLP
216
Theoretical Computer Science (context) - Milner, Parrow et al. - 1993 ACM
174
Probabilistic simulations for probabilistic processes
- Segala, Lynch - 1995
149
Testing equivalences for processes (context) - De Nicola, Hennessy - 1984 DBLP
90
Modeling and Verification of Randomized Distributed Real-Tim.. (context) - Segala - 1995 ACM
73
Comparing the expressive power of the synchronous and the as..
- Palamidessi - 1997
57
the advantages of free choice: A symmetric and fully distrib.. (context) - Rabin, Lehmann - 1994
54
Testing equivalence for mobile processes (context) - Boreale, De Nicola - 1995 ACM DBLP
51
Compositional testing preorders for probabilistic processes
- Jonsson, Yi - 1995
47
On bisimulations for the asynchronous -calculus
- Amadio, Castellani et al. - 1998
44
internal mobility and agent-passing calculi (context) - Sangiorgi - 1996 ACM DBLP
27
Probabilistic extensions of process algebras
- Jonsson, Larsen et al.
24
Multiway synchronization verified with coupled simulation
- Parrow, Sjodin - 1992
23
A distributed protocol for channel-based communications with..
- Knabe - 1993
19
good' encoding of guarded choice (context) - Nestmann - 1997
13
A distributed abstract data type implemented by a probabilis.. (context) - Francez, Rodeh - 1980 DBLP
12
Testing probabilistic automata (context) - Segala - 1996 ACM DBLP
10
Real-time synchronization of interprocess communications (context) - Reif, Spirakis - 1984 ACM DBLP
10
Probabilistic asynchronous -calculus
- Herescu, Palamidessi - 2000
7
Fault-tolerant algorithms for fair interprocess synchronizat.. (context) - Tsay, Bagrodia - 1994 ACM DBLP
6
Strong interaction fairness via randomization
- Joung, Smolka - 1998 ACM DBLP
4
An extended abstract appeared in the Proceedings of EXPRESS (context) - Nestmann, of et al. - 2000
4
the generalized dining philosophers problem (context) - Herescu, Palamidessi - 2001
3
An extended abstract appeared in the Proceedings of CONCUR (context) - Nestmann, Pierce et al. - 2000
2
A randomized encoding of the -calculus with mixed choice
- Palamidessi, Herescu - 2001
Documents on the same site (http://www.cse.psu.edu/~catuscia/publications.html): More
Weak Relative Pseudo-Complements of Closure Operators - Giacobazzi, Palamidessi.. (1996)
(Correct)
Comparing the Expressive Power of the Synchronous and the.. - Palamidessi (2002)
(Correct)
Temporal Concurrent Constraint Programming.. - Nielsen.. (2002)
(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