A Calculus of Mobile Resources

  • Authors:

  • Jens Chr. Godskesen;Thomas Hildebrandt;Vladimiro Sassone

  • Affiliations:

  • -;-;-

  • Venue:
  • CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.