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