On the expressiveness of forwarding in higher-order communication

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

Volumn 5684 LNCS, Issue , 2009, Pages 155-169

  Di Giusto, Cinzia ^a   Pérez, Jorge A ^a   Zavattaro, Gianluigi ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

HIGHER ORDER; HIGHER-ORDER PROCESS; PARALLEL COMPOSITION;

BIOMINERALIZATION;

COMPUTER SCIENCE;

EID: 70349319962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03466-4_10     Document Type: Conference Paper

References (16)

1. Thomsen, B.: A calculus of higher order communicating systems. In: Proc. of POPL 1989, pp. 143-154. ACM Press, New York (1989)
2. Thomsen, B.: Plain CHOCS: A second generation calculus for higher order processes. Acta Inf. 30(1), 1-59 (1993)
3. Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST-99-193, University of Edinburgh, Dept. of Comp. Sci. (1992)
4. Lanese, I., Pérez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. In: Proc. of LICS 1908, pp. 145-155. IEEE Computer Society Press, Los Alamitos (2008)
5. Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
6. Necula, G.C., Lee, P.: Safe, untrusted agents using proof-carrying code. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol.1419, pp. 61-91. Springer, Heidelberg (1998)
7. Collberg, C.S., Thomborson, C.D., Low, D.: Manufacturing cheap, resilient, and stealthy opaque constructs. In: Proc. of POPL 1998, pp. 184-196. ACM Press, New York (1998)
8. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
9. Busi, N., Gabbrielli, M., Zavattaro, G.: On the expressive power of recursion, replication, and iteration in process calculi. Math. Struct. Comp. Sci. (to appear, 2009)
10. Di Giusto, C., Pérez, J.A., Zavattaro, G.: On the Expressiveness of Forwarding in Higher-Order Communication (Extended Version) (2009), http://www.cs.unibo.it/~perez/hocore
11. Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society (3) 2(7), 326-336 (1952)
12. Bravetti, M., Zavattaro, G.: On the expressive power of process interruption and compensation. Math. Struct. Comp. Sci. (to appear, 2009)
13. Bundgaard, M., Godskesen, J.C., Haagensen, B., Huttel, H.: Decidable fragments of a higher order calculus with locations. In: Proc. of EXPRESS 2008. Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2008) (to appear)
14. Bundgaard, M., Godskesen, J.C., Hildebrandt, T.: Bisimulation congruences for homer - a calculus of higher order mobile embedded resources. Technical Report TR-2004-2052, IT University of Copenhagen (2004)
15. Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240(1), 177-213 (2000)
16. Busi, N., Zavattaro, G.: On the expressive power of movement and restriction in pure mobile ambients. Theor. Comput. Sci. 322(3), 477-515 (2004)