On the expressiveness of polyadic and synchronous communication in higher-order process calculi

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

Volumn 6199 LNCS, Issue PART 2, 2010, Pages 442-453

  Lanese, Ivan ^a   Pérez, Jorge A ^b   Sangiorgi, Davide ^a   Schmitt, Alan ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS COMMUNICATION; FIRST-ORDER; HIGHER ORDER; HIGHER-ORDER PROCESS; PROCESS-PASSING; STRIKING POINT; SYNCHRONOUS COMMUNICATIONS; SYNCHRONOUS PROCESS;

COMMUNICATION; LINGUISTICS; PATHOLOGY; TRANSLATION (LANGUAGES);

BIOMINERALIZATION;

EID: 77955325621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14162-1_37     Document Type: Conference Paper

References (16)

1. Palamidessi, C.: Comparing the expressive power of the synchronous and asynchronous picalculi. Mathematical Structures in Computer Science 13 (5), 685-719 (2003)
2. Nestmann, U.: What is a good encoding of guarded choice? Inf. Comput. 156 (1-2), 287-319 (2000); A preliminary version appeared in EXPRESS (1997)
3. Cacciagrano, D., Corradini, F., Palamidessi, C.: Separation of synchronous and asynchronous communication via testing. Theor. Comput. Sci. 386 (3), 218-235 (2007)
4. Boudol, G.: Asynchrony and the π-calculus (note). Technical report, Rapport de Recherche 1702, INRIA, Sophia-Antipolis (1992)
5. Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133-147. Springer, Heidelberg (1991)
6. Milner, R.: The Polyadic pi-Calculus: A Tutorial. Technical Report ECS-LFCS-91-180, University of Edinburgh (1991)
7. Quaglia, P., Walker, D.: Types and full abstraction for polyadic pi-calculus. Inf. Comput. 200 (2), 215-246 (2005)
8. Yoshida, N.: Graph types for monadic mobile processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 371-386. Springer, Heidelberg (1996)
9. Sangiorgi, D.: π-calculus, internal mobility and agent-passing calculi. Theor. Comput. Sci. 167 (2), 235-274 (1996)
10. Gorla, D.: Towards a unified approach to encodability and separation results for process calculi. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 492-507. Springer, Heidelberg (2008)
11. Pérez, J. A.: Higher-Order Concurrency: Expressiveness and Decidability Results. PhD thesis, University of Bologna (2010) Draft in http://www.japerez.phipages.com
12. Lanese, I., Pérez, J. A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. In: Proc. of LICS 2008, pp. 145-155. IEEE Computer Society, Los Alamitos (2008)
13. Di Giusto, C., Pérez, J. A., Zavattaro, G.: On the expressiveness of forwarding in higherorder communication. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 155-169. Springer, Heidelberg (2009)
14. Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-93, University of Edinburgh, Dept. of Comp. Sci. (1992)
15. Lanese, I.: Concurrent and located synchronizations in pi-calculus. In: van Leeuwen, J., Italiano, G. F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 388-399. Springer, Heidelberg (2007)
16. Amadio, R. M.: On the reduction of Chocs bisimulation to π-calculus bisimulation. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 112-126. Springer, Heidelberg (1993)