Citation Context

...ce of communication model, the choice of communicable values, and the issue of fairness. Process algebras typcially take synchronous communication as primitive instead of asynchronous communication ((=-=Honda and Tokoro, 1991-=-) defines a variant of the -calculus with asynchronous communication). Synchronous communication can be simulated with asynchronous primitives (Amadio, 1994) and vice-versa, and it is probably the cas...

Citation Context

...hich in asynchrony never arises§3.2. Our subsequent work [2] studies a synchronous multiparty session type. A different direction is to consider asynchronous message passing without orderpreservation =-=[23]-=- which are also used in some computing environments (though in many environments we have efficient order-preserving transport such as TCP). Again we can use our modular articulation, by taking off OO-...

Citation Context

...uation P ; the fourth is parallel composition; the last is restriction. This variant of ��-calculus allows input guards x(~y):P , but not output guards xh~yi:P . It was introduced by Honda and Tok=-=oro [8]-=-, who show that output guarding can in fact be defined in terms of input guarding. As in [13], we first define a structural congruence relation j over process terms, by the following equations: P j Q ...

Citation Context

...algebra for processes (cf. ff-equality), we can view reduction relation as representing the basic mechanism of computation in a given formalism. Especially in the area of higher-order process calculi =-=[13, 14, 15, 8]-=-, it was found that the reduction-based formulation enjoys much more simplicity than the transition-based one. It remains open, however, whether we can have a general framework to derive meaningful pr...

Citation Context

...nous communication of values, as found in e.g. CSP [7, 8] or ��-calculus [17], is one of the simplest primitives for interaction 1 . We write them: 1 We note that, at the level of the basic calcul=-=us, [10, 11]-=- have shown that a simpler primitive called asynchronous name passing, suffices to represent general interaction structures. However for the high-level description and type abstraction of interaction ...

Citation Context

...g to type structures, and equated by a variant of bisimilarity. The formalism can be regarded as a typed $1^{\cdot}eco\iota\downarrow\backslash t\iota\cdot\iota(:tion$ of name passing process calculi =-=[4, 15, 16, 7, 3, 12]-=-. Types for interaction start from constant types, say nat, which denote fixed patterns of interaction. Then we $1_{1}ave$ input and output types, symbolised as $\downarrow\delta$ ’ and $\uparrow\delt...