Abstract
Parametrised replication and replication are common ways of expressing infinite computation in process calculi. While parametrised constants can be encoded using replication in the π-calculus, this changes in the presence of spatial mobility as found in e.g. the distributed π-calculus and the calculus of mobile ambients. Here, processes are located at sites and can migrate between them.
In this paper we say that an encoding is local if it does not introduce extra migration. We first study this property for the distributed π-calculus where locations can be dynamically created. If the set of reachable sites is static an encoding exists, but we also show that parametrised constants can not be encoded in the full calculus. The locality requirement supplements widely accepted encoding criteria. It appears to be a natural property in spatial calculi where links and locations can fail.
The versions of the distributed π-calculus with parametrised constants and replication are incomparable. On the other hand, we shall see that there exists a simple encoding of recursion in mobile ambients.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aranda, J., Di Giusto, C., Palamidessi, C., Valencia, F.D.: On Recursion, Replication and Scope Mechanisms in Process Calculi. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol. 4709, pp. 185–206. Springer, Heidelberg (2007)
Sangiorgi, D., Walker, D.: The π-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Hennessy, M.: A Distributed Pi-Calculus, 1st edn. Cambridge University Press, Cambridge (2007)
Hym, S., Hennessy, M.: Adding Recursion to Dpi. Theoretical Computer Science 373(3), 182–212 (2007)
Francalanza, A., Hennessy, M.: Location and Link Failure in a Distributed π-calculus. Sussex Technical Report 2005:01, University of Sussex (January 2005)
Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)
Ravara, A., Matos, A.G., Vasconcelos, V.T., Lopes, L.: Lexically scoped distribution: what you see is what you get. Electronic Notes in Theoretical Computer Science 85(1), 61–79 (2003)
Levi, F., Sangiorgi, D.: Controlling Interference in Ambients. In: Symposium on Principles of Programming Languages, pp. 352–364 (2000)
Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. Information and Computation 173, 82–120 (2002)
Ciaffaglione, A., Hennessy, M., Rathke, J.: Proof Methodologies for Behavioural Equivalence in DPI. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 335–350. Springer, Heidelberg (2005)
Hennessy, M., Merro, M., Rathke, J.: Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. Theoretical Computer Science 322(3), 615–669 (2004)
Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Part I/II. Information and Computation 100, 1–77 (1992)
Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph.D thesis, University of Edinburgh, Dept. of Computer Science (1993)
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)
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)
Felleisen, M.: On the Expressive Power of Programming Languages. Science of Computer Programming 17(1-3), 35–75 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Haagensen, B., Hüttel, H. (2009). Parametrised Constants and Replication for Spatial Mobility. In: Field, J., Vasconcelos, V.T. (eds) Coordination Models and Languages. COORDINATION 2009. Lecture Notes in Computer Science, vol 5521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02053-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-02053-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02052-0
Online ISBN: 978-3-642-02053-7
eBook Packages: Computer ScienceComputer Science (R0)