C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In Proceedings of ICALP'96, LNCS 1099, pages 490--501. Springer-Verlag, 1996. To appear in TCS.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in a form similar to those of the causal transition system of [14] Our starting point is the proved transition system of CCS [17] PTS for short. This very concrete representation of systems has been used to describe qualitative and quantitative non interleaving aspects of concurrent computations [32,33,4]. The transitions are labelled by encodings of their proofs, that encode also most of the aspects briefly mentioned above. The first and the last author used abstract interpretation in [5] to extract the causal computations from the proved computations of the PTS, and sketched how other kinds of ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In Proceedings of ICALP'96, LNCS 1099, pages 490--501. Springer-Verlag, 1996. To appear in TCS.

....of hosts. It is therefore desirable to control tightly the scope of names and be prepared to promote a locally unique name to global uniqueness. One approach for avoiding ff conversion is to use a location aware naming scheme, such as the one described in the work of Bodei, Degano and Priami [9] who proposed that names be tied to their creation point in the syntax tree and that relative paths in the syntax tree be used to differentiate between equal names. In our setting this approach would fail as processes may move requiring tracking or forwarding services. A less elegant ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In auf der Heide and Monien [6], pages 490--501. Full version as Universit`a di Pisa Technical Report Handling Locally Names of Mobile Agents, 1996.

....P . Therefore, our construction preserves qualitative properties of systems. Hereafter, we denote with A(x;P ) the predicate of x being active in P , and with new(P ) a function that returns the first name not used in P (assuming names totally ordered) For an effective definition of new(P ) see [6, 33]. Rules in Tab. 2 update the distributions of the transitions in correspondence of branching points. Note that in rule F br 2 we assume T being a random variable with distribution F = Proposition 2.6 shows how to compute P(T t j V T 6=T i 2T r(P ) T T i ) We now define proved ....

....r(P ) T T i ) We now define proved computations, and we require them to be fresh. Intuitively, in a fresh computation all names exported by a bound output or imported by an input are never used in the preceding transitions [7] For a constructive operational definition of fresh computations see [6]. Stochastic calculus with general distributions 47 Fbr 0 : P #x(y) F Gamma P 0 P #xw; F 7 Gamma P 0 fw=yg # ; ae A(w;P ) w = new(P ) F = P(T t j V T 6=T i 2T r(P ) T T i ) Fbr 1 : P #x(y) F Gamma P 0 P #x(w) F 7 Gamma P 0 fw=yg # ; ae w = new(P ) F ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In Proceedings of ICALP'96, LNCS 1099, pages 490--501. Springer-Verlag, 1996.

....activity according to the target architecture. The second way acts on data to be refined. The information about the specific architecture on which the real implementation runs is crucial. For example, consider the problem of transforming global environments of mobile processes into local ones. In [1], we derived from the proved transition system the parallel structure of processes and to build relative addresses. Once names are enriched with these addresses, no clash is possible and the usual ff conversions become useless. This technique is reminiscent of the static chain of sequential ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In Proceedings of ICALP'96, LNCS. Springer-Verlag, 1996.

....VDM approach [18] and in the process algebras field [10] The second way acts on data to be refined. The information about the specific architecture on which the real implementation runs is crucial. For example, consider the problem of handling environments of mobile processes in a local fashion [2]. The specification of a system and its subsequent refinements, closer and closer to real code, are error prone activities. Thus, automatic tools must assist implementors. ffl Computer aided verification. In the past few years, there has been a growing interest in the field of system analysis. ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In Proceedings of ICALP'96, LNCS. Springer-Verlag, 1996.

....allow us to pass easily from one semantics to another simply by relabelling the transitions. Although labels of transitions may appear to be long wired, it is worth noticing that all relabellings can be dealt with mechanically. Finally, we mention the use of proved transition systems made in [1]. Proof terms allow us to equip processes with their private, local environment. Essentially, the operational semantics given there includes a specification of a fully distributed name manager. Acknowledgements. We thank Marco Pistore, Davide Sangiorgi, Lone Leth Thomsen and Bent Thomsen for their ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In Proceedings of ICALP'96, LNCS 1099, pages 490--501. Springer-Verlag, 1996.

....34, 73, 9] Also, proved transition systems can originate a hierarchy of semantic descriptions of the same process that are closer and closer to actual implementations. The parallel structure of processes, i.e. the network topology, made explicit by in the proofs of transitions, is exploited in [8] for transforming global environments of mobile processes into local ones. Performance evaluation and other quantitative analysis should start already at the design level. Besides robustness and reliability of the design, these early measures may save e orts. Indeed, if the design meets all ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In Proceedings of ICALP'96, LNCS 1099, pages 490-501. Springer-Verlag, 1996.

....is mapped onto a sequence of lower level ones. The second way acts on data to be refined. The information about the specific architecture on which the real implementation runs is crucial. For example, consider the problem of transforming global environments of mobile processes into local ones. In [3], we derived from the proved transition system the parallel structure of processes and to build relative addresses. Once names are enriched with these addresses, they are handled locally. Our economic, parametric approach goes towards a long run goal: the realization of (semi ) automatic ....

C. Bodei, P. Degano, and C. Priami. Mobile processes with a distributed environment. In In Proceedings of ICALP'96, LNCS. Springer-Verlag, 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