TY  - CHAP
AV  - none
TI  - Pattern Matching over a Dynamic Network of Tuple Spaces
ID  - eprints304
UR  - http://dx.doi.org/10.1007/11494881_1
PB  - Springer
EP  - 14
SP  - 1
T3  - Lecture Notes in Computer Science
A1  - De Nicola, Rocco
A1  - Gorla, Daniele
A1  - Pugliese, Rosario
T2  - Formal Methods for Open Object-Based Distributed Systems (FMOODS 2005)
M1  - 3535
ED  - Steffen, Martin
ED  - Zavattaro, Gianluigi
N2  - In this paper, we present recent work carried on ? Klaim, 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 ? Klaim 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 ? Klaim, 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.

SN  - 3-540-26181-8
Y1  - 2005///
ER  -