A Calculus of Virtually Timed Ambients

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.

[1]  Matthew Hennessy,et al.  A Process Algebra for Timed Systems , 1995, Inf. Comput..

[2]  Maria Grazia Vigliotti,et al.  Barbs and Congruences for Safe Mobile Ambients , 2002, F-WAN@ICALP.

[3]  Faron Moller,et al.  A Temporal Calculus of Communicating Systems , 1990, CONCUR.

[4]  Mira Mezini,et al.  CPL: a core language for cloud computing , 2016, MODULARITY.

[5]  Luca Cardelli,et al.  Equational properties of mobile ambients , 1999, Mathematical Structures in Computer Science.

[6]  Robert P. Goldberg,et al.  Survey of virtual machine research , 1974, Computer.

[7]  Hakim Weatherspoon,et al.  The Xen-Blanket: virtualize once, run everywhere , 2012, EuroSys '12.

[8]  Einar Broch Johnsen,et al.  Integrating deployment architectures and resource consumption in timed object-oriented models , 2015, J. Log. Algebraic Methods Program..

[9]  Gabriel Ciobanu.  Interaction in Time and Space , 2008, Electron. Notes Theor. Comput. Sci..

[10]  Masaki Murakami.  Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System , 2013, 2013 International Symposium on Theoretical Aspects of Software Engineering.

[11]  Ichiro Satoh,et al.  A Timed Calculus for Distributed Objects with Clocks , 1993, ECOOP.

[12]  Martin Friedrich Berger.  Towards abstractions for distributed systems , 2003 .

[13]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[14]  Gabriel Ciobanu,et al.  Mobile Ambients with Timers and Types , 2007, ICTAC.

[15]  Luca Cardelli,et al.  Equational Properties Of Mobile Ambients , 2003, Math. Struct. Comput. Sci..

[16]  Muli Ben-Yehuda,et al.  The Turtles Project: Design and Implementation of Nested Virtualization , 2010, OSDI.

[17]  Jan A. Bergstra,et al.  Real time process algebra , 1991, Formal Aspects of Computing.

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

[19]  Gabriel Ciobanu,et al.  Timers and Proximities for Mobile Ambients , 2007, CSR.

[20]  Matthew Hennessy,et al.  A bisimulation-based semantic theory of Safe Ambients , 2006, TOPL.

[21]  Cédric Fournet,et al.  A Hierarchy of Equivalences for Asynchronous Calculi , 1998, ICALP.

[22]  Mrv Michel Chaudron,et al.  PARS : a process algebraic approach to resources and schedulers , 2008 .

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

[24]  Joseph Sifakis,et al.  The Algebra of Timed Processes, ATP: Theory and Application , 1994, Inf. Comput..

[25]  Jos C. M. Baeten,et al.  Process Algebra with Timing , 2002, Monographs in Theoretical Computer Science. An EATCS Series.

[26]  Insup Lee,et al.  Resources in process algebra , 2007, J. Log. Algebraic Methods Program..

[27]  Francesco Zappa Nardelli,et al.  Behavioral theory for mobile ambients , 2005, JACM.