Abstract
We extend Howe’s method to prove that input-early strong and -delay contextual bisimulations are congruences for the Higher-order mobile embedded resources (Homer) calculus, a typed higher order process calculus with active mobile processes, nested locations and local names which conservatively extends the syntax and semantics of higher-order calculi such as Plain CHOCS and HOpi. We prove that the input-early strong and -delay contextual bisimulation congruences are sound co-inductive characterisations of barbed bisimulation congruence and in fact complete in the strong case. The extension of Howe’s method provides considerably simpler congruence proofs than established previously for similar calculi for mobile processes in nested locations.
This is a preview of subscription content, log in via an institution to check access.
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
Castagna, G., Vitek, J., Nardelli, F.Z.: The Seal calculus. Accepted for publication in Information and Computation (2004)
Schmitt, A., Stefani, J.B.: The M-calculus: A higher-order distributed process calculus. In: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2003), pp. 50–61 (2003)
Schmitt, A., Stefani, J.B.: The Kell calculus: A family of higher-order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol. 3267, pp. 146–178. Springer, Heidelberg (2005)
Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation 124, 103–112 (1996)
Thomsen, B.: Plain CHOCS. A second generation calculus for higher order processes. Acta Informatica 30, 1–59 (1993)
Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, LFCS, University of Edinburgh (1993)
Boudol, G.: Towards a lambda-calculus for concurrent and communicating systems. In: Díaz, J., Orejas, F. (eds.) TAPSOFT 1989 and CCIPL 1989. LNCS, vol. 352, pp. 149–161. Springer, Heidelberg (1989)
Godskesen, J.C., Hildebrandt, T., Sassone, V.: A calculus of mobile resources. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 272. Springer, Heidelberg (2002)
Cardelli, L., Gordon, A.D.: Mobile ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)
Jeffrey, A., Rathke, J.: Towards a theory of bisimulation for local names. In: Proceedings of LICS 1999, pp. 56–66. IEEE, Computer Society Press, Los Alamitos (1999)
Hildebrandt, T., Godskesen, J.C., Bundgaard, M.: Bisimulation congruences for homer - a calculus of higher order mobile embedded resources. Technical Report TR-2004-52, IT University of Copehagen, Department of Theoretical Computer Science (2004)
Bundgaard, M., Hildebrandt, T., Godskesen, J.C.: A CPS encoding of name-passing in higher-order mobile embedded resources. Journal of Theoretical Computer Science (2005) (to appear)
Bundgaard, M., Hildebrandt, T.: A bigraphical semantics of higher order mobile embedded resources with local names (2005) (submitted for publication)
Baldamus, M., Frauenstein, T.: Congruence proofs for weak bisimulation equivalences on higher-order process calculi. Technical Report Report 95–21, Berlin University of Technology, Computer Science Department (1995)
Merro, M., Hennessy, M.: Bisimulation congruences in safe ambients. Computer Science Report 2001:05, University of Sussex (2001)
Prasad, S., Giacalone, A., Mishra, P.: Operational and algebraic semantics for Facile: A symmetric integration of concurrent and functional programming. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 765–778. Springer, Heidelberg (1990)
Sangiorgi, D.: Bisimulation in higher-order process calculi. Journal of Information and Computation 131, 141–178 (1996) Available as Rapport de Recherche RR-2508, INRIA Sophia- Antipolis, 1995. An early version appeared in Proceedings of PROCOMET 1994 pages 207– 224. IFIP. North Holland Publisher
Jeffrey, A., Rathke, J.: Contextual equivalence for higher-order π-calculus revisited. In: Brookes, S., Panangaden, P. (eds.) Proceedings of the 19th Conference on Mathematical Foundations of Programming Semantics (MFPS 2004), vol. 83, Elsevier, ENTCS (2004)
Merro, M., Nardelli, F.Z.: Behavioural theory for mobile ambients. In: Proceedings of the 3rd International Conference on Theoretical Computer Science, IFIP TCS 2004 (2004)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication and mobility control in boxed ambients. Journal of Information and Computation (2003)
Gordon, A.D.: Operational equivalences for untyped and polymorphic object calculi. In: Higher Order Operational Techniques in Semantics, Cambridge University Press, Cambridge (1998)
Jefrfrey, A.: Semantics for core concurrent ml using computation types. In: Higher Order Operational Techniques in Semantics, Cambridge University Press, Cambridge (1998)
Godskesen, J.C., Hildebrandt, T.: Copyability types for mobile computing resources. In: International Workshop on Formal Methods and Securit (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godskesen, J.C., Hildebrandt, T. (2005). Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_11
Download citation
DOI: https://doi.org/10.1007/11590156_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30495-1
Online ISBN: 978-3-540-32419-5
eBook Packages: Computer ScienceComputer Science (R0)