Davide Sangiorgi. Lazy functions and mobile processes. Rapport de recherche 2515, INRIA, Sophia Antipolis, 1995. 18  Home/Search   Document Details and Download   Summary   Related Articles   Check

....be =# #=#. Weak early bisimulation ( is obtained by replacing all of the instances of Q Q # in Definition 2.1 with Q =# Q # . The asynchronous case. Following [4,16] we define the asynchronous # (a as the restricted language with non blocking output and without summation. In [27] it is shown that in the asynchronous # calculus without matching, weak ground bisimulation ( becomes a congruence. This result does not hold for a# i when i 2, because of the ability to encode matching. For example b(x) x = a]x#a# b(x) 0, but adding an output which sends a on ....

Sangiorgi, D., Lazy functions and mobile processes, in: Proof, Language and Interaction: Essays in Honour of Robin Milner (2000).

....in the input clause, there is an implicit universal quantification on the received keys, whereas we always assume to receive fresh channels by requiring that for each a # fn(v)#fn(P, Q) it holds that # # a:K. In asynchronous calculi without name testing, ground and early bisimilarity coincide [30, 9]. Since in well typed processes we test only keys (i) it makes sense to have the simpler ground clause on channels, ii) our bisimilarity coincides with its (channel) early variant in which the requirement in the input clause that for each a # fn(v) # fn(P, Q) it holds that # # a:K, is ....

Davide Sangiorgi. Lazy functions and mobile processes. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000. Available as INRIA Sophia-Antipolis Rapport de Recherche RR-2515.

....in the input clause, there is an implicit universal quanti cation on the received keys, whereas we always assume to receive fresh channels by requiring that for each a 2 fn(v) fn(P; Q) it holds that a:K. In asynchronous calculi without name testing, ground and early bisimilarity coincide [San00, Hon92] Since in well typed processes we test only keys (i) it makes sense to have the simpler ground clause on channels, ii) our bisimilarity coincides with its (channel) early variant in which the requirement in the input clause that for each a 2 fn(v) fn(P; Q) it holds that a:K, is ....

D. Sangiorgi. Lazy Functions and Mobile Processes. In G. Plotkin, C. Stirling and M. Tofte, eds, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000. Available as INRIA Sophia-Antipolis Rapport de Recherche RR-2515.

....keys and ground on channels. Indeed, in the input clause, there is an implicit universal quanti cation on the received keys, whereas we always assume to receive fresh channels by requiring fc(v) fc(P j Q) In asynchronous calculi without name testing, ground and early bisimilarity coincide [San00, Hon92] Since we only have testing on keys (i) it makes sense to have the simpler ground clause on channels, ii) our bisimilarity coincides with its (channel) early variant in which the requirement fc(v) fc(P j Q) in the input clause, is omitted. The proof that this early variant is a ....

D. Sangiorgi. Lazy Functions and Mobile Processes. In G. Plotkin, C. Stirling and M. Tofte, eds, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000. Available as INRIA Sophia-Antipolis Rapport de Recherche RR-2515.

....as L evy Longo trees. In [33] Sangiorgi considers the embedding of lazy calculus in some concurrent calculi. First, Milner s encoding of lazy calculus in calculus is studied. A (slight variant of) this encoding gives rise to a calculus model whose theory is again that of L evy Longo trees [34]. Then the lazy calculus is enriched with a simple non deterministic operator, which, when applied to an argument, either gives the argument itself or diverges. In both cases the processes are compared using bisimulation. So we can conclude that non determinism bisimulation has the ....

