# What is a "Good" Encoding of Guarded Choice?

@article{Nestmann2000WhatIA, title={What is a "Good" Encoding of Guarded Choice?}, author={Uwe Nestmann}, journal={Inf. Comput.}, year={2000}, volume={156}, pages={287-319} }

Abstract The π -calculus with synchronous output and mixed-guarded choices is strictly more expressive than the π -calculus with asynchronous output and no choice. This result was recently proved by C. Palamidessi and, as a corollary, she showed that there is no fully compositional encoding from the former into the latter that preserves divergence-freedom and symmetries. This paper argues that there are nevertheless “good” encodings between these calculi. In detail, we present a series of…

## 117 Citations

### Comparing the expressive power of the synchronous and asynchronous $pi$-calculi

- Computer ScienceMathematical Structures in Computer Science
- 2003

It is shown that there does not exist any uniform, fully distributed translation from the $\pi$-calculus into the asynchronous $\pi$, up to any ‘reasonable’ notion of equivalence.

### A Fully Abstract Encoding of the pi-Calculus with Data Terms

- Computer ScienceICALP
- 2005

Full abstraction proves that it does not matter whether observers are formulated in π or πT, both are equally expressive in this respect, and the technical new idea consists of achieving full abstraction by encoding data as table entries rather than active processes and using a firewalled central integrity manager to ensure data security.

### On the Validity of Encodings of the Synchronous in the Asynchronous π-calculus

- Computer ScienceInf. Process. Lett.
- 2018

### On the Expressiveness of Mixed Choice Sessions

- Computer ScienceElectronic Proceedings in Theoretical Computer Science
- 2022

In spite of an inclusion of unrestricted channels with mixed choice, CMV +’s mixed choice is rather separate and not mixed, and it is shown that there exists no good encoding from the π -calculus into CMV, preserving distribution.

### On the Expressiveness of Mixed Choice Sessions (Technical Report)

- Computer ScienceArXiv
- 2022

This technical report extends a paper presented at the workshop EXPRESS/SOS’22, showing that there exists no good encoding from the π -calculus into CMV + , preserving distribution and proving its soundness and thereby that the encoding is good up to coupled similarity.

### A randomized encoding of the Pi-calculus with mixed choice

- Computer Science, MathematicsTheor. Comput. Sci.
- 2005

### What’s TyCO, After All?

- Computer Science
- 2009

An encoding from local πV a to TyCO is proposed and it is shown that it is fully abstract and good, and Uniform TyCO can be seen as a sub-calculus of π v a, the only difference being that πv a requires a separate construct for analysing an input while in TyCO input and value analysis are tightly bound.

### Separation of synchronous and asynchronous communication via testing

- Computer ScienceTheor. Comput. Sci.
- 2005

### A Fully Abstract Encoding of the π-Calculus with Data Terms (Extended Abstract)

- Computer Science
- 2005

Full abstraction proves that it does not matter whether observers are formulated in π or πT, both are equally expressive in this respect, and the technical new idea consists of achieving full abstraction by encoding data as table entries rather than active processes, and using a firewalled central integrity manager to ensure data security.

## References

SHOWING 1-10 OF 70 REFERENCES

### Decoding Choice Encodings

- Computer ScienceInf. Comput.
- 1996

It is shown that the divergent encoding of the asynchronous π-calculus with input-guarded choice 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.

### Comparing the expressive power of the synchronous and the asynchronous π-calculus

- Computer Science, MathematicsPOPL '97
- 1997

It is shown that there does not exist any uniform, parallel-preserving, translation from the ¿-calculus into the asynchronous ¹calculus, up to any "reasonable" notion of equivalence, and this result is based on the incapablity of the asynchronous¬calculus of breaking certain symmetries possibly present in the initial communication graph.

### On the No-Counterexample Interpretation

- MathematicsJournal of Symbolic Logic
- 1999

The complexity is determined of the modus ponens rule for (i) PA-provable sentences, (ii) for arbitrary sentences A,B ∈ L(PA) uniformly in functionals satisfying the n. i.c.i. of (prenex normal forms of) A and A→ B, and (iii).

### Graph Types for Monadic Mobile Processes

- Computer ScienceFSTTCS
- 1996

This work solves the problem of type abstraction in the monadic setting with an extension of sorting which captures dynamic aspects of process behaviour in a simple way and is general enough to be extendable to encodings of calculi with more complex operational structures.

### The Second Futamura Projection for Type-Directed Partial Evaluation

- Computer SciencePEPM '00
- 1999

This work derives an ML implementation of the second Futamura projection for Type-Directed Partial Evaluation (TDPE), and demonstrates the technique with several examples, including compiler generation for Tiny, a prototypical imperative language.

### The Name Discipline of Uniform Receptiveness (Extended Abstract)

- Computer ScienceICALP
- 1997

The situation in which certain names are uniformly receptive, a paradigmatical process calculus for message-passing concurrency, is studied, which guarantees receptiveness by demanding that the name is available in input-replicated form as soon as created.

### Typing and subtyping for mobile processes

- Computer Science[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
- 1993

The authors define the syntax, typing, subtyping, and operational semantics of their calculus, prove that the typing rules are sound, apply the system to Milner's lambda -calculus encodings, and sketch extensions to higher-order process calculi and polymorphic typing.

### A partially deadlock-free typed process calculus

- Computer ScienceProceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
- 1997

A novel static type system for a process calculus, which ensures both partial deadlock-freedom and partial confluence and classification of communication channels into reliable and unreliable channels based on their usage and a guarantee of the usage by the type system.