Using Ambients to Control Resources*

Teller, David; Zimmer, Pascal; Hirschkoff, Daniel

doi:10.1007/3-540-45694-5_20

Cited by 29 publications

(18 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For some reason, they are not allowed to travel directly, but should be enclosed into an IP packet first. The following system provides an encoding for such a situation: data first goes into a packet, tells it its destination, packet moves along the network and releases the data agent when arrived (this protocol is quite close to the taxi protocol for ambient presented in [TZH02]). …”

Section: Packet Routingmentioning

confidence: 99%

A Calculus for Context-Awareness

Zimmer¹

2005

BRICS

Self Cite

View full text Add to dashboard Cite

In order to answer the challenge of pervasive computing, we propose a new process calculus, whose aim is to describe dynamic systems composed of agents able to move and react differently depending on their location. This Context-Aware Calculus features a hierarchical structure similar to mobile ambients, and a generic multi-agent synchronization mechanism, inspired from the join-calculus. After general ideas and introduction, we review the full calculus' syntax and semantics, as well as some motivating examples, study its expressiveness, and show how the notion of computation itself can be made context-dependent.

show abstract

Section: Packet Routingmentioning

confidence: 99%

A Calculus for Context-Awareness

Zimmer¹

2005

BRICS

Self Cite

View full text Add to dashboard Cite

show abstract

“…One of the calculi that has received the most attention has been Mobile Ambients [6], as witnessed by the numerous variants that have been proposed to overcome some of its perceived deficiencies: Safe Ambients (SA) [12], Safe Ambients with passwords [13], Boxed Ambients (BA) [3], Controlled Ambients (CA) [18], New Boxed Ambients (NBA) [4], Ambients with process migration (M 3 ) [8].…”

Section: Motivationmentioning

confidence: 99%

The Kell Calculus: Operational Semantics and Type System

Bidinger

Stefani

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper 1 presents the Kell calculus, a new distributed process calculus that retains the original insights of the Seal calculus (local actions, process replication) and of the M-calculus (higherorder processes and programmable membranes), although in a much simpler setting than the latter. The calculus is equipped with a type system that enforces a unicity property for location names that is crucial for the efficient implementation of the calculus.

show abstract

“…Their initial goal was "to make mobile computation scale-up to widely distributed, intermittently connected and well administered computational environments". The resulting ambient model is elegant and powerful, well suited for expressing issues of mobile computations as working environment, allowing access to information or resources [2,16]. Many variants have been proposed; among them, we mention mobile safe ambients [17], push and pull ambient calculus [16] and boxed ambients [7].…”

Section: Introductionmentioning

confidence: 99%

“…The resulting ambient model is elegant and powerful, well suited for expressing issues of mobile computations as working environment, allowing access to information or resources [2,16]. Many variants have been proposed; among them, we mention mobile safe ambients [17], push and pull ambient calculus [16] and boxed ambients [7]. Despite the fact that the initial motivation of mobile ambients assumes a high degree of parallelism in their evolution, the usual semantics of the proposed variants is the interleaving semantics.…”

Section: Introductionmentioning

confidence: 99%