Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 The Nomadic Pict Page
Nomadic Pict
Implementation and Semantics of Mobile Agent Infrastructure
The Nomadic Pict project studied programming language design and
communication primitives for mobile computation.
Communication primitives for interaction between
mobile agents can be classified into two levels of abstraction. At a low level
there are location dependent primitives that require an
programmer to know the current site of a mobile agent in
order to communicate with it. At a high level there are location
independent primitives that allow communication with a mobile agent
irrespective of its current site and of any migrations.
Implementation of these requires delicate distributed infrastructure.
We proposed a simple calculus of agents that allows implementations
of such distributed infrastructure algorithms to be expressed as encodings,
or compilations, of the whole calculus into the fragment with only
location dependent communication.
These encodings give executable descriptions of the algorithms,
providing a clean implementation strategy for prototype languages.
The calculus is equipped with a precise semantics, providing a solid
basis for understanding the algorithms and for reasoning about
their correctness and robustness.
We implemented a language, Nomadic Pict, based on the calculus
to enable experiments with
distributed algorithms
and agent computing. Nomadic Pict is an extension of Pict with the notion of
locations,
agents, migration, distribution, and failures.
At the same time we developed reasoning techniques for
correctness and robustness proofs of these algorithms.
Nomadic Pict: Language
and
Infrastructure Design for Mobile Agents,
Pawel Wojciechowski and Peter Sewell.
This appeared in
ASA/MA'99 (First International Symposium on Agent
Systems and Applications/Third International Symposium on
Mobile Agents), October 1999.
An extended version appeared in IEEE Concurrency vol 8 no 2, 2000.