Abstract
In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwarding. Here we propose a limited form of forwarding: output actions can only communicate the parallel composition of statically known closed processes and processes received through previously executed input actions. We study the expressiveness of a higher-order process calculus featuring this style of communication. Our main result shows that in this calculus termination is decidable while convergence is undecidable.
Research partially funded by EU Integrated Projects HATS (contract number 231620) and SENSORIA (contract number 016004).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Thomsen, B.: A calculus of higher order communicating systems. In: Proc. of POPL 1989, pp. 143–154. ACM Press, New York (1989)
Thomsen, B.: Plain CHOCS: A second generation calculus for higher order processes. Acta Inf. 30(1), 1–59 (1993)
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)
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)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
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)
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)
Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63–92 (2001)
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)
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
Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society (3) 2(7), 326–336 (1952)
Bravetti, M., Zavattaro, G.: On the expressive power of process interruption and compensation. Math. Struct. Comp. Sci. (to appear, 2009)
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)
Bundgaard, M., Godskesen, J.C., Hildebrandt, T.: Bisimulation congruences for homer — a calculus of higher order mobile embedded resources. Technical Report TR-2004-52, IT University of Copenhagen (2004)
Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240(1), 177–213 (2000)
Busi, N., Zavattaro, G.: On the expressive power of movement and restriction in pure mobile ambients. Theor. Comput. Sci. 322(3), 477–515 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Giusto, C., Pérez, J.A., Zavattaro, G. (2009). On the Expressiveness of Forwarding in Higher-Order Communication. In: Leucker, M., Morgan, C. (eds) Theoretical Aspects of Computing - ICTAC 2009. ICTAC 2009. Lecture Notes in Computer Science, vol 5684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03466-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-03466-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03465-7
Online ISBN: 978-3-642-03466-4
eBook Packages: Computer ScienceComputer Science (R0)