Global Computing in a Dynamic Network of Tuple Spaces
Abstract
We present a calculus inspired by Klaim whose main features are: explicit process distribution and node interconnections, remote operations, process mobility and asynchronous communication through distributed tuple spaces. We first introduce a basic language where connections are reliable and immutable; then, we enrich it with two more advanced features for global computing, i.e. failures and dynamically evolving connections. In each setting, we use our formalisms to specify some non-trivial global computing applications and exploit the semantic theory based on an observational equivalence to equationally establish properties of the considered case-studies.
@InProceedings\{nicola.etal:global-computing-dynamic-network,
author = \{R. {De Nicola} and D. Gorla and R. Pugliese},
title = \{Global Computing in a Dynamic Network of Tuple Spaces},
booktitle = \{Proc. of 7th International Conference on Coordination Models and Languages (COORDINATION 2005)},
year = \{2005},
pages = \{157--172},
volume = \{3454},
series = \{LNCS},
publisher = \{Springer},
url = \{http://mikado.di.fc.ul.pt/repository/nicola.etal_global-computing-dynamic-network.pdf}
}
About this site. Last modified: Fri Apr 19 09:39:48 CEST 2024