Abstract
In this paper, we present a unified approach to evaluating the relative expressive power of process calculi. In particular, we identify a small set of criteria (that have already been somehow presented in the literature) that an encoding should satisfy to be considered a good means for language comparison. We argue that the combination of such criteria is a valid proposal by noting that: (i) the best known encodings appeared in the literature satisfy them; (ii) this notion is not trivial, because there exist encodings that do not satisfy all the criteria we have proposed; (iii) the best known separation results can be formulated in terms of our criteria; and (iv) some widely believed (but never formally proved) separation results can be proved by using the criteria we propose. Moreover, the way in which we prove known separation results is easier and more uniform than the way in which such results were originally proved.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195(2), 291–324 (1998)
Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica 29(8), 737–760 (1992)
Baldamus, M., Parrow, J., Victor, B.: Spi-Calculus Translated to Pi-Calculus Preserving Tests. In: Proc. of LICS, pp. 22–31. IEEE Computer Society, Los Alamitos (2004)
Baldamus, M., Parrow, J., Victor, B.: A Fully Abstract Encoding of the Pi-Calculus with Data Terms. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1202–1213. Springer, Heidelberg (2005)
Boudol, G.: Asynchrony and the π-calculus (note). Rapp. de Recherche 1702, INRIA (1992)
Bugliesi, M., Giunti, M.: Secure implementations of typed channel abstractions. In: Proc. of POPL, pp. 251–262. ACM, New York (2007)
Cacciagrano, D., Corradini, F., Aranda, J., Valencia, F.: Persistence and Testing Semantics in the Asynchronous π-calculus. In: Proc. of EXPRESS. ENTCS, vol. 194(2), pp. 59–84 (2007)
Cacciagrano, D., Corradini, F., Palamidessi, C.: Separation of Synchronous and Asynchronous Communication Via Testing. Theoretical Computer Science 386(3), 218–235 (2007)
Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nordic Journal of Computing 10(2), 70–98 (2003)
Cardelli, L., Ghelli, G., Gordon, A.D.: Types for the ambient calculus. Information and Computation 177(2), 160–194 (2002)
Cardelli, L., Gordon, A.: Mobile ambients. Theor. Comp. Science 240(1), 177–213 (2000)
de Boer, F., Palamidessi, C.: Embedding as a tool for language comparison. Information and Computation 108(1), 128–157 (1994)
De Nicola, R., Hennessy, M.: Testing equivalence for processes. TCS 34, 83–133 (1984)
Gorla, D.: Comparing calculi for mobility via their relative expressive power. Technical Report 09/2006, Dipartimento di Informatica, Università di Roma La Sapienza
Gorla, D.: On the relative expressive power of asynchronous communication primitives. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 47–62. Springer, Heidelberg (2006)
Gorla, D.: Synchrony vs asynchrony in communication primitives. In: Proc. of EXPRESS 2006. ENTCS, vol. 175, pp. 87–108. Elsevier, Amsterdam (2007)
Haagensen, B., Maffeis, S., Phillips, I.: Matching systems for concurrent calculi. In: Proc. of EXPRESS 2007. ENTCS, vol. 194(2), pp. 85–99 (2007)
Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. Information and Computation 173, 82–120 (2002)
Herlihy, M.: Wait-free synchronization. ACM ToPLaS 13(1), 124–149 (1991)
Honda, K., Yoshida, N.: On reduction-based process semantics. TCS 152, 437–486 (1995)
Levi, F.: A Typed Encoding of Boxed into Safe Ambients. Acta Inform. 42(6), 429–500 (2006)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Milner, R.: Functions as Processes. Mathem. Struct. in Comp. Science 2(2), 119–141 (1992)
Milner, R.: The polyadic π-calculus: A tutorial. In: Logic and Algebra of Specification. Series F. NATO ASI, vol. 94, Springer, Heidelberg (1993)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)
Nestmann, U.: What is a ‘good’ encoding of guarded choice? Inf. Comp. 156, 287–319 (2000)
Nestmann, U.: Welcome to the jungle: A subjective guide to mobile process calculi. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 52–63. Springer, Heidelberg (2006)
Nestmann, U., Pierce, B.C.: Decoding choice encodings. Inf. and Comp. 163, 1–59 (2000)
Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathematical Structures in Computer Science 13(5), 685–719 (2003)
Palamidessi, C., Saraswat, V., Valencia, F., Victor, B.: On the Expressiveness of Linearity vs Persistence in the Asynchronous π-calculus. In: Proc. of LICS, pp. 59–68. IEEE, Los Alamitos (2006)
Parrow, J.: Expressiveness of Process Algebras. In: Proc. of Emerging trends in Concurrency Theory. ENTCS, vol. 209, pp. 173–186. Elsevier, Amsterdam (2008)
Phillips, I., Vigliotti, M.: Electoral systems in ambient calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 408–422. Springer, Heidelberg (2004)
Phillips, I., Vigliotti, M.: Leader election in rings of ambient processes. Theoretical Computer Science 356(3), 468–494 (2006)
Rathke, J., Sassone, V., Sobocinski, P.: Semantic Barbs and Biorthogonality. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol. 4423, pp. 302–316. Springer, Heidelberg (2007)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. C.U.P (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gorla, D. (2008). Towards a Unified Approach to Encodability and Separation Results for Process Calculi. In: van Breugel, F., Chechik, M. (eds) CONCUR 2008 - Concurrency Theory. CONCUR 2008. Lecture Notes in Computer Science, vol 5201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85361-9_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-85361-9_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85360-2
Online ISBN: 978-3-540-85361-9
eBook Packages: Computer ScienceComputer Science (R0)