Results 1 
1 of
1
Minimality and Separation Results on Asynchronous Mobile Processes  Representability Theorems by Concurrent Combinators (Extended Abstract)
 In Proceedings of CONCUR '98, number 1466 in Lecture Notes in Computer Science
, 1998
"... ) y Nobuko Yoshida ? Abstract. In [18, 19], we presented a theory of concurrent combinators for the asynchronous monadic ßcalculus without match or summation operator [7, 16]. The system of concurrent combinators is based on a finite number of atoms and fixed interaction rules, but is as expressi ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
) y Nobuko Yoshida ? Abstract. In [18, 19], we presented a theory of concurrent combinators for the asynchronous monadic ßcalculus without match or summation operator [7, 16]. The system of concurrent combinators is based on a finite number of atoms and fixed interaction rules, but is as expressive as the original calculus, so that it can represent diverse interaction structures, including polyadic synchronous name passing [23] and input guarded summations [26]. The present paper shows that each of the five basic combinators introduced in [18] is indispensable to represent the whole computation, i.e. if one of the combinators is missing, we can no longer express the original calculus up to weak bisimilarity. Expressive power of several interesting subsystems of the asynchronous ßcalculus is also measured by using appropriate subsets of the combinators and their variants. Finally as an application of the main result, we show there is no semantically sound encoding of the calculus in...