Abstract
We study the relative expressive power of Fusion and pi-calculus. Fusion is commonly regarded as a generalisation of pi-calculus. Actually, we prove that there is no uniform fully abstract embedding of pi-calculus into Fusion. This fact motivates the introduction of a new calculus, D-Fusion, with two binders, λ and ν. We show that D-Fusion is strictly more expressive than both pi-calculus and Fusion. The expressiveness gap is further clarified by the existence of a fully abstract encoding of mixed guarded choice into the choice-free fragment of D-Fusion.
Research partially supported by FET-Global Computing projects PROFUNDIS and MIKADO.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carbone, M., Maffeis, S.: On the Expressive Power of Polyadic Synchronisation in Pi-Calculus. Nordic Journal of Computing (to appear)
Fu, Y.: A Proof Theoretical Approach to Communication. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256. Springer, Heidelberg (1997)
Gardner, P., Laneve, C., Wischik, L.: The fusion machine (extended abstract). In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 418. Springer, Heidelberg (2002)
Gardner, P., Wischik, L.: Explicit Fusions. Theoretical Computer Science (to appear)
Meredith, L.G., Bjorg, S., Richter, D.: Highwire Language Specification Version 1.0 (unpublished manuscript)
Microsoft Corp. Biztalk Server, http://www.microsoft.com/biztalk
Merro, M.: On the Expressiveness of Chi, Update, and Fusion calculi. In: Proc. of EXPRESS 1998. ENTCS, vol. 16(2). Elsevier Science, Amsterdam (1998)
Miller, D.: Unification under a mixed prefix. Journal of Symbolic Computation 14(4), 321–358 (1992)
Milner, R.: The Polyadic pi-Calculus: a Tutorial. Technical Report, Computer Science Dept. University of Edinburgh (1991)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes (parts I and II). Information and Computation 100(1), 1–77 (1992)
Milner, R., Sangiorgi, D.: Barbed Bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623. Springer, Heidelberg (1992)
Nestmann, U., Pierce, B.C.: Decoding choice encodings. Information and Computation 163(1), 1–59 (2000)
Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus. In: Conf. Rec. of POPL 1997 (1997)
Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus. Mathematical Structures in Computer Science 13(5), 685–719 (2003)
Parrow, J., Victor, B.: The Update Calculus. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349. Springer, Heidelberg (1997)
Parrow, J., Victor, B.: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. In: Proc. of LICS 1998. IEEE Computer Society Press, Los Alamitos (1998)
Shapiro, E.: The Family of Concurrent Logic Programming Languages. ACM Computing Surveys 21(3), 413–510 (1989)
Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, Department of Computer Science, University of Edinburgh (1992)
Sangiorgi, D.: A Theory of Bisimulation for the pi-Calculus. Acta Informatica 33(1), 69–97 (1996)
Saraswat, V.: Concurrent Constraint Programming. MIT Press, Cambridge (1993)
Victor, B.: The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes. PhD thesis, Department of Computer Systems, Uppsala University (1998)
World Wide Web Consortium (W3C), http://www.w3.org/TR/wsdl12
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boreale, M., Buscemi, M.G., Montanari, U. (2004). D-Fusion: A Distinctive Fusion Calculus. In: Chin, WN. (eds) Programming Languages and Systems. APLAS 2004. Lecture Notes in Computer Science, vol 3302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30477-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30477-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23724-2
Online ISBN: 978-3-540-30477-7
eBook Packages: Springer Book Archive