Mobile Ambients with Timers and Types

Mobile ambients calculus is a formalism for mobile computing able to express local communications inside ambients. Ambients mobility is controlled by capabilities: in, out, and open. We add timers to communication channels, capabilities and ambients, and use a typing system for communication. The passage of time is given by a discrete global time progress function. We prove that structural congruence and passage of time do not interfere with the typing system. Moreover, once well-typed, an ambient remains well-typed. A timed extension of the cab protocol illustrates how the new formalism is working.

[1]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

[2]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[3]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[4]  Flavio Corradini,et al.  Absolute versus relative time in process algebras , 1999, EXPRESS.

[5]  David Murphy,et al.  Timing and causality in process algebra , 1996, Acta Informatica.

[6]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

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

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

[9]  Jan A. Bergstra,et al.  Process theory based on bisimulation semantics , 1988, REX Workshop.

[10]  Christian Johansen,et al.  Timers for Distributed Systems , 2006, Electron. Notes Theor. Comput. Sci..

[11]  Marco Roccetti,et al.  A Theory of Processes with Durational Actions , 1995, Theor. Comput. Sci..

[12]  Martin Berger Basic Theory of Reduction Congruence forTwo Timed Asynchronous pi-Calculi , 2004, CONCUR.

[13]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[14]  Vincent Danos,et al.  Reversible Communicating Systems , 2004, CONCUR.

[15]  David Teller,et al.  Using ambients to control resources , 2004, International Journal of Information Security.

[16]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[17]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

[18]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, Inf. Comput..

[19]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .