Paper appeared in 7th IFIP International Conference on Formal Methods for Object Oriented-based Distributed Systems (FMOODS '05), Athens (Greece), June 15-17, 2005.
In this paper, we present recent work carried on muKlaim, a core calculus that retains most of the features of Klaim: explicit process distribution, remote operations, process mobility and asynchronous communication via distributed tuple spaces. Communication in muKlaim is based on a simple form of pattern matching that enables withdrawal from shared data spaces of matching tuples and binds the matched variables within the continuation process. Pattern matching is orthogonal to the underlying computational paradigm of muKlaim, but affects its expressive power. After presenting the basic pattern matching mechanism, inherited from Klaim, we discuss a number of variants that are easy to implement and test, by means of simple examples, the expressive power of the resulting variants of the language.
@InProceedings{DGP:FMOODS05,
author = {R. {De Nicola} and D. Gorla and R. Pugliese},
title = {Pattern Matching over a Dynamic Network of Tuple Spaces},
editor = {M. Steffen and G. Zavattaro},
booktitle = {Proc. of 7th IFIP International Conference on Formal Methods for Object Oriented-based Distributed Systems (FMOODS 2005)},
series = {LNCS},
volume = {3535},
pages = {1--14},
year = {2005},
publisher = {Springer},
}