Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous -calculus. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96, volume 1119 of Lecture Notes in Computer Science, pages 147-162. Springer-Verlag, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... [22] We also give symbolic characterizations of the new equivalences, which means that they can be investigated using the symbolic methods of [15] Site failure has also played a role in languages studied in [2, 4, 12] In these papers abstract languages based on Facile [13] or the pi calculus [19, 5] are studied. The original motivation for this paper was to provide an alternative characterization of barbed equivalence for languages such as these. Although we have not treated value passing or references, we postulate that our results can be extended in a straightforward way to value passing ....

Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous r-calculus. In CONCUR96, volume 1119 of LNCS, pages 147 162. Springer, 1996.

....related work to x6. The calculus is based on asynchronous message passing, with components interacting only by the exchange of unordered asynchronous messages. Box has an asynchronous calculus as a subcalculus we build on a large body of work studying such calculi, notably [HT91, Bou92, ACS96] They are known to be very expressive, supporting many programming idioms including functions and objects, and are Turing complete; a box process may therefore perform arbitrary internal computation. To we must add primitives for constraining communication in standard calculi, if one ....

.... it can be found in Appendix A. 2.4 Bisimulation The statements of some relationships between the behaviour of a wrapped and an unwrapped program require an operational equivalence relation. As box is asynchronous, an appropriate notion can be based on the weak asynchronous bisimulation of [ACS96] Consider a family S of relations indexed by nite sets of names such that each SA is a symmetric relation over f P j fn(P ) A g. Say S is a weak asynchronous bisimulation if P SA Q, A P P 0 and is an output or transition imply 9Q 0 : A Q = Q 0 P 0 SA[fn( Q ....

Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous -calculus. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96, volume 1119 of Lecture Notes in Computer Science, pages 147-162. Springer-Verlag, 1996.

....is beyond the scope of this paper. The calculus is based on asynchronous message passing, with components interacting only by the exchange of unordered asynchronous messages. Box has an asynchronous calculus as a subcalculus we build on a large body of work studying such calculi, notably [21, 7, 5]. They are known to be very expressive, supporting many programming idioms including functions and objects, and are Turing complete; a box process may therefore perform arbitrary internal computation. The use of asynchronous communication allows two components to interact without creating a ....

Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous - calculus. In Ugo Montanari and Vladimiro Sassone, editors, Proceedings CONCUR 96, Pisa, Italy, volume 1119 of LNCS, pages 147-162, 1996.

....related work to x6. The calculus is based on asynchronous message passing, with components interacting only by the exchange of unordered asynchronous messages. Box has an asynchronous calculus as a subcalculus we build on a large body of work studying such calculi, notably [HT91, Bou92, ACS96] They are known to be very expressive, supporting many programming idioms including functions and objects, and are Turing complete; a box process may therefore perform arbitrary internal computation. To we must add primitives for constraining communication in standard calculi, if one ....

....it can be found in Appendix A. 2.4 Bisimulation To make precise the statement that a wrapper does not change the behaviour of wellbehaved programs we need an operational equivalence relation. As box is asynchronous, an appropriate notion can be based on the weak asynchronous bisimulation of [ACS96] Consider a family S of relations indexed by finite sets of names such that each SA is a symmetric relation over f P j fn(P ) A g. Say S is a weak asynchronous bisimulation if ffl P SA Q, A P Gamma P 0 and is an output or transition imply 9Q 0 : A Q = Q 0 P 0 S ....

Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous ß-calculus. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96, volume 1119 of Lecture Notes in Computer Science, pages 147--162. Springer-Verlag, 1996.

....therefore, to find alternative characterizations of the equivalence which do not involve universal quantification over observers. Such alternative characterizations, in the form of (labelled) bisimulation relations, have been given, for example, for the synchronous and asynchronous p calculi [20, 4] and for distributed CCS [18] In the full paper, we present such an alternative characterization of barbed equivalence for Dp, for image finite processes. Space does not permit us to present the full definition here, rather we discuss some of the issues involved in developing the labelled ....

....Space does not permit us to present the full definition here, rather we discuss some of the issues involved in developing the labelled transition system (LTS) which is the basis of the alternative characterization. In constructing a labelled transition relation for the ordinary p calculus [15, 20, 4], one must be careful to distinguish the communication of a free name (which a testing context may already know about) from the communication of a bound name (which is guaranteed to be fresh for any testing context) In the p calculus only the possession of a name is important: either a tester has ....

Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous p-calculus. In U. Montanari and V. Sassone, editors, CONCUR: Proceedings of the International Conference on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 147--162, Pisa, August 1996. Springer-Verlag.

.... [22] We also give symbolic characterizations of the new equivalences, which means that they can be investigated using the symbolic methods of [15] Site failure has also played a role in languages studied in [2, 4, 12] In these papers abstract languages based on Facile [13] or the pi calculus [19, 5] are studied. The original motivation for this paper was to provide an alternative characterization of barbed equivalence for languages such as these. Although we have not treated value passing or references, we postulate that our results can be extended in a straightforward way to value passing ....

Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous p-calculus. In CONCUR96, volume 1119 of LNCS, pages 147--162. Springer, 1996.

....c q def , for every liveset L, p c L q If P L Q we say that P and Q are barbed equivalent at L, and similarly for the congruence. 1 Strong barbed equivalence ( and congruence ( c ) are obtained in the same manner from : Remark 2.3. Our terminology is inspired by that of [29, 5], in which barbed equivalence is defined by closing over static contexts (that is, those contexts built up using only parallel composition, restriction and renaming) and barbed congruence is defined by closing over all contexts, including dynamic contexts such as [ a. As usual for ....

....is unaffected if one allows distributed choices, using a syntax closer to that of [3] Distributed Processes and Location Failures 35 Related work. Site failure has also played a role in languages studied in [3, 4, 16] In these papers abstract languages based on Facile [17] or the pi calculus [24, 5] are studied. The original motivation for this paper was to provide an alternative characterization of barbed equivalence for languages such as these. Although we have not treated value passing or references, we postulate that our results can be extended in a straightforward way to value passing ....

Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous p-calculus. In U. Montanari and V. Sassone, editors, CONCUR: Proceedings of the International Conference on Concurrency Theory, volume 1119 of Lecture Notes in Computer Science, pages 147--162, Pisa, August 1996. Springer-Verlag.

....such that Gamma p . We conclude by giving a typed congruence with a tractable definition that refines and may suffice for many program transformations. Further work should take into account the asynchronous nature of Pict and a larger fragment of its type system, building on [ACS96, PS96]. Say weak divergence bisimulation, written , is the largest type context indexed family of relations such that each Gamma is a symmetric relation over f P j Gamma P g and, for all P Gamma Q: if Gamma P ff Gamma Delta P 0 then 9Q 0 : Gamma Q ff = Delta Q 0 P ....

Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous ß-calculus. In Montanari and Sassone [MS96], pages 147--162.

No context found.

Roberto M. Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous -calculus. In Ugo Montanari and Vladimiro Sassone, editors, CONCUR '96, volume 1119 of Lecture Notes in Computer Science, pages 147-162. Springer-Verlag, 1996.

No context found.

Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous -calculus. In Proc. CONCUR'96, 1996.

No context found.

Roberto Amadio, Ilaria Castellani, and Davide Sangiorgi. On bisimulations for the asynchronous -calculus. In Proc. CONCUR'96, 1996.

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