Towards a unified approach to encodability and separation results for process calculi

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5201 LNCS, Issue , 2008, Pages 492-507

  Gorla, Daniele ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; ISOMERS; PATHOLOGY; SEPARATION;

ENCODABILITY; ENCODING; ENCODINGS; EVALUATING; EXPRESSIVE POWERS; PROCESS CALCULUS; UNIFIED APPROACHES;

ENCODING (SYMBOLS);

EID: 54249156539     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85361-9_38     Document Type: Conference Paper

References (35)

1. Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous p-calculus. Theoretical Computer Science 195(2), 291-324 (1998)
2. Arun-Kumar, S., Hennessy, M.: An effciency preorder for processes. Acta Informatica 29(8), 737-760 (1992)
3. 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)
4. 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)
5. Boudol, G.: Asynchrony and the π-calculus (note). Rapp. de Recherche 1702, INRIA (1992)
6. Bugliesi, M., Giunti, M.: Secure implementations of typed channel abstractions. In: Proc. of POPL, pp. 251-262. ACM, New York (2007)
7. 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)
8. Cacciagrano, D., Corradini, F., Palamidessi, C.: Separation of Synchronous and Asynchronous Communication Via Testing. Theoretical Computer Science 386(3), 218-235 (2007)
9. Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in pi-calculus. Nordic Journal of Computing 10(2), 70-98 (2003)
10. Cardelli, L., Ghelli, G., Gordon, A.D.: Types for the ambient calculus. Information and Computation 177(2), 160-194 (2002)
11. Cardelli, L., Gordon, A.: Mobile ambients. Theor. Comp. Science 240(1), 177-213 (2000)
12. de Boer, F., Palamidessi, C.: Embedding as a tool for language comparison. Information and Computation 108(1), 128-157 (1994)
13. De Nicola, R., Hennessy, M.: Testing equivalence for processes. TCS 34, 83-133 (1984)
14. Gorla, D.: Comparing calculi for mobility via their relative expressive power. Technical Report 09/2006, Dipartimento di Informatica, Università di Roma La Sapienza
15. 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)
16. Gorla, D.: Synchrony vs asynchrony in communication primitives. In: Proc. of EXPRESS 2006. ENTCS, vol. 175, pp. 87-108. Elsevier, Amsterdam (2007)
17. Haagensen, B., Maffeis, S., Phillips, I.: Matching systems for concurrent calculi. In: Proc. of EXPRESS 2007. ENTCS, vol. 194(2), pp. 85-99 (2007)
18. Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. Information and Computation 173, 82-120 (2002)
19. Herlihy, M.: Wait-free synchronization. ACM ToPLaS 13(1), 124-149 (1991)
20. Honda, K., Yoshida, N.: On reduction-based process semantics. TCS 152, 437-486 (1995)
21. Levi, F.: A Typed Encoding of Boxed into Safe Ambients. Acta Inform. 42(6), 429-500 (2006)
22. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
23. Milner, R.: Functions as Processes. Mathem. Struct. in Comp. Science 2(2), 119-141 (1992)
24. Milner, R.: The polyadic π-calculus: A tutorial. In: Logic and Algebra of Specification. Series F. NATO ASI, vol. 94, Springer, Heidelberg (1993)
25. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685-695. Springer, Heidelberg (1992)
26. Nestmann, U.: What is a 'good' encoding of guarded choice? Inf. Comp. 156, 287-319 (2000)
27. 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)
28. Nestmann, U., Pierce, B.C.: Decoding choice encodings. Inf. and Comp. 163, 1-59 (2000)
29. Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous π-calculi. Mathematical Structures in Computer Science 13(5), 685-719 (2003)
30. 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)
31. Parrow, J.: Expressiveness of Process Algebras. In: Proc. of Emerging trends in Concurrency Theory. ENTCS, vol. 209, pp. 173-186. Elsevier, Amsterdam (2008)
32. Phillips, I., Vigliotti, M.: Electoral systems in ambient calculi. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 408-422. Springer, Heidelberg (2004)
33. Phillips, I., Vigliotti, M.: Leader election in rings of ambient processes. Theoretical Computer Science 356(3), 468-494 (2006)
34. 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)
35. Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. C.U.P (2001)