A Calculus of Mobile Resources

We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints,an d which are not copyable nor modifiable per se. We provide a reduction as well as a labelled transition semantics and prove a correspondence between barbed bisimulation congruence and a higher-order bisimulation. We provide examples of the expressiveness of the calculus, and apply the theory to prove one of its characteristic properties.

[1]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

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

[3]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[4]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

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

[6]  Peter Sewell,et al.  From rewrite rules to bisimulation congruences , 2002, Theor. Comput. Sci..

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

[8]  Peter Sewell,et al.  From Rewrite to Bisimulation Congruences , 1998, CONCUR.

[9]  AbadiMartín,et al.  Mobile values, new names, and secure communication , 2001 .

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

[11]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, Inf. Comput..

[12]  Peter Sewell.  Global/Local Subtyping and Capability Inference for a Distributed pi-calculus , 1998, ICALP.

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

[14]  Matthew Hennessy,et al.  A theory of weak bisimulation for core CML , 1996, ICFP '96.

[15]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, HLCL.

[16]  Luca Cardelli,et al.  Ambient Groups and Mobility Types , 2000, IFIP TCS.

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

[18]  Michele Bugliesi,et al.  Boxed Ambients , 2001, TACS.

[19]  Uwe Hansmann,et al.  Smart Card Application Development Using Java , 2000, Springer Berlin Heidelberg.

[20]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[21]  Davide Sangiorgi,et al.  Controlling interference in ambients , 2000, POPL '00.

[22]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

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