@incollection{eprints305,
            year = {2005},
           title = {Basic Observables for a Calculus for Global Computing},
          series = {Lecture Notes in Computer Science},
           pages = {1226--1238},
          volume = {3580},
          editor = {Luis Caires and Giuseppe F. Italiano and Luis Monteiro and Catuscia Palamidessi and Moti Yung},
       booktitle = {Automata, Languages and Programming (ICALP 2005)},
          author = {Rocco De Nicola and Daniele Gorla and Rosario Pugliese},
       publisher = {Springer},
        abstract = {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.},
             url = {http://eprints.imtlucca.it/305/}
}