The pi-calculus, its asynchronous version and Boudol's mapping from the former language to the latter one are well-known mathematical objects in theoretical computer science. It is also well-known that the mapping is not fully-abstract w.r.t. most of the semantics defined over these two languages. In this paper we study and fix conditions on the existence of fully-abstract results for Boudol's mapping (and its variants). The testing theories \`a la De Nicola-Hennessy turned out to be very useful tools for such a purpose.
On Synchronous and Asynchronous Communication Paradigms
CACCIAGRANO, Diletta Romana;CORRADINI, Flavio
2001-01-01
Abstract
The pi-calculus, its asynchronous version and Boudol's mapping from the former language to the latter one are well-known mathematical objects in theoretical computer science. It is also well-known that the mapping is not fully-abstract w.r.t. most of the semantics defined over these two languages. In this paper we study and fix conditions on the existence of fully-abstract results for Boudol's mapping (and its variants). The testing theories \`a la De Nicola-Hennessy turned out to be very useful tools for such a purpose.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
