This paper studies the relationship between synchronous and asynchronous mobile processes, in the setting of the #pi#-calculus. A type system for processes of the asynchronous monadic subcalculus is introduced and used to obtain a full-abstraction result: two processes of the polyadic #pi#-calculus are typed bared congruent iff their translations into the subcalculus are asynchronous-monadic-typed barbed congruent.
展开▼