....the behaviours of processes at intermediate steps of computation rather than just the input output relation. Then, as pointed out in [9] there are various notions of bisimulation (see for example [25, 26, 32] and there is no consensus on which is the proper one. Notably Sangiorgi proves in [34] that these notions of bisimulation coincide on the sublanguage of calculus which suffices for encoding lazy calculus. On the other side, the calculus of multiplicities of [12] does not seem of independent interest, while systems similar to the concurrent calculus have been studied in ....

Sangiorgi, D. (1995), "The lazy functions and mobile processes", Rapport de Recherche 2515, INRIA, Sophia-Antipolis.

....informally introduce the key concepts of the FORM calculus [SCH 99] We will not present, however, the complete definition of the calculus, since this is beyond the scope of this paper. The FORM calculus is an inherently polymorphic variant of the (polyadic) # calculus [BOU 92, MIL 92, HON 92, SAN 95] where the communication of tuples is replaced by communication of so called forms, a special notion of extensible records. More precisely, in the FORM calculus polyadic tuple communication is replaced by monadic communication of forms. By this approach, we address the inherent problem that ....

SANGIORGI D., "Lazy functions and mobile processes", Technical report num. RR2515, INRIA Sophia-Antipolis, 1995.

....value of which is immaterial) the question is to determine exactly what is the preorder on terms given by M v N , E [ M ] u v E [ M ] u Sangiorgi studied a similar question, where the may testing v is replaced by weak bisimulation, denoted here . He showed see [23, 24] and especially [25], from which we shall borrow some results that this semantics M N on terms coincides with equality in a semantics given by L evy in [13] for the calculus. In [15] Longo gave a suggestive presentation of L evy s interpretation, by means of what are now called L evy Longo trees, a ....

....4 G erard Boudol and Cosimo Laneve reasonable semantics one can imagine. This was established by Longo in [15] who showed that any reasonable model induces a semantics which is weaker than L evy s one. Then the semantics on terms is at the same time very sharp and still reasonable . In [25], Sangiorgi indicated that one may suspect that may testing equivalence, that is M N if and only if M v N and N v N , and bisimulation M N coincide a reason should be that terms are deterministic processes . This is indeed a consequence of a result of this paper: we show, thus ....

[Article contains additional citation context not shown here]

D. Sangiorgi. Lazy functions and mobile processes. 1995.

....value of which is immaterial) the question is to determine exactly what is the preorder on terms given by M v N , E [ M ] u v E [ M ] u Sangiorgi studied a similar question, where the may testing v is replaced by weak bisimulation, denoted here . He showed see [23, 24] and especially [25], from which we shall borrow some results that this semantics M N on terms coincides with equality in a semantics given by L evy in [13] for the calculus. In [15] Longo gave a suggestive presentation of L evy s interpretation, by means of what are now called L evy Longo trees, a ....

....which may be regarded as the finest reasonable semantics one can imagine. This was established by Longo in [15] who showed that any reasonable model induces a semantics which is weaker than L evy s one. Then the semantics on terms is at the same time very sharp and still reasonable . In [25], Sangiorgi indicates that one may suspect that may testing equivalence M N (that is M v N and N v N ) and bisimulation M N coincide a reason should be that terms are deterministic processes . This is indeed a consequence of a result of this paper: we show, thus answering ....

[Article contains additional citation context not shown here]

D. Sangiorgi. Lazy functions and mobile processes. This Volume, 1995.

....about ordinary equivalence (in the case of CCS, weak bisimulation) seems to have come later; in (Sangiorgi and Milner 1992) the efficiency preorder, also dubbed expansion, is used to provide a bisimulation up to proof technique for weak bisimulation. In the setting of the pi calculus, Sangiorgi (1995, 1994) has used a refinement of these earlier proof techniques to great effect in studying the relationships between various calculi. The proof technique in question is called bisimulation up to context and up to , where is the expansion relation. We will not go into the details of ....

Sangiorgi, D. (1995). Lazy functions and mobile processes. Rapport de recherche 2515, INRIA Sophia Antipolis.

No context found.

D. Sangiorgi. Lazy functions and mobile processes. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 2000.

No context found.

Davide Sangiorgi. Lazy functions and mobile processes. Rapport de recherche 2515, INRIA, Sophia Antipolis, 1995. 18

No context found.

Davide Sangiorgi. Lazy functions and mobile processes. Rapport de recherche 2515, INRIA, Sophia Antipolis, 1995.

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