Bisimulation Congruences for Homer a calculus of Higher-order mobile embedded resources

We extend Howe’s method for proving that late labelled transition bisimulations are congruences to a core process passing calculus with local names, extended with non-linear active process mobility and nested locations, as found in the Seal calculus, M-calculus, and Kell-calculus. The calculus we consider, called Homer for Higher-order Mobile Embedded Resources, has a very simple syntax and semantics, which conservatively extend the standard syntax and semantics for process passing calculi. The extension of Howe’s method gives a sound characterisation of barbed bisimulation congruence in terms of a late contextual bisimulation. We show that early contextual bisimulation is complete with respect to barbed bisimulation congruence, but that the late bisimulation is in fact strictly included in the early bisimulation. We discuss the issue of scope extension through location boundaries in detail, in particular the difference between fresh name generation and static local names. We propose free name extension as a primitive construct in calculi with non-linear process mobility, explicit locations and local names.

[1]  Michele Bugliesi,et al.  Communication and mobility control in boxed ambients , 2005, Inf. Comput..

[2]  Jan Vitek,et al.  The Seal Calculus , 2005, Inf. Comput..

[3]  Julian Rathke,et al.  Contextual equivalence for higher-order pi-calculus revisited , 2005, Log. Methods Comput. Sci..

[4]  Prateek Mishra,et al.  Facile: A symmetric integration of concurrent and functional programming , 1989, International Journal of Parallel Programming.

[5]  Bent Thomsen,et al.  Plain CHOCS A second generation calculus for higher order processes , 2005, Acta Informatica.

[6]  Thomas T. Hildebrandt,et al.  A CPS encoding of name-passing in Higher-order mobile embedded resources , 2006, Theor. Comput. Sci..

[7]  Alan Schmitt,et al.  The Kell Calculus: A Family of Higher-Order Distributed Process Calculi , 2004, Global Computing.

[8]  Francesco Zappa Nardelli,et al.  Behavioural Theory for Mobile Ambients , 2004, IFIP TCS.

[9]  Robin Milner,et al.  Bigraphs and mobile processes (revised) , 2004 .

[10]  Alan Schmitt,et al.  The m-calculus: a higher-order distributed process calculus , 2003, POPL '03.

[11]  Julian Rathke,et al.  Contextual Equivalence for Higher-Order π-Calculus Revisited , 2003, MFPS.

[12]  Giuseppe Castagna,et al.  The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity , 2002, FSTTCS.

[13]  Vladimiro Sassone,et al.  A Calculus of Mobile Resources , 2002, CONCUR.

[14]  Matthew Hennessy,et al.  Bisimulation congruences in safe ambients , 2002, POPL '02.

[15]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[16]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[17]  Julian Rathke,et al.  Towards a theory of bisimulation for local names , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[18]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[19]  Jan Vitek,et al.  Seal: A Framework for Secure Mobile Computations , 1998, ICCL Workshop: Internet Programming Languages.

[20]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[21]  Douglas J. Howe Proving Congruence of Bisimulation in Functional Programming Languages , 1996, Inf. Comput..

[22]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[23]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[24]  Douglas J. Howe Equality in lazy computation systems , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[25]  Gérard Boudol Towards a Lambda-Calculus for Concurrent and Communicating Systems , 1989, TAPSOFT, Vol.1.

[26]  D. Walker,et al.  A Calculus of Mobile Processes, Part Ii , 1989 .