%0 Journal Article
%@ 0167-6423
%A De Nicola, Rocco
%A Gorla, Daniele
%A Pugliese, Rosario
%D 2007
%F eprints:292
%I Elsevier
%J Science of Computer Programming
%K Global computing; Formal methods; Observational equivalence; Distributed algorithms; Program verification
%N 2
%P 187-204
%T Global computing in a dynamic network of tuple spaces
%U http://eprints.imtlucca.it/292/
%V 64
%X We present tKlaim (TopologicalKlaim), a process description language that retains the main features of Klaim (process distribution and mobility, remote and asynchronous communication through distributed data spaces), but extends it with new constructs to flexibly model the interconnection structure underlying a network and its evolution in time. We show how tKlaim can be used to model a number of interesting distributed applications and how systems correctness can be guaranteed, also in the presence of failures, by exploiting observational equivalences to study the relationships between descriptions of systems at different levels of abstraction.
%Z Appears in Special Issue on Coordination Models and Languages (COORDINATION 2005)