TY  - CHAP
ED  - Caires, Luis
ED  - F. Italiano, Giuseppe
ED  - Monteiro, Luis
ED  - Palamidessi, Catuscia
ED  - Yung, Moti
Y1  - 2005///
PB  - Springer
A1  - De Nicola, Rocco
A1  - Gorla, Daniele
A1  - Pugliese, Rosario
T3  - Lecture Notes in Computer Science
SP  - 1226
ID  - eprints305
EP  - 1238
T2  - Automata, Languages and Programming (ICALP 2005)
TI  - Basic Observables for a Calculus for Global Computing
AV  - none
UR  - http://dx.doi.org/10.1007/11523468_99
SN  - 3-540-27580-0
M1  - 3580
N2  - 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.
ER  -