Resource-Aware Virtually Timed Ambients

  title={Resource-Aware Virtually Timed Ambients},
  author={Einar Broch Johnsen and Martin Steffen and Johanna Beate Stumpf and Lars Tveito},
Virtually timed ambients is a calculus of nested virtualization, which models timing and resource consumption for hierarchically structured virtual machines. This structure may change dynamically to support load-balancing, migration, and scaling. This paper introduces resource-awareness for virtually timed ambients, which enables processes to actively query the system about the resources necessary for a task and to reconfigure accordingly. Technically we extend virtually timed ambients with… 


Checking Modal Contracts for Virtually Timed Ambients
The proposed modal logic supports QoS statements about the resource consumption and nesting structure of a system during the timed reduction of its processes as well as a corresponding model checking algorithm and its prototype implementation in rewriting logic.
A Calculus of Virtually Timed Ambients
The calculus of virtually timed ambients, a formal model of hierarchical locations for execution with explicit resource provisioning, is introduced and it is shown that the equivalence of contextual bisimulation and reduction barbed congruence is preserved by weak timed bisimulations.
Virtually timed ambients: A calculus of nested virtualization
Integrating deployment architectures and resource consumption in timed object-oriented models
Typed Mobile Ambients in Maude
The Calculus of Context-aware Ambients
Behavioral theory for mobile ambients
A context lemma is proved which shows that only parallel and nesting contexts need be examined to recover reduction barbed congruence, and refined proof methods involving up-to proof techniques are developed, which allow to verify a set of algebraic laws and the correctness of more complex examples.
A bisimulation-based semantic theory of Safe Ambients
The notion of bisimulation is used to prove a set of algebraic laws that are subsequently exploited to prove more significant examples, and is proved to coincide with reduction barbed congruence.
Designing Reliable Distributed Systems
  • P. C. Ölveczky
  • Computer Science
    Undergraduate Topics in Computer Science
  • 2017
The specification methodology adds to the state a “system clock” which shows the total time elapse in the system, so that the reachable state space becomes infinite and unbounded search for unreachable states and LTLmodel checking analysis will therefore fail to terminate.
Equational Properties of Mobile Ambients
This work develops a theory of Morris-style contextual equivalence for proving properties of mobile ambients and gives an activity lemma that characterizes the possible interactions between a process and a context.