| C. Laneve and B. Victor. Solos in concert. In ICALP'99, LNCS 1644:513--523. |
....explains why fragmententation becomes relevant for a distributed implementation. We treat fragmentation formally by showing that a calculus with limited continuations the explicit solos calculus is as expressive as the full calculus with continuations. This builds upon earlier results in [13, 10]. The di#erences between our model and that of Facile and Jocaml are as follows. Facile uses two classes of distributed entities: co )located processes which execute, and channel managers which mediate interaction. This forces it to use a hand shake discipline for rendezvous. Jocaml simplifies ....
....transport the entire environment to every continuation. An encoded term could then be executed directly on the distributed channel machine. The second encoding is based upon the fusion calculus of Parrow and Victor [12] a calculus in which the input command u#y.P is not binding. The encoding [10] uses the sub calculus with only solos u x and u x. It uses the reaction relation (#z) u u#y R) R# where every equivalence class generated by x = y has exactly one element not z, and the substitution # collapses each equivalence class to its one element. A ....
[Article contains additional citation context not shown here]
C. Laneve and B. Victor. Solos in concert. In ICALP'99, LNCS 1644:513--523.
No context found.
C. Laneve and B. Victor. Solos in concert. In ICALP'99, LNCS 1644:513--523.
....the pure pi calculus, and we leave pre deployment as a compiletime optimisation. Note that in the case of input mobility u(x) x(y) P , the ultimate location of x(y) cannot be known until after u(x) but even so we can still pre deploy P . Other authors have proposed weaker forms of fragmentation [8, 4] but in a theoretical setting, not for implementation. Location based calculi. The dominant paradigm in the research community is not channel based but rather location based. This means: assume several locations, each containing a collection of programs with their own channels. For instance, the ....
C. Laneve and B. Victor. Solos in concert. In ICALP'99, LNCS 1644:513--523.
....These particles are called solos and take the general forms u e x for input and u e x for output, where e x is a sequence of names. This solos calculus additionally includes only parallel composition P j Q, scoping (x)P and replication P , giving a very lean formalism. We refer the reader to [10] for further explanation of the expressive power of solos. The replication operator P is often used in place of recursive de nitions, since it has nice algebraic properties. For example, if the number of recursive definitions is nite, recursion can be coded in terms of replication [13] ....
....x, then Q # x. P is barbed bisimilar to Q, written P Q, if P S Q for some weak barbed bisimulation S. P is barbed congruent to Q, written P Q, if for all contexts C[ C[P ] C[Q] The solos calculus, although simple, is expressive enough. The next theorem recalls a result in [10]. Theorem 4. There exists an encoding [ of the full fusion calculus into the calculus of solos such that [ P ] Q] implies P Q, and P Q implies [ P ] Q] This implies that C[P ] C[Q] i [ C[P ] C[Q] for any fusion calculus context C[ 2.1 The ....
[Article contains additional citation context not shown here]
C. Laneve and B. Victor. Solos in concert. In J. Wiederman, P. van Emde Boas, and M. Nielsen, editors, Proc. of ICALP '99, volume 1644 of LNCS, pages 513-523. Springer, July 1999.
No context found.
C. Laneve and B. Victor. Solos in Concert. In Proc. 26th ICALP, volume 1644 of Lecture Notes in Computer Science. Springer Verlag, 1999.
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