Checking Modal Contracts for Virtually Timed Ambients

The calculus of virtually timed ambients models timing aspects of resource management for virtual machines. With nested virtualization, virtual machines compete with other processes for the resources of their host environment. Resource provisioning in virtually timed ambients can be formalized by extending the capabilities of mobile ambients to model the dynamic creation, migration, and destruction of virtual machines. This paper introduces a logic to define modal contracts regarding resource management for virtually timed ambients. Service-level agreements are contracts between a service provider and a client, specifying properties that the service should fulfill with respect to quality of service (QoS). The proposed modal logic supports QoS statements about the resource consumption and nesting structure of a system during the timed reduction of its processes. Besides a formal definition of the logic, the paper provides a corresponding model checking algorithm and its prototype implementation in rewriting logic.

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

[2]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

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

[4]  José Meseguer,et al.  Twenty years of rewriting logic , 2010, J. Log. Algebraic Methods Program..

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

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

[7]  Luca Cardelli,et al.  Logical Properties of Name Restriction , 2001, TLCA.

[8]  Joël Ouaknine,et al.  On the decidability and complexity of Metric Temporal Logic over finite words , 2007, Log. Methods Comput. Sci..

[9]  Jun Sun,et al.  PAT: Towards Flexible Verification under Fairness , 2009, CAV.

[10]  Andrew D. Gordon V for Virtual , 2006, Electron. Notes Theor. Comput. Sci..

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

[12]  Narciso Martí-Oliet,et al.  All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic , 2007, All About Maude.

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

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

[15]  Einar Broch Johnsen,et al.  Virtually timed ambients: A calculus of nested virtualization , 2018, J. Log. Algebraic Methods Program..

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

[17]  Fernando Rosa-Velardo,et al.  Typed Mobile Ambients in Maude , 2005, RULE@RDP.

[18]  José Meseguer,et al.  The Rewriting Logic Semantics Project , 2006, Electron. Notes Theor. Comput. Sci..

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

[20]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

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

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

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

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

[25]  Witold Charatonik,et al.  The Complexity of Model Checking Mobile Ambients , 2001, FoSSaCS.

[26]  Peter Csaba Ölveczky Designing Reliable Distributed Systems , 2017, Undergraduate Topics in Computer Science.

[27]  Cristian Prisacariu Barbed Bisimulations for Timed Distributed π-calculus , 2006 .

[28]  Witold Charatonik,et al.  The Decidability of Model Checking Mobile Ambients , 2001, CSL.

[29]  Joël Ouaknine,et al.  Some Recent Results in Metric Temporal Logic , 2008, FORMATS.

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

[31]  Einar Broch Johnsen,et al.  A Calculus of Virtually Timed Ambients , 2016, WADT.

[32]  Imran Ghani,et al.  Quality of service approaches in cloud computing: A systematic mapping study , 2015, J. Syst. Softw..

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

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

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

[36]  Mikyung Kang,et al.  Heterogeneous Cloud Computing , 2011, 2011 IEEE International Conference on Cluster Computing.