We present a simple labelled transition system semantics of Cardelli
and Gordon's Ambient calculus.
We exploit a general and flexible model based on
(hyper)graphs, where graph transformation is obtained via (hyper)edge
replacement and local synchronization with mobility. In addition to
tree-like ambients, the calculus we define works just as well with
graph-like ambients, which are a more realistic model of internetworks.