De Nicola, Rocco and Gorla, Daniele and Pugliese, Rosario Pattern Matching over a Dynamic Network of Tuple Spaces. In: Formal Methods for Open Object-Based Distributed Systems (FMOODS 2005). Lecture Notes in Computer Science, 3535 . Springer, pp. 1-14. ISBN 3-540-26181-8 (2005)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||27 May 2011 12:47|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)