%X We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribution, mobility, remote operations and asynchronous communication through distributed data spaces, the language provides constructs for explicitly modelling inter-node connections and for dynamically establishing and removing them. For the proposed language, we define natural notions of extensional observations and study their closure under operational reductions and/or language contexts to obtain barbed congruence and may testing equivalence. For such equivalences, we provide alternative characterizations in terms of a labelled bisimulation and a trace equivalence that can be used for actual proofs.
%E Luis Caires
%E Giuseppe F. Italiano
%E Luis Monteiro
%E Catuscia Palamidessi
%E Moti Yung
%D 2005
%L eprints305
%S Lecture Notes in Computer Science
%A Rocco De Nicola
%A Daniele Gorla
%A Rosario Pugliese
%R 10.1007/11523468_99
%B Automata, Languages and Programming (ICALP 2005)
%T Basic Observables for a Calculus for Global Computing
%P 1226-1238
%I Springer
%V 3580