On synchronous and asynchronous communication paradigms
Theoretical Computer Science: 7th Italian Conference, ICTCS 2001 Torino, Italy …, 2001•Springer
The π-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 mappingi s not fully-abstract wrt most of the semantics defined over
these two languages. In this paper we study and fix conditions on the existance of fully-
abstract results for Boudol's mapping (and its variants). The testing theories à la De Nicola-
Hennessy turned out to be very useful tools for such a purpose.
the latter one are well-known mathematical objects in theoretical computer science. It is also
well-known that the mappingi s not fully-abstract wrt most of the semantics defined over
these two languages. In this paper we study and fix conditions on the existance of fully-
abstract results for Boudol's mapping (and its variants). The testing theories à la De Nicola-
Hennessy turned out to be very useful tools for such a purpose.
Abstract
The π-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 mappingi s 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 existance of fully-abstract results for Boudol’s mapping (and its variants). The testing theories à la De Nicola-Hennessy turned out to be very useful tools for such a purpose.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果