TY  - JOUR
ID  - eprints291
EP  - 1525
AV  - none
TI  - Basic observables for a calculus for global computing
KW  - Process calculi; Distribution and mobility; Explicit connections; Basic observables; Bisimulation; May testing
UR  - http://www.sciencedirect.com/science/article/pii/S089054010700048X
SN  - 0890-5401
N2  - We develop the semantic theory of a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribution, process mobility and remote asynchronous communication through distributed data repositories, the language has primitives for explicitly modelling inter-node connections and for dynamically activating and deactivating 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. We then focus on barbed congruence and provide an alternative characterisation in terms of a labelled bisimulation. To test practical usability of the semantic theory, we model a system of communicating mobile devices and use the introduced proof techniques to verify one of its key properties.
VL  - 205
Y1  - 2007///
IS  - 10
JF  - Information and Computation
A1  - De Nicola, Rocco
A1  - Gorla, Daniele
A1  - Pugliese, Rosario
PB  - Elsevier
SP  - 1491
ER  -