Skip to Main content Skip to Navigation
Conference papers

A Calculus of Virtually Timed Ambients

Abstract : A virtual machine, which is a software layer representing an execution environment, can be placed inside another virtual machine. As virtual machines at every level in a location hierarchy compete with other processes for processing time, the computing power of a virtual machine depends on its position in this hierarchy and may change if the virtual machine moves. These effects of nested virtualization motivate the calculus of virtually timed ambients, a formal model of hierarchical locations for execution with explicit resource provisioning, introduced in this paper. Resource provisioning in this model is based on virtual time slices as a local resource. To reason about timed behavior in this setting, weak timed bisimulation for virtually timed ambients is defined as an extension of bisimulation for mobile ambients. We show that the equivalence of contextual bisimulation and reduction barbed congruence is preserved by weak timed bisimulation. The calculus of virtually timed ambients is illustrated by examples.
Document type :
Conference papers
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Monday, April 16, 2018 - 11:34:31 AM
Last modification on : Monday, April 16, 2018 - 11:36:29 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Einar Johnsen, Martin Steffen, Johanna Stumpf. A Calculus of Virtually Timed Ambients. 23th International Workshop on Algebraic Development Techniques (WADT), Sep 2016, Gregynog, United Kingdom. pp.88-103, ⟨10.1007/978-3-319-72044-9_7⟩. ⟨hal-01767462⟩



Record views


Files downloads