G. Boudol. Asynchrony and the p-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A theory of bisimulation for a fragment of concurrent ML with .. - Jeffrey, Rathke (2000) (6 citations) (Correct)
....are necessary in order to distinguish, say, n[let x = joinn 0 intrue] 6 n[let x = joinn 0 infalse] However, it is not observable in this language whether a thread is currently waiting on another to terminate. This bears similarity to the situation of the asynchronous p calculus [3, 12] and the transitions we use are akin to those for input receptivity [12] The use of the free name context allows us to model the static scoping discipline present in CML. The transition rules we use are those of [15] and the side conditions in the two rules for inferring transitions under nn: ....
G. Boudol. Asynchrony and the p-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991.
A theory of bisimulation for a fragment of concurrent ML with .. - Jeffrey, Rathke (2000) (6 citations) (Correct)
.... s C 0 ) D nn : s : C) g (D nn : s : C 0 ) n 62 g] D;n 0 : s C) n:n (D;n 0 : s C 0 ) D nn 0 : s : C) n:nn (D;n 0 : s C 0 ) n 6= n 0 ] Figure 5: Labelled transition system semantics bears similarity to the situation of the asynchronous p calculus [2, 12] and the transitions we use are akin to those for input receptivity [12] The use of the free name context allows us to model the static scoping discipline present in CML. The intention is that the names in D are global and thus known to the observer. The transition rules we use are those of [15] ....
G. Boudol. Asynchrony and the p-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991.
Mobile Ambients - Cardelli, Gordon (1998) (386 citations) (Correct)
....Q R (Red Res) Red Par) P 7 P, P . Q, Q 7 Q P . Q (Red 7) 26 Thursday, February 11, 1999, 4:36 pm Encoding of the Asynchronous p calculus This encoding includes the choice free synchronous p calculus, since it can itself be encoded within the asynchronous p calculus [4, 14]. Moreover, since the l calculus can be encoded in the asynchronous p calculus [4] we can indirectly encode the l calculus. The encoding respects the semantics of the asynchronous p calculus, in the sense that a reduction step in the asynchronous p calculus can be emulated by a number of ....
.... 26 Thursday, February 11, 1999, 4:36 pm Encoding of the Asynchronous p calculus This encoding includes the choice free synchronous p calculus, since it can itself be encoded within the asynchronous p calculus [4, 14] Moreover, since the l calculus can be encoded in the asynchronous p calculus [4], we can indirectly encode the l calculus. The encoding respects the semantics of the asynchronous p calculus, in the sense that a reduction step in the asynchronous p calculus can be emulated by a number of reduction steps and equivalences in the ambient calculus, as shown by the next ....
Boudol, G., Asynchrony and the p-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992.
Mobile Ambients - Cardelli, Gordon (1998) (386 citations) (Correct)
.... (np) n[ open io] p[P xM ] open p) #### (np) n[ open io] P xM ) # ch n P xM 26 Friday, July 4, 1997, 11:55 am Encoding of the Asynchronous p calculus This encoding includes the choice free synchronous p calculus, since it can itself be encoded within the asynchronous p calculus [4, 12]. We can fairly conveniently use these definitions to embed communication on named channels within the ambient calculus (provided the name io is not used for other purposes) Communication on these named channels, though, only works within a single ambient. In other words, from our point of view, ....
....view, a p calculus process always inhabits a single ambient. Therefore, the notion of mobility in the p calculus (communication of names over named channels) is different from our notion of mobility. 3. 7 Encoding the l calculus Since the l calculus can be encoded in the asynchronous p calculus [4], and the asynchronous p calculus can be encoded in the ambient calculus, we can in a way already encode the l calculus. However, we are looking here for a more direct solution. The l calculus is relatively difficult to encode in the ambient calculus because processes are not values; any ....
Boudol, G., Asynchrony and the p-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992.
A theory of bisimulation for a fragment of concurrent ML - With Local Names (Correct)
No context found.
G. Boudol. Asynchrony and the p-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1991.
Abstractions for Mobile Computation - Cardelli (1998) (67 citations) (Correct)
No context found.
Boudol, G., Asynchrony and the p-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992.
A Typed Language for Distributed Mobile Processes (Extended.. - Riely, Hennessy (1998) (101 citations) (Correct)
No context found.
G. Boudol. Asynchrony and the p-calculus. Research Report 1702, INRIA, Sophia-Antipolis, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC