Philippa Gardner and Lucian Wischik. Explicit fusions. In Mogens Nielsen and Branislav Rovan, editors, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS'00), volume 1893 of Lecture Notes in Computer Science, pages 373--382. Springer Verlag, 2000. Full version to appear in TCS. 40  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of structural congruence. In some ways, our model can be regarded as a distributed version of the single processor model first described by Cardelli [3] and subsequently used in Pict [14, 17] The fusion machine is distributed over channels, as outlined above. It also uses explicit fusions [7], a form of concurrent constraints on channel names which it implements with trees of forwarders between channels. These explicit fusions enable atomic processes to be fragmented, so avoiding the movement of large continuations between channels. The issue of fragmentation did not arise in the ....

....it seems di#cult to make a distributed implementation. This is because its reaction is not local: the channel manager at u must look in the global environment to find su#cient names ( # z ) before it can allow reaction. Instead, we implement the solos calculus with the explicit fusions [7]. This allows local reaction as follows: R R. The term y is called an explicit fusion. It has delayed substitutive e#ect on the rest of the term R. In this respect it is similar to explicit substitutions [1] As an example, in ux u v, the atom on u may be renamed to v. ....

P. Gardner and L. Wischik. Explicit fusions. In MFCS 2000, LNCS 1893:373--382.

....and x is hidden from the outside world and may only be used for an internal communication. 4. 2 A process algebra for CCS with fusions We will now define a process algebra FCCS, which extends CCS by restriction of names, and a construct for equating names, similar to fusions in fusion calculi [PV98, GW00]. We will establish some properties of its equational theory, in particular a normal form result, which shows that every process can be written as a CCS process, with some global fusions and restrictions, resembling the action of a co span on a set of names, as in the category Proc of Chapter ....

....generated by it. The equations are those from CCS, and some axioms ensuring that fusions act as an equivalence relation, and that fusions and restrictions are global in a sense to be made precise below. A similar equational theory is given as a structural congruence for a fusion calculus in [GW00]. Note that it would have been unnecessary to include two versions of the (n Comm) and ( Comm) equations if we had required to be commutative. However, we would have had to add commutativity of to the equations of CCS; in order to minimize the number of equations for CCS, we chose to ....

[Article contains additional citation context not shown here]

Philippa Gardner and Lucian Wischik. Explicit fusions. In Proc. MFCS, 2000.

.... instance of the model from a CCS like process algebra without restriction, and gave an alternative construction of the category as a syntactic category based on the same process algebra extended by restriction and global fusions, similar to a CCS version of the fusion calculi in [PV98] and [GW00]. Translations between the instance of the abstract model and the syntactic category were given, establishing an isomorphism between the categories. We presented a process calculus with a transition semantics and observational equivalence based on bisimulation, and showed that it had the algebraic ....

....structure, and graphical presentations. Interestingly, the equations for our global fusion calculus FCCS, which we discovered in a search for a concrete instance of our general model as a syntactic category, are very similar to the structural congruence of the calculus p F with explicit fusions [GW00] which arose from the study of symmetric action calculi. It should be further investigated whether this link between fusion calculi and process categories with discrete monoid comonoid structure can be formally characterized. 8.2 Graphical Methods in Compilation We have presented a graphical ....

Philippa Gardner and Lucian Wischik. Explicit fusions. In Proc. MFCS, 2000.

....and x is hidden from the outside world and may only be used for an internal communication. 4. 2 A process algebra for CCS with fusions We will now define a process algebra FCCS, which extends CCS by restriction of names, and a construct for equating names, similar to fusions in fusion calculi [PV98, GW00]. We will establish some properties of its equational theory, in particular a normal form result, which shows that every process can be written as a CCS process, with some global fusions and restrictions, resembling the action of a co span on a set of names, as in the category Proc of Chapter 3. ....

....generated by it. The equations are those from CCS, and some axioms ensuring that fusions act as an equivalence relation, and that fusions and restrictions are global in a sense to be made precise below. A similar equational theory is given as a structural congruence for a fusion calculus in [GW00]. Note that it would have been unnecessary to include two versions of the (n Comm) and ( Comm) equations if we had required to be commutative. However, we would have had to add commutativity of to the equations of CCS; in order to minimize the number of equations for CCS, we chose to have ....

[Article contains additional citation context not shown here]

Philippa Gardner and Lucian Wischik. Explicit fusions. In Proc. MFCS, 2000.

....Linear Action Graphs and their Embeddings James J. Leifer and Robin Milner University of Cambridge, Computer Laboratory October 2000 In previous work, action calculus has been presented in terms of action graphs. Many calculi, or at least their salient features, can be expressed as specific action calculi; examples are Petri nets, calculus, calculus, fusion calculus, ambient calculus and spi calculus. We here offer linear ....

....in more than one way. Burstall s untiring enthusiasm for using category theory to understand computing is well known to many, especially to one of us (Milner) who had the good fortune to work alongside him for some twenty years and profit from his insights. Less well known, probably, is his 1972 paper [2] a pioneering use of graphical reasoning to enlighten the hazardous business of updating list structures by swinging pointers. His work is indeed a rigorous treatment of mobility in data structures; our present work can be seen as a generalisation of Burstall s ideas to deal with ....

[Article contains additional citation context not shown here]

Gardner, P.A. and Wischik, L.G. (2000), Explicit fusions. Proc. MFCS 2000. LNCS 1893.

....interaction nets and Hasegawa s sharing graphs in Section 3; closely related are the equational term graphs of Klop and Ariola [1] and we believe the current work should apply quite smoothly to them. Models which allow many to many arcs between nodes are the fusion systems of Gardner and Wischik [8], and the process structures of Honda [11] It is less clear how our theory will apply here; for example, the embeddings axioms may turn out to be simpler or more complex, and slice sums may turn out to exist more often (even always) or less often. So our theory offers a good means for comparison ....

Gardner P. and Wischik, L., Explicit fusions, Proc. MFCS, 2000. 46

No context found.

P. Gardner and L. Wischik. Explicit fusions. In MFCS 2000, LNCS 1893:373--382. http://www.wischik.com/lu/research/explicit-fusions.html

No context found.

P. Gardner and L. Wischik. Explicit fusions. In MFCS 2000, LNCS 1893:373--382.

....to u, and w(z) P deployed to w. The result is that the large continuations are already placed at their correct locations; all that is needed is a small message to trigger them. Technically, we have shown elsewhere [2] how the triggers can be encoded in a version of the pi calculus with fusions [3, 7]. A fusion makes two channels become equivalent, in the sense that a message sent to either will have the same effect) Our machine therefore implements this fusion version of the calculus, rather than the pure pi calculus, and we leave pre deployment as a compiletime optimisation. Note that in ....

P. Gardner and L. Wischik. Explicit fusions. In MFCS 2000, LNCS 1893:373--382.

No context found.

Philippa Gardner and Lucian Wischik. Explicit fusions. In Mogens Nielsen and Branislav Rovan, editors, Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science (MFCS'00), volume 1893 of Lecture Notes in Computer Science, pages 373--382. Springer Verlag, 2000. Full version to appear in TCS. 40

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