U. Nestmann and B. C. Pierce. Decoding choice encodings. Journal of Information and Computation, 163:1--59, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Full Formalisation of π-Calculus Theory in the Calculus of .. - Hirschkoff (1997) (1 citation) (Correct)
.... calculus we have chosen. Our processes belong to a polyadic (in the sense that many names can be transmitted in a single communication) and sum free calculus; both polyadic communications and the sum operator (also called choice operator) can be encoded into a monadic, sum free calculus (see [Mil91, NP96]) While sum can be useful from a theoretical point of view to build axiomatisations, it turns out that it can be discarded without much loss of convenience for implementation tasks. Polyadicity, on the other hand, is a very useful feature when taken as primitive, because it makes the treatment of ....
U. Nestmann and B. C. Pierce. Decoding choice encodings. In Proceedings of CONCUR '96, number 1119, August 1996.
Nomadic Pict: Correct Communication Infrastructure for.. - Unyapoth, Sewell (2001) (13 citations) (Correct)
....stronger it is, the more confidence we gain that the encoding is correct. At first glance, one might take some form of weak bisimulation since (modulo divergence) it is finer than most notions of testing [dH84, Sew97] and is easier to work with. However, as in Nestmann s work on choice encodings [NP96] would not hold, as the encoding [ P ] involves partial commitment of some nondeterministic choices. An example is given in 6. We therefore take to be an adaptation of coupled simulation [PS92] to our language. This is a slightly coarser relation, but it is expected to be finer than ....
....new # in in in (LP LQ) # new new new # in in in LQ # . Intuitively, the first premise (LP #,# LP # ) of the theorem must allow all the potential agent movements of LQ and LQ # , and symmetrically. Expansion To construct the coupled simulation, we use an expansion relation [NP96] and the up to technique of [SM92] adapted with translocation, to allow elimination of target processes that are in intermediate housekeeping stages. The definitions are omitted. We depend on a congruence result, analogous to that above, for expansion. Temporary Immobility At many points in ....
[Article contains additional citation context not shown here]
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. [CON96], pages 179--194.
Probabilistic Asynchronous π-Calculus - Herescu, Palamidessi (2000) (7 citations) (Correct)
....f means that it has been decided. Notice that the symmetry is broken exactly when one process succeeds in performing both inputs. In the algorithm we make use of the if then else construct, which is defined by the structural rules if t then P else Q j P if f then P else Q j Q As discussed in [8], these features (booleans and if then else) can be translated into the asynchronous calculus, and therefore in pa . Correctness of the algorithm We prove now that the algorithm is correct, namely that the probability that a leader is eventually elected is 1 under every scheduler. In the ....
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996), volume 1119 of Lecture Notes in Computer Science, pages 179--194. Springer-Verlag, 1996. Full version to appear in Information and Computation.
Types for Access Control - De Nicola, Ferrari, Pugliese, Venneri (2000) (2 citations) (Correct)
....one of the suspended operations is nondeterministically selected to proceed; in the latter case, one of the matching tuples is arbitrarily chosen. Hence, within the reduced language, nondeterminism can be modelled via the pattern matching mechanism; but it could also be retrieved like, e.g. in [31]. There are several process calculi using explicit localities. For instance, localities in D# [25] model distribution and mobility of # calculus processes. In the distributed Join calculus [21] another variant of # calculus, channels have a unique locality and agents may move from a locality to ....
U. Nestmann, B.C. Pierce, Decoding choice encodings, in: U. Montanari, V. Sassone (Eds.), CONCUR'96, Proc., Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 179--194.
Asynchronous process calculi: the first-order and higher-order.. - Sangiorgi (1999) (6 citations) (Correct)
....model with a lossy communication medium. The availability of ahbi only depends on whether the other summand c(x) P can perform its input at c. An asynchronous process that non deterministically can chose to send ahbi or to receive at c(x) P should be written . ahbi c(x) P . Pierce and Nestmann [27] have showed that this form of choice, in which each summand is guarded by a or by an input prex, can be encoded in the asynchronous calculus. Their encoding can also be written in L. 12 2.5.2 Output capability One of the most important application areas for the calculus is object oriented ....
.... calculus) the loss of the axiomatisations of the ordinary calculus [29] 13 2.5. 5 Consequences of the constraints on the expressiveness Various encodings have been given that show that the loss of expressiveness moving from calculus to the asynchronous calculus and then to L is limited [27, 5, 17, 7] and in any case acceptable in a model of asynchronous communications. Palamidessi [28] has shown that the general choice operator of the calculus cannot be encoded in an asynchronous calculus, by proving that the symmetric leader election problem cannot be solved in a calculus without choice. ....
U. Nestmann and B. Pierce. Decoding choice encodings. In Proc. CONCUR '96, volume 1119 of Lecture Notes in Computer Science. Springer Verlag, 1996.
The Probabilistic Asynchronous π-Calculus - Herescu (2002) (7 citations) (Correct)
....corresponds to the simultaneous exchange of information between two partners. For several years there have been di#erent opinions regarding the expressiveness of asynchronous communication. The encodings of Honda Tokoro [14] and Boudol [5] for the output prefix and of Nestmann Pierce [32] for the input prefix partially legitimated the idea that the two communication mechanisms are equivalent. However, the full # calculus, and process algebras with synchronous communication in general, have a mixed choice mechanism, i.e. choice of prefixed processes where the prefixes can be ....
....of a non output choice construct, namely a summation of processes prefixed with # or input actions. Actually, 1] considers a binary non output sum operator instead of a n ary one, but under the assumption that the binary sum is commutative and associative, the two definitions coincide. Thanks to [32], we know that this construct does not increase the expressive power. In [32] it is shown that the asynchronous # calculus with input guarded choice can be encoded into its choice free fragment. It is easy to extend the encoding to include also # prefixes. The asynchronous # calculus (# ....
[Article contains additional citation context not shown here]
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR '96: Concurrency Theory (7th International Conference, Pisa, Italy, August 1996.
Abstractions for Fault-Tolerant Global Computing - Chothia, Duggan (2003) (1 citation) (Correct)
....T for short. We make use of the correctness results for the pik calculus to leverage a correctness proof for the atf calculus. We do this by first giving a translation from the atf calculus to the pik calculus, that preserves and reflects log consistency. We then show operational correspondence [39]: a reduction by a transaction in the atf calculus can always be matched by a number of reductions of that transaction s translation. Theorem 1 verifies that reductions in the pik calculus preserve log consistency. Therefore if the original transaction in the atf calculus is consistent, then any ....
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96: Concurrency Theory, 7th International Conference, volume 1119, pages 179--194, Pisa, Italy, 1996. Springer-Verlag. Also BRICS Technical Report RS-99-42.
What is a `Good' Encoding of Guarded Choice? - Nestmann (1997) Self-citation (Nestmann) (Correct)
No context found.
U. Nestmann and B. C. Pierce. Decoding Choice Encodings. In Proceedings of CONCUR '96, volume 1119 of LNCS, pages 179--194. Springer, 1996.
EXPRESS'98 --- to appear - On The Expressive Self-citation (Nestmann) (Correct)
No context found.
U. Nestmann and B. C. Pierce. Decoding Choice Encodings. In U. Montanari and V. Sassone, eds, Proceedings of CONCUR '96, volume 1119 of LNCS, pages 179--194. Springer, 1996.
A Semantic Theory for Global Computing Systems - Daniele Gorla Rosario (2003) (Correct)
No context found.
U. Nestmann and B. C. Pierce. Decoding choice encodings. Journal of Information and Computation, 163:1--59, 2000.
Abstractions for Fault-Tolerant Global Computing - Chothia, Duggan (2004) (1 citation) (Correct)
No context found.
U. Nestmann, B. C. Pierce, Decoding choice encodings, in: U. Montanari, V. Sassone (Eds.), CONCUR '96: Concurrency Theory, 7th International Conference, Vol. 1119, Springer-Verlag, Pisa, Italy, 1996, pp. 179--194.
On Bisimulations for the Asynchronous π-calculus? - Amadio, Castellani, Sangiorgi (1997) (Correct)
No context found.
U. Nestmann and B. Pierce. Decoding choice encodings. In CONCUR 96, Springer Lect. Notes in Comp. Sci. 1119, Pisa, 1996.
Minimality Results for the Spatial Logics - Hirschkoff, Lozes, Sangiorgi (2003) (1 citation) (Correct)
No context found.
U. Nestmann and B. Pierce. Decoding choice encodings. In Proc. CONCUR '96, volume 1119 of LNCS. Springer Verlag, 1996.
A Semantic Theory for Global Computing Systems - Daniele Gorla Rosario (2003) (Correct)
No context found.
U. Nestmann and B. C. Pierce. Decoding choice encodings. Journal of Information and Computation, 163:1--59, 2000.
The Join Calculus: A Language for Distributed Mobile Programming - Fournet, Gonthier (2000) (Correct)
No context found.
U. Nestmann and B. C. Pierce. Decoding choice encodings. In U. Montanari and V. Sassone, editors, 7th International Conference on Concurrency Theory (CONCUR '96), volume 1119 of LNCS, pages 179-194. Springer-Verlag, Aug. 1996. Revised full version as report ERCIM-10/97-R051, 1997.
A Randomized Distributed Encoding of the π-Calculus.. - Palamidessi, Herescu (2002) (Correct)
No context found.
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. Journal of Information and Computation, 163:1--59, 2000.
Probabilistic Asynchronous π-Calculus - Herescu, Palamidessi (2000) (2 citations) (Correct)
No context found.
U. Nestmann and B. Pierce. Decoding choice encodings. In Proc. of CONCUR '96, volume 1119 of LNCS, pages 179--194. Springer-Verlag, 1996. 20
A Calculus for Modeling Software Components - Nierstrasz, Achermann (2002) (Correct)
No context found.
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96: Concurrency Theory, 7th International Conference, volume 1119 of LNCS, pages 179--194, Pisa, Italy, August 1996. Springer-Verlag.
A Semantic Theory for Global Computing Systems - Gorla, Pugliese (2004) (Correct)
No context found.
U. Nestmann and B. C. Pierce. Decoding choice encodings. Journal of Information and Computation, 163:1--59, 2000.
Research Overview and Plans - Catuscia Palamidessi March (Correct)
No context found.
U. Nestmann and B.C. Pierce. Decoding choice encodings. In U. Montanari, editor, CONCUR 96, volume 1119 of Lecture Notes in Computer Science, pages 179--194. Springer-Verlag, 1996.
Towards Abstractions for Distributed Systems - Berger (2004) (4 citations) (Correct)
No context found.
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Proc. CONCUR'96, 1996.
Probabilistic Asynchronous π-Calculus - Herescu, Palamidessi (2000) (2 citations) (Correct)
No context found.
U. Nestmann and B. Pierce. Decoding choice encodings. In Proc. of CONCUR '96, volume 1119 of LNCS, pages 179--194. Springer-Verlag, 1996.
On Asynchrony in Name-Passing Calculi - Merro, Sangiorgi (2002) (47 citations) (Correct)
No context found.
U. Nestmann and B. Pierce. Decoding choice encodings. Journal of Information & Computation, 163:1--59, November 2000.
Towards Abstractions for Distributed Systems - Berger (2000) (4 citations) (Correct)
No context found.
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Proc. CONCUR'96, 1996.
Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001) (Correct)
No context found.
Uwe Nestmann and Benjamin C. Pierce. Decoding choice encodings. In Montanari and Sassone [MS96], pages 179-194. Revised full version as report ERCIM10 /97-R051, European Research Consortium for Informatics and Mathematics, 1997.
First 50 documents Next 50
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